{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZO45Q2CNILWWMF2NDFVGNRY673","short_pith_number":"pith:ZO45Q2CN","schema_version":"1.0","canonical_sha256":"cbb9d8684d42ed66174d196a66c71efeea34581bee766ae943d86e92e81ad68b","source":{"kind":"arxiv","id":"2507.20354","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Almost-Linear-Time Gomory-Hu Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Debmalya Panigrahi, Jason Li, Maximilian Probst Gutenberg, Rasmus Kyng, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan","submitted_at":"2025-07-27T16:59:40Z","abstract_excerpt":"Given an $m$-edge, undirected, weighted graph $G=(V,E,w)$, a Gomory-Hu tree $T$ (Gomory and Hu, 1961) is a tree over the vertex set $V$ such that all-pairs mincuts in $G$ are preserved exactly in $T$.\n  In this article, we give the first almost-optimal $m^{1+o(1)}$-time deterministic algorithm for constructing a Gomory-Hu tree. Prior to our work, the best deterministic algorithm for this problem dated back to the original algorithm of Gomory and Hu that runs in $nm^{1+o(1)}$ time (using current maxflow algorithms). In fact, this is the first almost-linear time deterministic algorithm for even "},"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":"2507.20354","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-27T16:59:40Z","cross_cats_sorted":[],"title_canon_sha256":"8f89aa166c33370cee38da9242f22f362028162f22e59d1fc84cbe276a6ad5c1","abstract_canon_sha256":"2d99e65cdb5cc36766e9059cc4bbeefee74dff800986d80b8729b704e1fee3b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:17.675502Z","signature_b64":"/oigSjT4QMK+5EYTPEeghMcd5jt7GBqaTj5SQlp4UdcA9lKLQ5XHh28wsm46jzmWrYlJbyCyQ/2C+gRmeMSoBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbb9d8684d42ed66174d196a66c71efeea34581bee766ae943d86e92e81ad68b","last_reissued_at":"2026-07-05T11:44:17.674988Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:17.674988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Almost-Linear-Time Gomory-Hu Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Debmalya Panigrahi, Jason Li, Maximilian Probst Gutenberg, Rasmus Kyng, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan","submitted_at":"2025-07-27T16:59:40Z","abstract_excerpt":"Given an $m$-edge, undirected, weighted graph $G=(V,E,w)$, a Gomory-Hu tree $T$ (Gomory and Hu, 1961) is a tree over the vertex set $V$ such that all-pairs mincuts in $G$ are preserved exactly in $T$.\n  In this article, we give the first almost-optimal $m^{1+o(1)}$-time deterministic algorithm for constructing a Gomory-Hu tree. Prior to our work, the best deterministic algorithm for this problem dated back to the original algorithm of Gomory and Hu that runs in $nm^{1+o(1)}$ time (using current maxflow algorithms). In fact, this is the first almost-linear time deterministic algorithm for even "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20354","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/2507.20354/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":"2507.20354","created_at":"2026-07-05T11:44:17.675047+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.20354v1","created_at":"2026-07-05T11:44:17.675047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20354","created_at":"2026-07-05T11:44:17.675047+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZO45Q2CNILWW","created_at":"2026-07-05T11:44:17.675047+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZO45Q2CNILWWMF2N","created_at":"2026-07-05T11:44:17.675047+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZO45Q2CN","created_at":"2026-07-05T11:44:17.675047+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/ZO45Q2CNILWWMF2NDFVGNRY673","json":"https://pith.science/pith/ZO45Q2CNILWWMF2NDFVGNRY673.json","graph_json":"https://pith.science/api/pith-number/ZO45Q2CNILWWMF2NDFVGNRY673/graph.json","events_json":"https://pith.science/api/pith-number/ZO45Q2CNILWWMF2NDFVGNRY673/events.json","paper":"https://pith.science/paper/ZO45Q2CN"},"agent_actions":{"view_html":"https://pith.science/pith/ZO45Q2CNILWWMF2NDFVGNRY673","download_json":"https://pith.science/pith/ZO45Q2CNILWWMF2NDFVGNRY673.json","view_paper":"https://pith.science/paper/ZO45Q2CN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.20354&json=true","fetch_graph":"https://pith.science/api/pith-number/ZO45Q2CNILWWMF2NDFVGNRY673/graph.json","fetch_events":"https://pith.science/api/pith-number/ZO45Q2CNILWWMF2NDFVGNRY673/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZO45Q2CNILWWMF2NDFVGNRY673/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZO45Q2CNILWWMF2NDFVGNRY673/action/storage_attestation","attest_author":"https://pith.science/pith/ZO45Q2CNILWWMF2NDFVGNRY673/action/author_attestation","sign_citation":"https://pith.science/pith/ZO45Q2CNILWWMF2NDFVGNRY673/action/citation_signature","submit_replication":"https://pith.science/pith/ZO45Q2CNILWWMF2NDFVGNRY673/action/replication_record"}},"created_at":"2026-07-05T11:44:17.675047+00:00","updated_at":"2026-07-05T11:44:17.675047+00:00"}