{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Q26U3JVJYQBVLRRLN7DVSGATLX","short_pith_number":"pith:Q26U3JVJ","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"},"canonical_sha256":"86bd4da6a9c40355c62b6fc75918135dde6f0f33f598f1dd803a4a7572ceacb8","source":{"kind":"arxiv","id":"1706.06086","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06086","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06086v3","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06086","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"Q26U3JVJYQBV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q26U3JVJYQBVLRRL","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q26U3JVJ","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Q26U3JVJYQBVLRRLN7DVSGATLX","target":"record","payload":{"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"},"canonical_sha256":"86bd4da6a9c40355c62b6fc75918135dde6f0f33f598f1dd803a4a7572ceacb8","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"},"source_kind":"arxiv","source_id":"1706.06086","source_version":3,"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:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qO04XzJcChPNaypHtQLILB4Ky7DgqqF0/Aw/UqtotbSRoKFfw02TSc8c7Z+aPjejwsFO6OziPc0tgymCpCKbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:51:01.656772Z"},"content_sha256":"640871b550af827122f61cdfb257e247e46b4df7a47dc9298b313aaf52c6e117","schema_version":"1.0","event_id":"sha256:640871b550af827122f61cdfb257e247e46b4df7a47dc9298b313aaf52c6e117"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Q26U3JVJYQBVLRRLN7DVSGATLX","target":"graph","payload":{"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"},"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:27:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QjT/gHuseKKeiN4TIkRHeQtbIM9gKPcMGrTKk9fw3aXkf4Hb7Xyr0SGphiIsTpuFrk2VznYsGmhnGzgBaUspAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T21:51:01.657505Z"},"content_sha256":"b9178e8d423ba01d4c106343f46dce7fab48f717fb90f2d2bd4d24e7b8820ae2","schema_version":"1.0","event_id":"sha256:b9178e8d423ba01d4c106343f46dce7fab48f717fb90f2d2bd4d24e7b8820ae2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q26U3JVJYQBVLRRLN7DVSGATLX/bundle.json","state_url":"https://pith.science/pith/Q26U3JVJYQBVLRRLN7DVSGATLX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q26U3JVJYQBVLRRLN7DVSGATLX/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-23T21:51:01Z","links":{"resolver":"https://pith.science/pith/Q26U3JVJYQBVLRRLN7DVSGATLX","bundle":"https://pith.science/pith/Q26U3JVJYQBVLRRLN7DVSGATLX/bundle.json","state":"https://pith.science/pith/Q26U3JVJYQBVLRRLN7DVSGATLX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q26U3JVJYQBVLRRLN7DVSGATLX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Q26U3JVJYQBVLRRLN7DVSGATLX","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":"0ab376efec0a90960297ced0b2b3566b898da4d247b26f1cc45a69a8beb6c878","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T17:57:08Z","title_canon_sha256":"9c3df4da41f6e7015d5ba17c3ded045291976161aed6383147c35cc2d69993fd"},"schema_version":"1.0","source":{"id":"1706.06086","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06086","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06086v3","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06086","created_at":"2026-05-18T00:27:00Z"},{"alias_kind":"pith_short_12","alias_value":"Q26U3JVJYQBV","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q26U3JVJYQBVLRRL","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q26U3JVJ","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:b9178e8d423ba01d4c106343f46dce7fab48f717fb90f2d2bd4d24e7b8820ae2","target":"graph","created_at":"2026-05-18T00:27: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 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","authors_text":"Anna Zych-Pawlewicz, Marcin Pilipczuk, Nikolai Karpov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T17:57:08Z","title":"An exponential lower bound for cut sparsifiers in planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06086","kind":"arxiv","version":3},"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:640871b550af827122f61cdfb257e247e46b4df7a47dc9298b313aaf52c6e117","target":"record","created_at":"2026-05-18T00:27: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":"0ab376efec0a90960297ced0b2b3566b898da4d247b26f1cc45a69a8beb6c878","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T17:57:08Z","title_canon_sha256":"9c3df4da41f6e7015d5ba17c3ded045291976161aed6383147c35cc2d69993fd"},"schema_version":"1.0","source":{"id":"1706.06086","kind":"arxiv","version":3}},"canonical_sha256":"86bd4da6a9c40355c62b6fc75918135dde6f0f33f598f1dd803a4a7572ceacb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86bd4da6a9c40355c62b6fc75918135dde6f0f33f598f1dd803a4a7572ceacb8","first_computed_at":"2026-05-18T00:27:00.478284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:00.478284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1p/pt7S27TElx562PkBGZwkVhgGMlEwGFnnEnyZwEcEtJ9GqqRIx635BnqPQizT1KCqEjXOq3UQidmzdrEj1BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:00.478980Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.06086","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:640871b550af827122f61cdfb257e247e46b4df7a47dc9298b313aaf52c6e117","sha256:b9178e8d423ba01d4c106343f46dce7fab48f717fb90f2d2bd4d24e7b8820ae2"],"state_sha256":"eb7a71dc22630d80657015931e14dca2616b66ecee3f81f26158160d00bba5ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9u58IEOoOSg7YMC4QLyMhysMxn3cp/kteqkcY8KihjCbLPBt/rKuDW6quiJ3RMYbI2WmDXHMhDsUaqi5DVuAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T21:51:01.661216Z","bundle_sha256":"2dbe2dd43f217fa6f67f1a240ac53f4e7feced9276215dc543f4fee48740ab9f"}}