{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XRJXVRUY7E33AWNI23KQV3YZIU","short_pith_number":"pith:XRJXVRUY","schema_version":"1.0","canonical_sha256":"bc537ac698f937b059a8d6d50aef19453b1587eb89b5cf7cf371b4bc5ee5d43d","source":{"kind":"arxiv","id":"2110.15587","version":2},"attestation_state":"computed","paper":{"title":"A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Arinta Auza, Simon Apers, Troy Lee","submitted_at":"2021-10-29T07:35:46Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2110.15587","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-29T07:35:46Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"cdda9de295c9c45f682fb3f3dd021de22bee38f216055b919d5523b6d9a6a5de","abstract_canon_sha256":"738eb0a5a0e034a1c3b508c11bc99afffe053b846842c70c2e753ce7919f38cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:48.205664Z","signature_b64":"xBCG+ktBQrqhHoP+MzChhMsjXoUYhLHo/Y2RdVLKhT3r3YhgCTysKXKEIWADynfYsfl//qPs/dZXeOc24ktPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc537ac698f937b059a8d6d50aef19453b1587eb89b5cf7cf371b4bc5ee5d43d","last_reissued_at":"2026-07-05T07:40:48.205218Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:48.205218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Arinta Auza, Simon Apers, Troy Lee","submitted_at":"2021-10-29T07:35:46Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.15587","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.15587/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2110.15587","created_at":"2026-07-05T07:40:48.205280+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.15587v2","created_at":"2026-07-05T07:40:48.205280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.15587","created_at":"2026-07-05T07:40:48.205280+00:00"},{"alias_kind":"pith_short_12","alias_value":"XRJXVRUY7E33","created_at":"2026-07-05T07:40:48.205280+00:00"},{"alias_kind":"pith_short_16","alias_value":"XRJXVRUY7E33AWNI","created_at":"2026-07-05T07:40:48.205280+00:00"},{"alias_kind":"pith_short_8","alias_value":"XRJXVRUY","created_at":"2026-07-05T07:40:48.205280+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06287","citing_title":"Quantum Algorithms for Triangle Cut Sparsification","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XRJXVRUY7E33AWNI23KQV3YZIU","json":"https://pith.science/pith/XRJXVRUY7E33AWNI23KQV3YZIU.json","graph_json":"https://pith.science/api/pith-number/XRJXVRUY7E33AWNI23KQV3YZIU/graph.json","events_json":"https://pith.science/api/pith-number/XRJXVRUY7E33AWNI23KQV3YZIU/events.json","paper":"https://pith.science/paper/XRJXVRUY"},"agent_actions":{"view_html":"https://pith.science/pith/XRJXVRUY7E33AWNI23KQV3YZIU","download_json":"https://pith.science/pith/XRJXVRUY7E33AWNI23KQV3YZIU.json","view_paper":"https://pith.science/paper/XRJXVRUY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.15587&json=true","fetch_graph":"https://pith.science/api/pith-number/XRJXVRUY7E33AWNI23KQV3YZIU/graph.json","fetch_events":"https://pith.science/api/pith-number/XRJXVRUY7E33AWNI23KQV3YZIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XRJXVRUY7E33AWNI23KQV3YZIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XRJXVRUY7E33AWNI23KQV3YZIU/action/storage_attestation","attest_author":"https://pith.science/pith/XRJXVRUY7E33AWNI23KQV3YZIU/action/author_attestation","sign_citation":"https://pith.science/pith/XRJXVRUY7E33AWNI23KQV3YZIU/action/citation_signature","submit_replication":"https://pith.science/pith/XRJXVRUY7E33AWNI23KQV3YZIU/action/replication_record"}},"created_at":"2026-07-05T07:40:48.205280+00:00","updated_at":"2026-07-05T07:40:48.205280+00:00"}