{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LJ6I34XVIXH7TZS2HZUWSLSQM3","short_pith_number":"pith:LJ6I34XV","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"},"canonical_sha256":"5a7c8df2f545cff9e65a3e69692e5066d10bb415de38f7a9718e4ae9d37f2137","source":{"kind":"arxiv","id":"1807.07331","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07331","created_at":"2026-05-18T00:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07331v1","created_at":"2026-05-18T00:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07331","created_at":"2026-05-18T00:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"LJ6I34XVIXH7","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LJ6I34XVIXH7TZS2","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LJ6I34XV","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LJ6I34XVIXH7TZS2HZUWSLSQM3","target":"record","payload":{"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"},"canonical_sha256":"5a7c8df2f545cff9e65a3e69692e5066d10bb415de38f7a9718e4ae9d37f2137","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"},"source_kind":"arxiv","source_id":"1807.07331","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T1oIAttkApPDtdgYgvcJvhYJsdcY4OVbM4CVOAIgK27pD+n/36LVzhCyeEc1B23URtjXJDPUey0+BIogv7v7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:38:19.146865Z"},"content_sha256":"b8825a80dfa12944fa255929c43768ee98b061c98b446d242b23f95513c54b36","schema_version":"1.0","event_id":"sha256:b8825a80dfa12944fa255929c43768ee98b061c98b446d242b23f95513c54b36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LJ6I34XVIXH7TZS2HZUWSLSQM3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KzivYs3bP+hg0NCigVZO2T8aCluM7P6yuLfWGH4LOSgM/R5JzirYZObpPx3dYELs5PXFCyiQkbnW+UWJex0VCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:38:19.147212Z"},"content_sha256":"5c5cdd0876bb8b76c3bbb2580b8f9f454e69ae5940dac356213f17f11888a65e","schema_version":"1.0","event_id":"sha256:5c5cdd0876bb8b76c3bbb2580b8f9f454e69ae5940dac356213f17f11888a65e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3/bundle.json","state_url":"https://pith.science/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T05:38:19Z","links":{"resolver":"https://pith.science/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3","bundle":"https://pith.science/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3/bundle.json","state":"https://pith.science/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJ6I34XVIXH7TZS2HZUWSLSQM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LJ6I34XVIXH7TZS2HZUWSLSQM3","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":"79954026b69b284a2edf780e514d887e7b981f61eb2a116bfb8eb4545285e603","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-19T10:28:04Z","title_canon_sha256":"0aa7da5ec8e0a69303724055b888ec71a5c398c05cf7dea86954f3681e78f7e2"},"schema_version":"1.0","source":{"id":"1807.07331","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07331","created_at":"2026-05-18T00:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07331v1","created_at":"2026-05-18T00:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07331","created_at":"2026-05-18T00:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"LJ6I34XVIXH7","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LJ6I34XVIXH7TZS2","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LJ6I34XV","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:5c5cdd0876bb8b76c3bbb2580b8f9f454e69ae5940dac356213f17f11888a65e","target":"graph","created_at":"2026-05-18T00:10:20Z","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"},"paper":{"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","authors_text":"F. Bruce Shepherd, Guyslain Naves","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-19T10:28:04Z","title":"When Do Gomory-Hu Subtrees Exist?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07331","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:b8825a80dfa12944fa255929c43768ee98b061c98b446d242b23f95513c54b36","target":"record","created_at":"2026-05-18T00:10:20Z","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":"79954026b69b284a2edf780e514d887e7b981f61eb2a116bfb8eb4545285e603","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-07-19T10:28:04Z","title_canon_sha256":"0aa7da5ec8e0a69303724055b888ec71a5c398c05cf7dea86954f3681e78f7e2"},"schema_version":"1.0","source":{"id":"1807.07331","kind":"arxiv","version":1}},"canonical_sha256":"5a7c8df2f545cff9e65a3e69692e5066d10bb415de38f7a9718e4ae9d37f2137","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a7c8df2f545cff9e65a3e69692e5066d10bb415de38f7a9718e4ae9d37f2137","first_computed_at":"2026-05-18T00:10:20.490143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:20.490143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KkGc8wjaArYX7mN8SFZC7xenWAFFjfVwQHiUgsY+Jnrnpb1FI7gU5y67Qi9VZwj6qVtWO2dkDTq27pYkzpaPDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:20.490785Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07331","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8825a80dfa12944fa255929c43768ee98b061c98b446d242b23f95513c54b36","sha256:5c5cdd0876bb8b76c3bbb2580b8f9f454e69ae5940dac356213f17f11888a65e"],"state_sha256":"4d88e88c4be75d8a0fc62dede5231cc63c562c2955b7a5d5f66591ea9dfda482"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDgCNz/RbxcUqf3Hdo2uaKO3hpuiZb+eRrP1OAkKOwMGnPsVeIsrayHuJNmOFfmTfrQNibBGCHbA8hNHI/4TAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:38:19.149158Z","bundle_sha256":"308b0348fd2a94ff056d60fa413c095462704753a87f9c5170fd56dd4164c2e9"}}