{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZO45Q2CNILWWMF2NDFVGNRY673","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":"2d99e65cdb5cc36766e9059cc4bbeefee74dff800986d80b8729b704e1fee3b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-27T16:59:40Z","title_canon_sha256":"8f89aa166c33370cee38da9242f22f362028162f22e59d1fc84cbe276a6ad5c1"},"schema_version":"1.0","source":{"id":"2507.20354","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.20354","created_at":"2026-07-05T11:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"2507.20354v1","created_at":"2026-07-05T11:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.20354","created_at":"2026-07-05T11:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"ZO45Q2CNILWW","created_at":"2026-07-05T11:44:17Z"},{"alias_kind":"pith_short_16","alias_value":"ZO45Q2CNILWWMF2N","created_at":"2026-07-05T11:44:17Z"},{"alias_kind":"pith_short_8","alias_value":"ZO45Q2CN","created_at":"2026-07-05T11:44:17Z"}],"graph_snapshots":[{"event_id":"sha256:9963079da16cd0cd48e932ebbd172c2493a57a9195e04a8e90d2083210b3c3d6","target":"graph","created_at":"2026-07-05T11:44:17Z","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/2507.20354/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Amir Abboud, Debmalya Panigrahi, Jason Li, Maximilian Probst Gutenberg, Rasmus Kyng, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-27T16:59:40Z","title":"Deterministic Almost-Linear-Time Gomory-Hu Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.20354","kind":"arxiv","version":1},"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:b5f1042ce3a56c2a06ffb03c02df08f4a76cc925c61497f27060de68f5957d7e","target":"record","created_at":"2026-07-05T11:44:17Z","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":"2d99e65cdb5cc36766e9059cc4bbeefee74dff800986d80b8729b704e1fee3b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-27T16:59:40Z","title_canon_sha256":"8f89aa166c33370cee38da9242f22f362028162f22e59d1fc84cbe276a6ad5c1"},"schema_version":"1.0","source":{"id":"2507.20354","kind":"arxiv","version":1}},"canonical_sha256":"cbb9d8684d42ed66174d196a66c71efeea34581bee766ae943d86e92e81ad68b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbb9d8684d42ed66174d196a66c71efeea34581bee766ae943d86e92e81ad68b","first_computed_at":"2026-07-05T11:44:17.674988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:17.674988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/oigSjT4QMK+5EYTPEeghMcd5jt7GBqaTj5SQlp4UdcA9lKLQ5XHh28wsm46jzmWrYlJbyCyQ/2C+gRmeMSoBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:17.675502Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.20354","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5f1042ce3a56c2a06ffb03c02df08f4a76cc925c61497f27060de68f5957d7e","sha256:9963079da16cd0cd48e932ebbd172c2493a57a9195e04a8e90d2083210b3c3d6"],"state_sha256":"7ecbf6750c9ab5fa3ba6b59f0e38f94ab1511ce1e3dff727ee9d0c71e54d65b9"}