{"id":2251636,"recorded_at":"2026-11-02T19:30:19.746193Z","observed_at":"2026-11-02T19:30:19.746142Z","subject_kind":"source_record","subject":"x402_bazaar:https://detect.halowerk.com/v1/workflow/workflow-minimum-cycle-basis-cost","kind":"listing","method":"sync.x402_bazaar/1","body":{"endpoints":[["x402","https://detect.halowerk.com/v1/workflow/workflow-minimum-cycle-basis-cost"]],"name":"detect.halowerk.com/v1/workflow/workflow-minimum-cycle-basis-cost","owner_address":"0x2880edfff13100677bf97a3cbdf3bc34771c4e5e","raw":{"accepts":[{"amount":"2000","asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","extra":{"assetTransferMethod":"eip3009","eip712Domain":{"chainId":8453,"name":"USD Coin","verifyingContract":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","version":"2"},"name":"USD Coin","version":"2"},"maxTimeoutSeconds":300,"network":"eip155:8453","payTo":"0x2880EdfFF13100677Bf97A3CBdF3Bc34771C4E5E","scheme":"exact"}],"description":"An agent that exports an independent loop basis for an undirected integration graph needs its claimed minimum total loop weight checked across the full binary cycle space.","extensions":{"bazaar":{"info":{"input":{"body":{"artifact":{"claimed_cost":0,"edges":[{"cost":6,"u":0,"v":1},{"cost":2,"u":1,"v":2}],"vertices":3}},"bodyType":"json","method":"POST","type":"http"},"output":{"example":{"billable":true,"findings":[{"confidence":100,"evidence":[{"page_indices":[],"page_url":null,"pattern":"workflow-minimum-cycle-basis-cost_scoped_evidence","type":"artifact"}],"limits":["Only the explicit bounded artifact is measured. No retrieval, execution, real credential validation, contact output or legal/security/quality judgement.","Simple undirected weighted graph, at most8 vertices and18 edges. All simple cycles are enumerated and a minimum-weight GF2 basis is selected; disconnected components and zero-cost edges supported. Enumeration work above200000 is unknown. No physical network observations."],"module":"workflow-minimum-cycle-basis-cost","module_cpu_ms":0,"state":"not_observed","value":{"binary_cycle_rank":0,"claimed_basis_cost_matches":true,"connected_components":1,"graph_edges":2,"graph_vertices":3,"minimum_basis_cost":0},"warnings":[]}],"known_count":1,"scope":{"contact_values_returned":false,"network":false,"supplied_artifact_only":true},"warnings":[]},"type":"json"}},"schema":{"$schema":"https://json-schema.org/draft/2020-12/schema","properties":{"input":{"additionalProperties":false,"properties":{"body":{"additionalProperties":false,"properties":{"artifact":{"additionalProperties":false,"properties":{"claimed_cost":{"maximum":144000,"minimum":0,"type":"integer"},"edges":{"items":{"additionalProperties":false,"properties":{"cost":{"maximum":1000,"minimum":0,"type":"integer"},"u":{"maximum":7,"minimum":0,"type":"integer"},"v":{"maximum":7,"minimum":0,"type":"integer"}},"required":["u","v","cost"],"type":"object"},"maxItems":18,"minItems":0,"type":"array"},"vertices":{"maximum":8,"minimum":1,"type":"integer"}},"required":["vertices","edges","claimed_cost"],"type":"object"}},"required":["artifact"],"type":"object"},"bodyType":{"enum":["json","form-data","text"],"type":"string"},"method":{"enum":["POST"],"type":"string"},"type":{"const":"http","type":"string"}},"required":["type","method","bodyType","body"],"type":"object"},"output":{"properties":{"example":{"type":"object"},"type":{"type":"string"}},"required":["type"],"type":"object"}},"required":["input"],"type":"object"}}},"lastUpdated":"2026-11-02T15:53:56.542Z","quality":{"l30DaysTotalCalls":1,"l30DaysUniquePayers":1,"lastCalledAt":"2026-11-02T15:53:56.358Z"},"resource":"https://detect.halowerk.com/v1/workflow/workflow-minimum-cycle-basis-cost","type":"http","x402Version":2},"source":"x402_bazaar","summary":"An agent that exports an independent loop basis for an undirected integration graph needs its claimed minimum total loop weight checked across the full binary cycle space."},"body_sha256":"8db5dbaf9a9a8c86a3b6c9c1eb354302ca181653cbf682ee6b469b39d39aebf8","prev_id":null,"leaf":"0xccb04702e5b7c7043bec13b4b6c4bd1d7f1284ac087b67172efa94741c230692","leaf_text":"{\"body\":\"8db5dbaf9a9a8c86a3b6c9c1eb354302ca181653cbf682ee6b469b39d39aebf8\",\"id\":2251636,\"kind\":\"listing\",\"method\":\"sync.x402_bazaar/1\",\"observed_us\":1793647819746142,\"prev\":null,\"subject\":\"x402_bazaar:https://detect.halowerk.com/v1/workflow/workflow-minimum-cycle-basis-cost\",\"subject_kind\":\"source_record\"}","day":{"day":"2026-11-02","leaves":444186,"root":"0x78fecaabbe319e56f5c4b80fc02e2052e198ad24781da8832a475ff65f2002d1","chained":"0xdc35957db5d1371ca382b9152878ffece28ec7c5cb4f98fd71ddb367f8b999b2","anchor_chain":"eip155:5042002","anchor_tx":"0x56b814612eb2e3e544153df3e91e1f7199106d1e430c7d8c6b653feeb9ebe9af","anchor_block":70432815},"proof":["0xccb0e3b6ed63c50a71b756152251c91566ab7913d17273de5733bdac775564d3","0xb6e4aaa910a6b325bc9912aef40f9060bb05ae2d590d10106111f7f7ebe2cf4a","0x101247f3a826188b8e5f64219d87d17ff9dd42117f436f65baa7798af5e2d608","0xde40682a9678a132dbb5b730c7a508a0e3bdf3c616ee85fd3d73aac4b7d5aa1d","0x4a29ef4674dbfa3c69531712cd1347965599ed4c3abdf6f113bc66202a1e552f","0xee8dc7b5ad4a22ca9a80ec875a72af4d55e9509725f4619d008e90789fab151b","0xd69632afcf205ddbdea2bbcf9dec1afa4932cba3c7d6cbe21368ab8348344c55","0xe04d3685b0d7368b3f22007fff998eca79c5ec4af7519ed9330ca6a84fbbe2ca","0x1cbadb0086347a7b88be84bfb1005c310f11130bc321eb361fc0921ecbaafcfc","0x23f0499f18fd5652c141e9fa5704f2844fe735fc07c5debfecf1e1ff897f10c0","0x79f32fe170b18b7905e03cd8a56dff870af479aedaa23b3d71551c62cbacdbbf","0x104b0fd7f9e0a9cd51db3ad451e9a16d136da470f6efdf3cf1ad75354f332bc0","0x959c0d70f3f85beefd7b1347751e6e712eeaefce78a57d80eda6882038b85a52","0x4f21464039902a4044b17c93873adb5a93eecc8e977b4e039acb8cd5f4210b4b","0x5b456020389d8e0ef67f16a492c600b5b88189e59398bba308734db7e873e7e4","0x37d31d28d0bd3743650d57e9fbf999efa4592cac831267f83aa125335b35a16b","0xdb8bd933619a267f9790faac9839143d202be46af284371cc369cdf683f897ba","0x98cbbf2c68ab4c0b4db782aeb88bea1f30b02178cf8b5d3d24a931d19492ea6d","0x252cce55f1a3d5391c16f82d7f62494429a5f69b03486d4cfcfb7b2c96d6c884"]}