{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:MJIBOEXOW5WPUQYS56ASTKANIX","short_pith_number":"pith:MJIBOEXO","schema_version":"1.0","canonical_sha256":"62501712eeb76cfa4312ef8129a80d45c30e16e474aa9de7199717ca4647d172","source":{"kind":"arxiv","id":"2112.01042","version":1},"attestation_state":"computed","paper":{"title":"Gomory-Hu Trees in Quadratic Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tianyi Zhang","submitted_at":"2021-12-02T08:08:33Z","abstract_excerpt":"Gomory-Hu tree [Gomory and Hu, 1961] is a succinct representation of pairwise minimum cuts in an undirected graph. When the input graph has general edge weights, classic algorithms need at least cubic running time to compute a Gomory-Hu tree. Very recently, the authors of [AKL+, arXiv v1, 2021] have improved the running time to $\\tilde{O}(n^{2.875})$ which breaks the cubic barrier for the first time. In this paper, we refine their approach and improve the running time to $\\tilde{O}(n^2)$. This quadratic upper bound is also obtained independently in an updated version by the same group of autho"},"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":"2112.01042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-12-02T08:08:33Z","cross_cats_sorted":[],"title_canon_sha256":"e9dedd530958c239ed5439b47ac7fb10f0b6e6ecb8679e975ef887cb35f5afb0","abstract_canon_sha256":"651b373bfc545e03039dbbf3b3bb86cbab5bfb88824b507fba3d19642f9b653a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:02.991941Z","signature_b64":"ymMZEQa/IwfRB85+fxrHjq7T5ZrSzjjwV4Umh5Wg6gniCH7HN3nbhoO1GXVG4xshPqc9isO1sPQuDPXU5htFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62501712eeb76cfa4312ef8129a80d45c30e16e474aa9de7199717ca4647d172","last_reissued_at":"2026-07-05T03:37:02.991486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:02.991486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gomory-Hu Trees in Quadratic Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tianyi Zhang","submitted_at":"2021-12-02T08:08:33Z","abstract_excerpt":"Gomory-Hu tree [Gomory and Hu, 1961] is a succinct representation of pairwise minimum cuts in an undirected graph. When the input graph has general edge weights, classic algorithms need at least cubic running time to compute a Gomory-Hu tree. Very recently, the authors of [AKL+, arXiv v1, 2021] have improved the running time to $\\tilde{O}(n^{2.875})$ which breaks the cubic barrier for the first time. In this paper, we refine their approach and improve the running time to $\\tilde{O}(n^2)$. This quadratic upper bound is also obtained independently in an updated version by the same group of autho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01042","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/2112.01042/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":"2112.01042","created_at":"2026-07-05T03:37:02.991543+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.01042v1","created_at":"2026-07-05T03:37:02.991543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01042","created_at":"2026-07-05T03:37:02.991543+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJIBOEXOW5WP","created_at":"2026-07-05T03:37:02.991543+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJIBOEXOW5WPUQYS","created_at":"2026-07-05T03:37:02.991543+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJIBOEXO","created_at":"2026-07-05T03:37:02.991543+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.02520","citing_title":"A Simple and Fast Reduction from Gomory-Hu Trees to Polylog Maxflows","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MJIBOEXOW5WPUQYS56ASTKANIX","json":"https://pith.science/pith/MJIBOEXOW5WPUQYS56ASTKANIX.json","graph_json":"https://pith.science/api/pith-number/MJIBOEXOW5WPUQYS56ASTKANIX/graph.json","events_json":"https://pith.science/api/pith-number/MJIBOEXOW5WPUQYS56ASTKANIX/events.json","paper":"https://pith.science/paper/MJIBOEXO"},"agent_actions":{"view_html":"https://pith.science/pith/MJIBOEXOW5WPUQYS56ASTKANIX","download_json":"https://pith.science/pith/MJIBOEXOW5WPUQYS56ASTKANIX.json","view_paper":"https://pith.science/paper/MJIBOEXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.01042&json=true","fetch_graph":"https://pith.science/api/pith-number/MJIBOEXOW5WPUQYS56ASTKANIX/graph.json","fetch_events":"https://pith.science/api/pith-number/MJIBOEXOW5WPUQYS56ASTKANIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJIBOEXOW5WPUQYS56ASTKANIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJIBOEXOW5WPUQYS56ASTKANIX/action/storage_attestation","attest_author":"https://pith.science/pith/MJIBOEXOW5WPUQYS56ASTKANIX/action/author_attestation","sign_citation":"https://pith.science/pith/MJIBOEXOW5WPUQYS56ASTKANIX/action/citation_signature","submit_replication":"https://pith.science/pith/MJIBOEXOW5WPUQYS56ASTKANIX/action/replication_record"}},"created_at":"2026-07-05T03:37:02.991543+00:00","updated_at":"2026-07-05T03:37:02.991543+00:00"}