{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:W7CPBIDJVRQTXSZFEN6C5E2V6T","short_pith_number":"pith:W7CPBIDJ","schema_version":"1.0","canonical_sha256":"b7c4f0a069ac613bcb25237c2e9355f4e9aa8734c5075aaa1378cbf9f81840c1","source":{"kind":"arxiv","id":"2606.06287","version":1},"attestation_state":"computed","paper":{"title":"Quantum Algorithms for Triangle Cut Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Pan Peng, Shan Jiang","submitted_at":"2026-06-04T15:25:34Z","abstract_excerpt":"Triangles capture higher-order structures in graphs and are fundamental to applications such as clustering and network analysis.\n  To enable efficient use of such structures at scale, we study the problem of \\emph{triangle cut sparsification}, which aims to reduce the graph size while approximately preserving triangle counts across every cut.\n  We investigate \\emph{quantum algorithms} for this problem, using triangle listing as our main technical ingredient.\n  In particular, we present a quantum algorithm for triangle listing that, for a graph with $n$ vertices, $m$ edges, and $t$ triangles, r"},"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":"2606.06287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-06-04T15:25:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c4c57285e506d6a8ccff8869c330a91fa866aad21dbe9d898627068c5ffcdaf6","abstract_canon_sha256":"c6844654d70939b848973f7514d7a334cbcca81677e2f7e8b67556ea1eae9749"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:40.598054Z","signature_b64":"GFuVoBx5XYzKaidVU86tqv61v/RCGDHrJEwvYRc7ygJcwA/z9zinjF2OnY1OtduddyshOLRIrQGBjE0sAHfSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7c4f0a069ac613bcb25237c2e9355f4e9aa8734c5075aaa1378cbf9f81840c1","last_reissued_at":"2026-06-05T01:15:40.597699Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:40.597699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithms for Triangle Cut Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Pan Peng, Shan Jiang","submitted_at":"2026-06-04T15:25:34Z","abstract_excerpt":"Triangles capture higher-order structures in graphs and are fundamental to applications such as clustering and network analysis.\n  To enable efficient use of such structures at scale, we study the problem of \\emph{triangle cut sparsification}, which aims to reduce the graph size while approximately preserving triangle counts across every cut.\n  We investigate \\emph{quantum algorithms} for this problem, using triangle listing as our main technical ingredient.\n  In particular, we present a quantum algorithm for triangle listing that, for a graph with $n$ vertices, $m$ edges, and $t$ triangles, r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06287","kind":"arxiv","version":1},"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/2606.06287/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":"2606.06287","created_at":"2026-06-05T01:15:40.597757+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.06287v1","created_at":"2026-06-05T01:15:40.597757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06287","created_at":"2026-06-05T01:15:40.597757+00:00"},{"alias_kind":"pith_short_12","alias_value":"W7CPBIDJVRQT","created_at":"2026-06-05T01:15:40.597757+00:00"},{"alias_kind":"pith_short_16","alias_value":"W7CPBIDJVRQTXSZF","created_at":"2026-06-05T01:15:40.597757+00:00"},{"alias_kind":"pith_short_8","alias_value":"W7CPBIDJ","created_at":"2026-06-05T01:15:40.597757+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W7CPBIDJVRQTXSZFEN6C5E2V6T","json":"https://pith.science/pith/W7CPBIDJVRQTXSZFEN6C5E2V6T.json","graph_json":"https://pith.science/api/pith-number/W7CPBIDJVRQTXSZFEN6C5E2V6T/graph.json","events_json":"https://pith.science/api/pith-number/W7CPBIDJVRQTXSZFEN6C5E2V6T/events.json","paper":"https://pith.science/paper/W7CPBIDJ"},"agent_actions":{"view_html":"https://pith.science/pith/W7CPBIDJVRQTXSZFEN6C5E2V6T","download_json":"https://pith.science/pith/W7CPBIDJVRQTXSZFEN6C5E2V6T.json","view_paper":"https://pith.science/paper/W7CPBIDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.06287&json=true","fetch_graph":"https://pith.science/api/pith-number/W7CPBIDJVRQTXSZFEN6C5E2V6T/graph.json","fetch_events":"https://pith.science/api/pith-number/W7CPBIDJVRQTXSZFEN6C5E2V6T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W7CPBIDJVRQTXSZFEN6C5E2V6T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W7CPBIDJVRQTXSZFEN6C5E2V6T/action/storage_attestation","attest_author":"https://pith.science/pith/W7CPBIDJVRQTXSZFEN6C5E2V6T/action/author_attestation","sign_citation":"https://pith.science/pith/W7CPBIDJVRQTXSZFEN6C5E2V6T/action/citation_signature","submit_replication":"https://pith.science/pith/W7CPBIDJVRQTXSZFEN6C5E2V6T/action/replication_record"}},"created_at":"2026-06-05T01:15:40.597757+00:00","updated_at":"2026-06-05T01:15:40.597757+00:00"}