{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q26U3JVJYQBVLRRLN7DVSGATLX","short_pith_number":"pith:Q26U3JVJ","schema_version":"1.0","canonical_sha256":"86bd4da6a9c40355c62b6fc75918135dde6f0f33f598f1dd803a4a7572ceacb8","source":{"kind":"arxiv","id":"1706.06086","version":3},"attestation_state":"computed","paper":{"title":"An exponential lower bound for cut sparsifiers in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna Zych-Pawlewicz, Marcin Pilipczuk, Nikolai Karpov","submitted_at":"2017-06-19T17:57:08Z","abstract_excerpt":"Given an edge-weighted graph $G$ with a set $Q$ of $k$ terminals, a mimicking network is a graph with the same set of terminals that exactly preserves the sizes of minimum cuts between any partition of the terminals. A natural question in the area of graph compression is to provide as small mimicking networks as possible for input graph $G$ being either an arbitrary graph or coming from a specific graph class.\n  In this note we show an exponential lower bound for cut mimicking networks in planar graphs: there are edge-weighted planar graphs with $k$ terminals that require $2^{k-2}$ edges in an"},"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":"1706.06086","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T17:57:08Z","cross_cats_sorted":[],"title_canon_sha256":"9c3df4da41f6e7015d5ba17c3ded045291976161aed6383147c35cc2d69993fd","abstract_canon_sha256":"0ab376efec0a90960297ced0b2b3566b898da4d247b26f1cc45a69a8beb6c878"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:00.478980Z","signature_b64":"1p/pt7S27TElx562PkBGZwkVhgGMlEwGFnnEnyZwEcEtJ9GqqRIx635BnqPQizT1KCqEjXOq3UQidmzdrEj1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86bd4da6a9c40355c62b6fc75918135dde6f0f33f598f1dd803a4a7572ceacb8","last_reissued_at":"2026-05-18T00:27:00.478284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:00.478284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An exponential lower bound for cut sparsifiers in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna Zych-Pawlewicz, Marcin Pilipczuk, Nikolai Karpov","submitted_at":"2017-06-19T17:57:08Z","abstract_excerpt":"Given an edge-weighted graph $G$ with a set $Q$ of $k$ terminals, a mimicking network is a graph with the same set of terminals that exactly preserves the sizes of minimum cuts between any partition of the terminals. A natural question in the area of graph compression is to provide as small mimicking networks as possible for input graph $G$ being either an arbitrary graph or coming from a specific graph class.\n  In this note we show an exponential lower bound for cut mimicking networks in planar graphs: there are edge-weighted planar graphs with $k$ terminals that require $2^{k-2}$ edges in an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06086","kind":"arxiv","version":3},"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":"1706.06086","created_at":"2026-05-18T00:27:00.478409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06086v3","created_at":"2026-05-18T00:27:00.478409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06086","created_at":"2026-05-18T00:27:00.478409+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q26U3JVJYQBV","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q26U3JVJYQBVLRRL","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q26U3JVJ","created_at":"2026-05-18T12:31:37.085036+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/Q26U3JVJYQBVLRRLN7DVSGATLX","json":"https://pith.science/pith/Q26U3JVJYQBVLRRLN7DVSGATLX.json","graph_json":"https://pith.science/api/pith-number/Q26U3JVJYQBVLRRLN7DVSGATLX/graph.json","events_json":"https://pith.science/api/pith-number/Q26U3JVJYQBVLRRLN7DVSGATLX/events.json","paper":"https://pith.science/paper/Q26U3JVJ"},"agent_actions":{"view_html":"https://pith.science/pith/Q26U3JVJYQBVLRRLN7DVSGATLX","download_json":"https://pith.science/pith/Q26U3JVJYQBVLRRLN7DVSGATLX.json","view_paper":"https://pith.science/paper/Q26U3JVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06086&json=true","fetch_graph":"https://pith.science/api/pith-number/Q26U3JVJYQBVLRRLN7DVSGATLX/graph.json","fetch_events":"https://pith.science/api/pith-number/Q26U3JVJYQBVLRRLN7DVSGATLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q26U3JVJYQBVLRRLN7DVSGATLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q26U3JVJYQBVLRRLN7DVSGATLX/action/storage_attestation","attest_author":"https://pith.science/pith/Q26U3JVJYQBVLRRLN7DVSGATLX/action/author_attestation","sign_citation":"https://pith.science/pith/Q26U3JVJYQBVLRRLN7DVSGATLX/action/citation_signature","submit_replication":"https://pith.science/pith/Q26U3JVJYQBVLRRLN7DVSGATLX/action/replication_record"}},"created_at":"2026-05-18T00:27:00.478409+00:00","updated_at":"2026-05-18T00:27:00.478409+00:00"}