{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:G5NK2O2557EA3VOEWMLD7FISP5","short_pith_number":"pith:G5NK2O25","schema_version":"1.0","canonical_sha256":"375aad3b5defc80dd5c4b3163f95127f5df7d053a59b25dda3db2b5081927b18","source":{"kind":"arxiv","id":"1310.0178","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Gomory-Hu Tree Construction -- fast and simple","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dorothea Wagner, Tanja Hartmann","submitted_at":"2013-10-01T08:15:28Z","abstract_excerpt":"A cut tree (or Gomory-Hu tree) of an undirected weighted graph G=(V,E) encodes a minimum s-t-cut for each vertex pair {s,t} \\subseteq V and can be iteratively constructed by n-1 maximum flow computations. They solve the multiterminal network flow problem, which asks for the all-pairs maximum flow values in a network and at the same time they represent n-1 non-crossing, linearly independent cuts that constitute a minimum cut basis of G. Hence, cut trees are resident in at least two fundamental fields of network analysis and graph theory, which emphasizes their importance for many applications. "},"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":"1310.0178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-01T08:15:28Z","cross_cats_sorted":[],"title_canon_sha256":"13d11edc86d66ccb73c37a478c5872c801fe716ab5f5bfccbb1f800cb9fcbd11","abstract_canon_sha256":"63a86b1a5ae14b3ad7d7f156798201432952936b8612ea597719178c8291e390"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:45.273326Z","signature_b64":"zV6fDo/KzPz7JGUsli2QCyuBO1xDWKd1M4ZUORzTpw8beaF8cs1UeLBZriXsb0UD+UYVX2+DOP1h9ZZ+RB0JBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"375aad3b5defc80dd5c4b3163f95127f5df7d053a59b25dda3db2b5081927b18","last_reissued_at":"2026-05-18T03:11:45.272357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:45.272357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Gomory-Hu Tree Construction -- fast and simple","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dorothea Wagner, Tanja Hartmann","submitted_at":"2013-10-01T08:15:28Z","abstract_excerpt":"A cut tree (or Gomory-Hu tree) of an undirected weighted graph G=(V,E) encodes a minimum s-t-cut for each vertex pair {s,t} \\subseteq V and can be iteratively constructed by n-1 maximum flow computations. They solve the multiterminal network flow problem, which asks for the all-pairs maximum flow values in a network and at the same time they represent n-1 non-crossing, linearly independent cuts that constitute a minimum cut basis of G. Hence, cut trees are resident in at least two fundamental fields of network analysis and graph theory, which emphasizes their importance for many applications. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0178","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":""},"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":"1310.0178","created_at":"2026-05-18T03:11:45.272525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.0178v1","created_at":"2026-05-18T03:11:45.272525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0178","created_at":"2026-05-18T03:11:45.272525+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5NK2O2557EA","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5NK2O2557EA3VOE","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5NK2O25","created_at":"2026-05-18T12:27:45.050594+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/G5NK2O2557EA3VOEWMLD7FISP5","json":"https://pith.science/pith/G5NK2O2557EA3VOEWMLD7FISP5.json","graph_json":"https://pith.science/api/pith-number/G5NK2O2557EA3VOEWMLD7FISP5/graph.json","events_json":"https://pith.science/api/pith-number/G5NK2O2557EA3VOEWMLD7FISP5/events.json","paper":"https://pith.science/paper/G5NK2O25"},"agent_actions":{"view_html":"https://pith.science/pith/G5NK2O2557EA3VOEWMLD7FISP5","download_json":"https://pith.science/pith/G5NK2O2557EA3VOEWMLD7FISP5.json","view_paper":"https://pith.science/paper/G5NK2O25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.0178&json=true","fetch_graph":"https://pith.science/api/pith-number/G5NK2O2557EA3VOEWMLD7FISP5/graph.json","fetch_events":"https://pith.science/api/pith-number/G5NK2O2557EA3VOEWMLD7FISP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5NK2O2557EA3VOEWMLD7FISP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5NK2O2557EA3VOEWMLD7FISP5/action/storage_attestation","attest_author":"https://pith.science/pith/G5NK2O2557EA3VOEWMLD7FISP5/action/author_attestation","sign_citation":"https://pith.science/pith/G5NK2O2557EA3VOEWMLD7FISP5/action/citation_signature","submit_replication":"https://pith.science/pith/G5NK2O2557EA3VOEWMLD7FISP5/action/replication_record"}},"created_at":"2026-05-18T03:11:45.272525+00:00","updated_at":"2026-05-18T03:11:45.272525+00:00"}