{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LJ6I34XVIXH7TZS2HZUWSLSQM3","short_pith_number":"pith:LJ6I34XV","schema_version":"1.0","canonical_sha256":"5a7c8df2f545cff9e65a3e69692e5066d10bb415de38f7a9718e4ae9d37f2137","source":{"kind":"arxiv","id":"1807.07331","version":1},"attestation_state":"computed","paper":{"title":"When Do Gomory-Hu Subtrees Exist?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"F. Bruce Shepherd, Guyslain Naves","submitted_at":"2018-07-19T10:28:04Z","abstract_excerpt":"Gomory-Hu (GH) Trees are a classical sparsification technique for graph connectivity. It is one of the fundamental models in combinatorial optimization which also continually finds new applications, most recently in social network analysis. For any edge-capacitated undirected graph $G=(V,E)$ and any subset of {\\em terminals} $Z \\subseteq V$, a Gomory-Hu Tree is an edge-capacitated tree $T=(Z,E(T))$ such that for every $u,v \\in Z$, the value of the minimum capacity $uv$ cut in $G$ is the same as in $T$. Moreover, the minimum cuts in $T$ directly identify (in a certain way) those in $G$. It is w"},"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":"1807.07331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-19T10:28:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0aa7da5ec8e0a69303724055b888ec71a5c398c05cf7dea86954f3681e78f7e2","abstract_canon_sha256":"79954026b69b284a2edf780e514d887e7b981f61eb2a116bfb8eb4545285e603"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:20.490785Z","signature_b64":"KkGc8wjaArYX7mN8SFZC7xenWAFFjfVwQHiUgsY+Jnrnpb1FI7gU5y67Qi9VZwj6qVtWO2dkDTq27pYkzpaPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a7c8df2f545cff9e65a3e69692e5066d10bb415de38f7a9718e4ae9d37f2137","last_reissued_at":"2026-05-18T00:10:20.490143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:20.490143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When Do Gomory-Hu Subtrees Exist?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"F. Bruce Shepherd, Guyslain Naves","submitted_at":"2018-07-19T10:28:04Z","abstract_excerpt":"Gomory-Hu (GH) Trees are a classical sparsification technique for graph connectivity. It is one of the fundamental models in combinatorial optimization which also continually finds new applications, most recently in social network analysis. For any edge-capacitated undirected graph $G=(V,E)$ and any subset of {\\em terminals} $Z \\subseteq V$, a Gomory-Hu Tree is an edge-capacitated tree $T=(Z,E(T))$ such that for every $u,v \\in Z$, the value of the minimum capacity $uv$ cut in $G$ is the same as in $T$. Moreover, the minimum cuts in $T$ directly identify (in a certain way) those in $G$. It is w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07331","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":"1807.07331","created_at":"2026-05-18T00:10:20.490227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07331v1","created_at":"2026-05-18T00:10:20.490227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07331","created_at":"2026-05-18T00:10:20.490227+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJ6I34XVIXH7","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJ6I34XVIXH7TZS2","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJ6I34XV","created_at":"2026-05-18T12:32:37.024351+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/LJ6I34XVIXH7TZS2HZUWSLSQM3","json":"https://pith.science/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3.json","graph_json":"https://pith.science/api/pith-number/LJ6I34XVIXH7TZS2HZUWSLSQM3/graph.json","events_json":"https://pith.science/api/pith-number/LJ6I34XVIXH7TZS2HZUWSLSQM3/events.json","paper":"https://pith.science/paper/LJ6I34XV"},"agent_actions":{"view_html":"https://pith.science/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3","download_json":"https://pith.science/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3.json","view_paper":"https://pith.science/paper/LJ6I34XV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07331&json=true","fetch_graph":"https://pith.science/api/pith-number/LJ6I34XVIXH7TZS2HZUWSLSQM3/graph.json","fetch_events":"https://pith.science/api/pith-number/LJ6I34XVIXH7TZS2HZUWSLSQM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3/action/storage_attestation","attest_author":"https://pith.science/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3/action/author_attestation","sign_citation":"https://pith.science/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3/action/citation_signature","submit_replication":"https://pith.science/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3/action/replication_record"}},"created_at":"2026-05-18T00:10:20.490227+00:00","updated_at":"2026-05-18T00:10:20.490227+00:00"}