{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KUM4VRKQIRFEPQUQVXU524UISE","short_pith_number":"pith:KUM4VRKQ","schema_version":"1.0","canonical_sha256":"5519cac550444a47c290ade9dd728891325dedd42446e8ea6ff89965fa12d078","source":{"kind":"arxiv","id":"1207.6371","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.6371","created_at":"2026-05-18T03:50:00.436302+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.6371v1","created_at":"2026-05-18T03:50:00.436302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6371","created_at":"2026-05-18T03:50:00.436302+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUM4VRKQIRFE","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUM4VRKQIRFEPQUQ","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUM4VRKQ","created_at":"2026-05-18T12:27:11.947152+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/KUM4VRKQIRFEPQUQVXU524UISE","json":"https://pith.science/pith/KUM4VRKQIRFEPQUQVXU524UISE.json","graph_json":"https://pith.science/api/pith-number/KUM4VRKQIRFEPQUQVXU524UISE/graph.json","events_json":"https://pith.science/api/pith-number/KUM4VRKQIRFEPQUQVXU524UISE/events.json","paper":"https://pith.science/paper/KUM4VRKQ"},"agent_actions":{"view_html":"https://pith.science/pith/KUM4VRKQIRFEPQUQVXU524UISE","download_json":"https://pith.science/pith/KUM4VRKQIRFEPQUQVXU524UISE.json","view_paper":"https://pith.science/paper/KUM4VRKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.6371&json=true","fetch_graph":"https://pith.science/api/pith-number/KUM4VRKQIRFEPQUQVXU524UISE/graph.json","fetch_events":"https://pith.science/api/pith-number/KUM4VRKQIRFEPQUQVXU524UISE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUM4VRKQIRFEPQUQVXU524UISE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUM4VRKQIRFEPQUQVXU524UISE/action/storage_attestation","attest_author":"https://pith.science/pith/KUM4VRKQIRFEPQUQVXU524UISE/action/author_attestation","sign_citation":"https://pith.science/pith/KUM4VRKQIRFEPQUQVXU524UISE/action/citation_signature","submit_replication":"https://pith.science/pith/KUM4VRKQIRFEPQUQVXU524UISE/action/replication_record"}},"created_at":"2026-05-18T03:50:00.436302+00:00","updated_at":"2026-05-18T03:50:00.436302+00:00"}