{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KUM4VRKQIRFEPQUQVXU524UISE","short_pith_number":"pith:KUM4VRKQ","canonical_record":{"source":{"id":"1207.6371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-26T19:03:25Z","cross_cats_sorted":[],"title_canon_sha256":"c214370a6cad2cb247c81e5d4b921eef289775a67f8503342a5531f8c4b72522","abstract_canon_sha256":"fba1c5039e2587ec6890390a3ef1b972e73246aa563a25005726c897b89fff4d"},"schema_version":"1.0"},"canonical_sha256":"5519cac550444a47c290ade9dd728891325dedd42446e8ea6ff89965fa12d078","source":{"kind":"arxiv","id":"1207.6371","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6371","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6371v1","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6371","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"KUM4VRKQIRFE","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KUM4VRKQIRFEPQUQ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KUM4VRKQ","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KUM4VRKQIRFEPQUQVXU524UISE","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-26T19:03:25Z","cross_cats_sorted":[],"title_canon_sha256":"c214370a6cad2cb247c81e5d4b921eef289775a67f8503342a5531f8c4b72522","abstract_canon_sha256":"fba1c5039e2587ec6890390a3ef1b972e73246aa563a25005726c897b89fff4d"},"schema_version":"1.0"},"canonical_sha256":"5519cac550444a47c290ade9dd728891325dedd42446e8ea6ff89965fa12d078","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:00.436652Z","signature_b64":"v2+6g4o5vUqmotZ/8DjSL+5/1kZt/RLApMAZBoV0IooQ/nttBJOV180spRi56zKEh2chSGfzZdqIQ6ikUhH9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5519cac550444a47c290ade9dd728891325dedd42446e8ea6ff89965fa12d078","last_reissued_at":"2026-05-18T03:50:00.436243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:00.436243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6371","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:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0DJgH7p+ikHElOYW/cXe0DY0O8P5hqFK7P3/lnOJ/fplPhAVjW5aEzUGRDFa1+pCefLW33tLo+BFvXNeVENkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:09:31.652232Z"},"content_sha256":"3c92a6a613f6fe32f6fab5ea3294473eb3eb7166506fb745d830bc81fab4fd55","schema_version":"1.0","event_id":"sha256:3c92a6a613f6fe32f6fab5ea3294473eb3eb7166506fb745d830bc81fab4fd55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KUM4VRKQIRFEPQUQVXU524UISE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Mimicking Networks Representing Minimum Terminal Cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arindam Khan, L\\'aszl\\'o A. V\\'egh, Prasad Raghavendra, Prasad Tetali","submitted_at":"2012-07-26T19:03:25Z","abstract_excerpt":"Given a capacitated undirected graph $G=(V,E)$ with a set of terminals $K \\subset V$, a mimicking network is a smaller graph $H=(V_H,E_H)$ that exactly preserves all the minimum cuts between the terminals. Specifically, the vertex set of the sparsifier $V_H$ contains the set of terminals $K$ and for every bipartition $U, K-U $ of the terminals $K$, the size of the minimum cut separating $U$ from $K-U$ in $G$ is exactly equal to the size of the minimum cut separating $U$ from $K-U$ in $H$.\n  This notion of a mimicking network was introduced by Hagerup, Katajainen, Nishimura and Ragde (1995) who"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6371","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:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOVa44R3EDzhVowoDWWmwdQIc9l33e8pKpOtiuUUYBzbbPxKmy9cZGOynPhnr6gRAojv/ZoZCJppUesmSp5YCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:09:31.652946Z"},"content_sha256":"fda1757ba98ab10550ca0a6113690c0a8baac108f5cf597f1c9cc18b2fdfd32d","schema_version":"1.0","event_id":"sha256:fda1757ba98ab10550ca0a6113690c0a8baac108f5cf597f1c9cc18b2fdfd32d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUM4VRKQIRFEPQUQVXU524UISE/bundle.json","state_url":"https://pith.science/pith/KUM4VRKQIRFEPQUQVXU524UISE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUM4VRKQIRFEPQUQVXU524UISE/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-06-09T18:09:31Z","links":{"resolver":"https://pith.science/pith/KUM4VRKQIRFEPQUQVXU524UISE","bundle":"https://pith.science/pith/KUM4VRKQIRFEPQUQVXU524UISE/bundle.json","state":"https://pith.science/pith/KUM4VRKQIRFEPQUQVXU524UISE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUM4VRKQIRFEPQUQVXU524UISE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KUM4VRKQIRFEPQUQVXU524UISE","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":"fba1c5039e2587ec6890390a3ef1b972e73246aa563a25005726c897b89fff4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-26T19:03:25Z","title_canon_sha256":"c214370a6cad2cb247c81e5d4b921eef289775a67f8503342a5531f8c4b72522"},"schema_version":"1.0","source":{"id":"1207.6371","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6371","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6371v1","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6371","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"KUM4VRKQIRFE","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KUM4VRKQIRFEPQUQ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KUM4VRKQ","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:fda1757ba98ab10550ca0a6113690c0a8baac108f5cf597f1c9cc18b2fdfd32d","target":"graph","created_at":"2026-05-18T03:50:00Z","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":"Given a capacitated undirected graph $G=(V,E)$ with a set of terminals $K \\subset V$, a mimicking network is a smaller graph $H=(V_H,E_H)$ that exactly preserves all the minimum cuts between the terminals. Specifically, the vertex set of the sparsifier $V_H$ contains the set of terminals $K$ and for every bipartition $U, K-U $ of the terminals $K$, the size of the minimum cut separating $U$ from $K-U$ in $G$ is exactly equal to the size of the minimum cut separating $U$ from $K-U$ in $H$.\n  This notion of a mimicking network was introduced by Hagerup, Katajainen, Nishimura and Ragde (1995) who","authors_text":"Arindam Khan, L\\'aszl\\'o A. V\\'egh, Prasad Raghavendra, Prasad Tetali","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-26T19:03:25Z","title":"On Mimicking Networks Representing Minimum Terminal Cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6371","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:3c92a6a613f6fe32f6fab5ea3294473eb3eb7166506fb745d830bc81fab4fd55","target":"record","created_at":"2026-05-18T03:50:00Z","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":"fba1c5039e2587ec6890390a3ef1b972e73246aa563a25005726c897b89fff4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-26T19:03:25Z","title_canon_sha256":"c214370a6cad2cb247c81e5d4b921eef289775a67f8503342a5531f8c4b72522"},"schema_version":"1.0","source":{"id":"1207.6371","kind":"arxiv","version":1}},"canonical_sha256":"5519cac550444a47c290ade9dd728891325dedd42446e8ea6ff89965fa12d078","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5519cac550444a47c290ade9dd728891325dedd42446e8ea6ff89965fa12d078","first_computed_at":"2026-05-18T03:50:00.436243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:00.436243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v2+6g4o5vUqmotZ/8DjSL+5/1kZt/RLApMAZBoV0IooQ/nttBJOV180spRi56zKEh2chSGfzZdqIQ6ikUhH9Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:00.436652Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6371","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c92a6a613f6fe32f6fab5ea3294473eb3eb7166506fb745d830bc81fab4fd55","sha256:fda1757ba98ab10550ca0a6113690c0a8baac108f5cf597f1c9cc18b2fdfd32d"],"state_sha256":"6c3d0ec89a7f0627109fb9d179ee122624487cdf613585ad1a945d95a7876900"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JwRB+bwAIpUxLA2pmM8UpxXiRc96N7D0RNLpAt51D58YjF/BYCHs+9DJofazOMghIbh501RFaqs/o+/xtWAPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:09:31.656825Z","bundle_sha256":"a16cbf1fd4be89272eec322fd2596c6ae3e62911c8aad919f353ed19ae6b7a11"}}