{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:XRJXVRUY7E33AWNI23KQV3YZIU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"738eb0a5a0e034a1c3b508c11bc99afffe053b846842c70c2e753ce7919f38cc","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-29T07:35:46Z","title_canon_sha256":"cdda9de295c9c45f682fb3f3dd021de22bee38f216055b919d5523b6d9a6a5de"},"schema_version":"1.0","source":{"id":"2110.15587","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.15587","created_at":"2026-07-05T07:40:48Z"},{"alias_kind":"arxiv_version","alias_value":"2110.15587v2","created_at":"2026-07-05T07:40:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.15587","created_at":"2026-07-05T07:40:48Z"},{"alias_kind":"pith_short_12","alias_value":"XRJXVRUY7E33","created_at":"2026-07-05T07:40:48Z"},{"alias_kind":"pith_short_16","alias_value":"XRJXVRUY7E33AWNI","created_at":"2026-07-05T07:40:48Z"},{"alias_kind":"pith_short_8","alias_value":"XRJXVRUY","created_at":"2026-07-05T07:40:48Z"}],"graph_snapshots":[{"event_id":"sha256:c187cd789cf7aaefae9c1fe3bfe9897e872adfb0378bac95394ee991b464871a","target":"graph","created_at":"2026-07-05T07:40:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.15587/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An $s{\\operatorname{-}}t$ minimum cut in a graph corresponds to a minimum weight subset of edges whose removal disconnects vertices $s$ and $t$. Finding such a cut is a classic problem that is dual to that of finding a maximum flow from $s$ to $t$. In this work we describe a quantum algorithm for the minimum $s{\\operatorname{-}}t$ cut problem on undirected graphs. For an undirected graph with $n$ vertices, $m$ edges, and integral edge weights bounded by $W$, the algorithm computes with high probability the weight of a minimum $s{\\operatorname{-}}t$ cut after $\\widetilde O(\\sqrt{m} n^{5/6} W^{1","authors_text":"Arinta Auza, Simon Apers, Troy Lee","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-29T07:35:46Z","title":"A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.15587","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9f8a89c65af15cfc1a59cb2576df1ea9345a578f3fb8f9277fa3e855e4e924e3","target":"record","created_at":"2026-07-05T07:40:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"738eb0a5a0e034a1c3b508c11bc99afffe053b846842c70c2e753ce7919f38cc","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-29T07:35:46Z","title_canon_sha256":"cdda9de295c9c45f682fb3f3dd021de22bee38f216055b919d5523b6d9a6a5de"},"schema_version":"1.0","source":{"id":"2110.15587","kind":"arxiv","version":2}},"canonical_sha256":"bc537ac698f937b059a8d6d50aef19453b1587eb89b5cf7cf371b4bc5ee5d43d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc537ac698f937b059a8d6d50aef19453b1587eb89b5cf7cf371b4bc5ee5d43d","first_computed_at":"2026-07-05T07:40:48.205218Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:40:48.205218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xBCG+ktBQrqhHoP+MzChhMsjXoUYhLHo/Y2RdVLKhT3r3YhgCTysKXKEIWADynfYsfl//qPs/dZXeOc24ktPCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:40:48.205664Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.15587","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f8a89c65af15cfc1a59cb2576df1ea9345a578f3fb8f9277fa3e855e4e924e3","sha256:c187cd789cf7aaefae9c1fe3bfe9897e872adfb0378bac95394ee991b464871a"],"state_sha256":"43ac3358a6bf7ec58e85da137e4343f75294466c7c7bd00ab11f67d25962f2bb"}