{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:G5NK2O2557EA3VOEWMLD7FISP5","short_pith_number":"pith:G5NK2O25","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"},"canonical_sha256":"375aad3b5defc80dd5c4b3163f95127f5df7d053a59b25dda3db2b5081927b18","source":{"kind":"arxiv","id":"1310.0178","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0178","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0178v1","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0178","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"G5NK2O2557EA","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G5NK2O2557EA3VOE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G5NK2O25","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:G5NK2O2557EA3VOEWMLD7FISP5","target":"record","payload":{"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"},"canonical_sha256":"375aad3b5defc80dd5c4b3163f95127f5df7d053a59b25dda3db2b5081927b18","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"},"source_kind":"arxiv","source_id":"1310.0178","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-18T03:11:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mtZYXDghFKscfJfL8R4v4uJH5atwaLObLoGELFLiZz1/CciFRGedbtwDiyCrc+TSjUnwemvfjoeLBcXzZTn3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:12:41.584141Z"},"content_sha256":"00983180d6eb9ec968666c79295c6a963eedf48e7772ad24e778f70f9571db23","schema_version":"1.0","event_id":"sha256:00983180d6eb9ec968666c79295c6a963eedf48e7772ad24e778f70f9571db23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:G5NK2O2557EA3VOEWMLD7FISP5","target":"graph","payload":{"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"},"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-18T03:11:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AgsGwQQ4KETcY1zN58QCa9meBk5y+NJUEftiKgAs9E2mPXE+YyfgoYyfengTVPIKbZy6ZIm14lumKd1Q+d23Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:12:41.584799Z"},"content_sha256":"e9a474e03da8de7d0be24a164c0a5974007d34a8769166ccf8f0f734ce170f24","schema_version":"1.0","event_id":"sha256:e9a474e03da8de7d0be24a164c0a5974007d34a8769166ccf8f0f734ce170f24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G5NK2O2557EA3VOEWMLD7FISP5/bundle.json","state_url":"https://pith.science/pith/G5NK2O2557EA3VOEWMLD7FISP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G5NK2O2557EA3VOEWMLD7FISP5/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-26T18:12:41Z","links":{"resolver":"https://pith.science/pith/G5NK2O2557EA3VOEWMLD7FISP5","bundle":"https://pith.science/pith/G5NK2O2557EA3VOEWMLD7FISP5/bundle.json","state":"https://pith.science/pith/G5NK2O2557EA3VOEWMLD7FISP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G5NK2O2557EA3VOEWMLD7FISP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:G5NK2O2557EA3VOEWMLD7FISP5","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":"63a86b1a5ae14b3ad7d7f156798201432952936b8612ea597719178c8291e390","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-01T08:15:28Z","title_canon_sha256":"13d11edc86d66ccb73c37a478c5872c801fe716ab5f5bfccbb1f800cb9fcbd11"},"schema_version":"1.0","source":{"id":"1310.0178","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0178","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0178v1","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0178","created_at":"2026-05-18T03:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"G5NK2O2557EA","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G5NK2O2557EA3VOE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G5NK2O25","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:e9a474e03da8de7d0be24a164c0a5974007d34a8769166ccf8f0f734ce170f24","target":"graph","created_at":"2026-05-18T03:11:45Z","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":"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. ","authors_text":"Dorothea Wagner, Tanja Hartmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-01T08:15:28Z","title":"Dynamic Gomory-Hu Tree Construction -- fast and simple"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0178","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:00983180d6eb9ec968666c79295c6a963eedf48e7772ad24e778f70f9571db23","target":"record","created_at":"2026-05-18T03:11:45Z","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":"63a86b1a5ae14b3ad7d7f156798201432952936b8612ea597719178c8291e390","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-01T08:15:28Z","title_canon_sha256":"13d11edc86d66ccb73c37a478c5872c801fe716ab5f5bfccbb1f800cb9fcbd11"},"schema_version":"1.0","source":{"id":"1310.0178","kind":"arxiv","version":1}},"canonical_sha256":"375aad3b5defc80dd5c4b3163f95127f5df7d053a59b25dda3db2b5081927b18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"375aad3b5defc80dd5c4b3163f95127f5df7d053a59b25dda3db2b5081927b18","first_computed_at":"2026-05-18T03:11:45.272357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:45.272357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zV6fDo/KzPz7JGUsli2QCyuBO1xDWKd1M4ZUORzTpw8beaF8cs1UeLBZriXsb0UD+UYVX2+DOP1h9ZZ+RB0JBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:45.273326Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.0178","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00983180d6eb9ec968666c79295c6a963eedf48e7772ad24e778f70f9571db23","sha256:e9a474e03da8de7d0be24a164c0a5974007d34a8769166ccf8f0f734ce170f24"],"state_sha256":"46f43eee7dcbb93666b517415795ba8a4a50aa703f03bbe443028dc4744c8f07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e0a65A1vqEsQ7H2if4EB3jxOwB5SBEZjEoB5u5tD8KX/PR6Dk/a3SJ2lyNI4L9azg+pSl0wrWJWkLQf6BBG3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:12:41.588361Z","bundle_sha256":"0122e2cc017397d58f73dcb01e977f2d1a0afd1a08b50c54b2fd4161f35b6e5a"}}