{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PBCRLUTBTVEIU3AP44IQBI5NA3","short_pith_number":"pith:PBCRLUTB","canonical_record":{"source":{"id":"1702.05951","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T12:42:07Z","cross_cats_sorted":[],"title_canon_sha256":"c97b895acbf89b8b6a8ef684f1c4a9da8561361d18a2bda01179f36305d37b9b","abstract_canon_sha256":"8f298817ba780b1bcf409868f5fa1acfebabaf06067c0ade5a906644e1b99966"},"schema_version":"1.0"},"canonical_sha256":"784515d2619d488a6c0fe71100a3ad06dbb47afb3fe6386db576818f9980902a","source":{"kind":"arxiv","id":"1702.05951","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05951","created_at":"2026-07-05T00:09:57Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05951v3","created_at":"2026-07-05T00:09:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05951","created_at":"2026-07-05T00:09:57Z"},{"alias_kind":"pith_short_12","alias_value":"PBCRLUTBTVEI","created_at":"2026-07-05T00:09:57Z"},{"alias_kind":"pith_short_16","alias_value":"PBCRLUTBTVEIU3AP","created_at":"2026-07-05T00:09:57Z"},{"alias_kind":"pith_short_8","alias_value":"PBCRLUTB","created_at":"2026-07-05T00:09:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PBCRLUTBTVEIU3AP44IQBI5NA3","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05951","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T12:42:07Z","cross_cats_sorted":[],"title_canon_sha256":"c97b895acbf89b8b6a8ef684f1c4a9da8561361d18a2bda01179f36305d37b9b","abstract_canon_sha256":"8f298817ba780b1bcf409868f5fa1acfebabaf06067c0ade5a906644e1b99966"},"schema_version":"1.0"},"canonical_sha256":"784515d2619d488a6c0fe71100a3ad06dbb47afb3fe6386db576818f9980902a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:09:57.389121Z","signature_b64":"3uXcW6FMaEbaMBgrM/ZUHvi1aLKC5o7oEr5UPr3YNWW9i7XczGxHISXZaNn0pHw5/WkThmmf2cl1wQtQ6/afAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"784515d2619d488a6c0fe71100a3ad06dbb47afb3fe6386db576818f9980902a","last_reissued_at":"2026-07-05T00:09:57.388690Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:09:57.388690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05951","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-07-05T00:09:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a5+qD+Y5fhHg/S5LH5BEfUmQCQhcv70WGf7yPHEMBoSt0RSzo3IioP+jhCjnWJGUE8Lglpfkpsir2joIkBVfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T12:25:14.287607Z"},"content_sha256":"6e8e3a19e7f584782f8a294d534183e02ab58a891fa94198556633941715e401","schema_version":"1.0","event_id":"sha256:6e8e3a19e7f584782f8a294d534183e02ab58a891fa94198556633941715e401"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PBCRLUTBTVEIU3AP44IQBI5NA3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Refined Vertex Sparsifiers of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Havana (Inbal) Rika, Robert Krauthgamer","submitted_at":"2017-02-20T12:42:07Z","abstract_excerpt":"We study the following version of cut sparsification. Given a large edge-weighted network $G$ with $k$ terminal vertices, compress it into a smaller network $H$ with the same terminals, such that every minimum terminal cut in $H$ approximates the corresponding one in $G$, up to a factor $q\\geq 1$ that is called the quality. (The case $q=1$ is known also as a mimicking network). We provide new insights about the structure of minimum terminal cuts, leading to new results for cut sparsifiers of planar graphs. Our first contribution identifies a subset of the minimum terminal cuts, which we call e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05951","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1702.05951/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:09:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFsxrZ46//ZJ36lEUST7rgIe+eBQu3QosBDxo6FGrR3Vr+NIAL4IF0Y5aKiRkWNNDgW2w+VIhmFtNTRIhdD6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T12:25:14.288469Z"},"content_sha256":"32580ac25922c544be4efe9d3cc05ce5ea0e17bf6da0a34c0f28e34932d88643","schema_version":"1.0","event_id":"sha256:32580ac25922c544be4efe9d3cc05ce5ea0e17bf6da0a34c0f28e34932d88643"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBCRLUTBTVEIU3AP44IQBI5NA3/bundle.json","state_url":"https://pith.science/pith/PBCRLUTBTVEIU3AP44IQBI5NA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBCRLUTBTVEIU3AP44IQBI5NA3/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-08-20T12:25:14Z","links":{"resolver":"https://pith.science/pith/PBCRLUTBTVEIU3AP44IQBI5NA3","bundle":"https://pith.science/pith/PBCRLUTBTVEIU3AP44IQBI5NA3/bundle.json","state":"https://pith.science/pith/PBCRLUTBTVEIU3AP44IQBI5NA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBCRLUTBTVEIU3AP44IQBI5NA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PBCRLUTBTVEIU3AP44IQBI5NA3","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":"8f298817ba780b1bcf409868f5fa1acfebabaf06067c0ade5a906644e1b99966","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T12:42:07Z","title_canon_sha256":"c97b895acbf89b8b6a8ef684f1c4a9da8561361d18a2bda01179f36305d37b9b"},"schema_version":"1.0","source":{"id":"1702.05951","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05951","created_at":"2026-07-05T00:09:57Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05951v3","created_at":"2026-07-05T00:09:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05951","created_at":"2026-07-05T00:09:57Z"},{"alias_kind":"pith_short_12","alias_value":"PBCRLUTBTVEI","created_at":"2026-07-05T00:09:57Z"},{"alias_kind":"pith_short_16","alias_value":"PBCRLUTBTVEIU3AP","created_at":"2026-07-05T00:09:57Z"},{"alias_kind":"pith_short_8","alias_value":"PBCRLUTB","created_at":"2026-07-05T00:09:57Z"}],"graph_snapshots":[{"event_id":"sha256:32580ac25922c544be4efe9d3cc05ce5ea0e17bf6da0a34c0f28e34932d88643","target":"graph","created_at":"2026-07-05T00:09:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1702.05951/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the following version of cut sparsification. Given a large edge-weighted network $G$ with $k$ terminal vertices, compress it into a smaller network $H$ with the same terminals, such that every minimum terminal cut in $H$ approximates the corresponding one in $G$, up to a factor $q\\geq 1$ that is called the quality. (The case $q=1$ is known also as a mimicking network). We provide new insights about the structure of minimum terminal cuts, leading to new results for cut sparsifiers of planar graphs. Our first contribution identifies a subset of the minimum terminal cuts, which we call e","authors_text":"Havana (Inbal) Rika, Robert Krauthgamer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T12:42:07Z","title":"Refined Vertex Sparsifiers of Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05951","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:6e8e3a19e7f584782f8a294d534183e02ab58a891fa94198556633941715e401","target":"record","created_at":"2026-07-05T00:09:57Z","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":"8f298817ba780b1bcf409868f5fa1acfebabaf06067c0ade5a906644e1b99966","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-20T12:42:07Z","title_canon_sha256":"c97b895acbf89b8b6a8ef684f1c4a9da8561361d18a2bda01179f36305d37b9b"},"schema_version":"1.0","source":{"id":"1702.05951","kind":"arxiv","version":3}},"canonical_sha256":"784515d2619d488a6c0fe71100a3ad06dbb47afb3fe6386db576818f9980902a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"784515d2619d488a6c0fe71100a3ad06dbb47afb3fe6386db576818f9980902a","first_computed_at":"2026-07-05T00:09:57.388690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:09:57.388690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3uXcW6FMaEbaMBgrM/ZUHvi1aLKC5o7oEr5UPr3YNWW9i7XczGxHISXZaNn0pHw5/WkThmmf2cl1wQtQ6/afAw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:09:57.389121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05951","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e8e3a19e7f584782f8a294d534183e02ab58a891fa94198556633941715e401","sha256:32580ac25922c544be4efe9d3cc05ce5ea0e17bf6da0a34c0f28e34932d88643"],"state_sha256":"2b27d8b683b30fe5e2d920bc91960658b9a50b4e46634f3d32226740fcb85cd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jySQ14h1uNaTlGWL8nb3VEUZr22qNA4DIKY0rexTAImMgGd0E/jDQiaZVtAaWmW8IrN7BSNsVJWG9ir6WKkyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T12:25:14.292739Z","bundle_sha256":"2d86b74e3385cdc26a792ca5e15c7e82aa5d6ee5c2bed3146de17857f5d58c18"}}