{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PHUN6HXI3TBX3UR4JKHEY6AULA","short_pith_number":"pith:PHUN6HXI","canonical_record":{"source":{"id":"2507.09620","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-13T12:58:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"015006b58d1a43b3dbc05ca7f86572f862e187ac9dd4bff5070fb5b89926dc52","abstract_canon_sha256":"f2ebefe7e197ab446c146276f3f46b724a1c4bae77543a7b01b3f177b2db5c5e"},"schema_version":"1.0"},"canonical_sha256":"79e8df1ee8dcc37dd23c4a8e4c78145829887e9cf1b6e1585d87367f90b8061b","source":{"kind":"arxiv","id":"2507.09620","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.09620","created_at":"2026-07-05T11:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"2507.09620v1","created_at":"2026-07-05T11:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09620","created_at":"2026-07-05T11:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"PHUN6HXI3TBX","created_at":"2026-07-05T11:36:36Z"},{"alias_kind":"pith_short_16","alias_value":"PHUN6HXI3TBX3UR4","created_at":"2026-07-05T11:36:36Z"},{"alias_kind":"pith_short_8","alias_value":"PHUN6HXI","created_at":"2026-07-05T11:36:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PHUN6HXI3TBX3UR4JKHEY6AULA","target":"record","payload":{"canonical_record":{"source":{"id":"2507.09620","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-13T12:58:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"015006b58d1a43b3dbc05ca7f86572f862e187ac9dd4bff5070fb5b89926dc52","abstract_canon_sha256":"f2ebefe7e197ab446c146276f3f46b724a1c4bae77543a7b01b3f177b2db5c5e"},"schema_version":"1.0"},"canonical_sha256":"79e8df1ee8dcc37dd23c4a8e4c78145829887e9cf1b6e1585d87367f90b8061b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:36.959035Z","signature_b64":"8ke1pdCKMxBfx+K0zarrjabUEOATBwkuO0xCaO6YiTQi6ba46GOZ7fRbsDqvW/hsuw8Vj19WDhOkNydKtH9UBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79e8df1ee8dcc37dd23c4a8e4c78145829887e9cf1b6e1585d87367f90b8061b","last_reissued_at":"2026-07-05T11:36:36.958575Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:36.958575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.09620","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-07-05T11:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wOeVTzahmPN/IhKMPiisFOK1nV290Bp9kB6IlC/wst6Cy9vJBvhFSha3btCrCVqqt2KLhSqKLPAYuIt7gZ/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T19:31:02.073412Z"},"content_sha256":"5174285320955e1b15fa05fcc65a3e403ea19930d015a81c21d41b19cffe3aa4","schema_version":"1.0","event_id":"sha256:5174285320955e1b15fa05fcc65a3e403ea19930d015a81c21d41b19cffe3aa4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PHUN6HXI3TBX3UR4JKHEY6AULA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Paths and Intersections: Exact Emulators for Planar Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"George Z. Li, Tianyi Zhang, Zihan Tan","submitted_at":"2025-07-13T12:58:55Z","abstract_excerpt":"We study vertex sparsification for preserving distances in planar graphs. Given an edge-weighted planar graph with $k$ terminals, the goal is to construct an emulator, which is a smaller edge-weighted planar graph that contains the terminals and exactly preserves the pairwise distances between them. We construct exact planar emulators of size $O(f^2k^2)$ in the setting where terminals lie on $f$ faces in the planar embedding of the input graph. Our result generalizes and interpolates between the previous results of Chang and Ophelders and Goranci, Henzinger, and Peng which is an $O(k^2)$ bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09620","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.09620/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-05T11:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B4VEQZ/CmB8hL3k6jafhe7nfz2ANe/4wptcbPNMTjh2iehpEu066dj76zDclzWVOnxn7zH6z1Lfgw7nOunenAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T19:31:02.073900Z"},"content_sha256":"f063773641f4d6ca3a9c02bf7fe554b9007c4b13ddca8367520e4e691b69a63d","schema_version":"1.0","event_id":"sha256:f063773641f4d6ca3a9c02bf7fe554b9007c4b13ddca8367520e4e691b69a63d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHUN6HXI3TBX3UR4JKHEY6AULA/bundle.json","state_url":"https://pith.science/pith/PHUN6HXI3TBX3UR4JKHEY6AULA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHUN6HXI3TBX3UR4JKHEY6AULA/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-22T19:31:02Z","links":{"resolver":"https://pith.science/pith/PHUN6HXI3TBX3UR4JKHEY6AULA","bundle":"https://pith.science/pith/PHUN6HXI3TBX3UR4JKHEY6AULA/bundle.json","state":"https://pith.science/pith/PHUN6HXI3TBX3UR4JKHEY6AULA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHUN6HXI3TBX3UR4JKHEY6AULA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PHUN6HXI3TBX3UR4JKHEY6AULA","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":"f2ebefe7e197ab446c146276f3f46b724a1c4bae77543a7b01b3f177b2db5c5e","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-13T12:58:55Z","title_canon_sha256":"015006b58d1a43b3dbc05ca7f86572f862e187ac9dd4bff5070fb5b89926dc52"},"schema_version":"1.0","source":{"id":"2507.09620","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.09620","created_at":"2026-07-05T11:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"2507.09620v1","created_at":"2026-07-05T11:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09620","created_at":"2026-07-05T11:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"PHUN6HXI3TBX","created_at":"2026-07-05T11:36:36Z"},{"alias_kind":"pith_short_16","alias_value":"PHUN6HXI3TBX3UR4","created_at":"2026-07-05T11:36:36Z"},{"alias_kind":"pith_short_8","alias_value":"PHUN6HXI","created_at":"2026-07-05T11:36:36Z"}],"graph_snapshots":[{"event_id":"sha256:f063773641f4d6ca3a9c02bf7fe554b9007c4b13ddca8367520e4e691b69a63d","target":"graph","created_at":"2026-07-05T11:36:36Z","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/2507.09620/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study vertex sparsification for preserving distances in planar graphs. Given an edge-weighted planar graph with $k$ terminals, the goal is to construct an emulator, which is a smaller edge-weighted planar graph that contains the terminals and exactly preserves the pairwise distances between them. We construct exact planar emulators of size $O(f^2k^2)$ in the setting where terminals lie on $f$ faces in the planar embedding of the input graph. Our result generalizes and interpolates between the previous results of Chang and Ophelders and Goranci, Henzinger, and Peng which is an $O(k^2)$ bound","authors_text":"George Z. Li, Tianyi Zhang, Zihan Tan","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-13T12:58:55Z","title":"Paths and Intersections: Exact Emulators for Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09620","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:5174285320955e1b15fa05fcc65a3e403ea19930d015a81c21d41b19cffe3aa4","target":"record","created_at":"2026-07-05T11:36:36Z","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":"f2ebefe7e197ab446c146276f3f46b724a1c4bae77543a7b01b3f177b2db5c5e","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-13T12:58:55Z","title_canon_sha256":"015006b58d1a43b3dbc05ca7f86572f862e187ac9dd4bff5070fb5b89926dc52"},"schema_version":"1.0","source":{"id":"2507.09620","kind":"arxiv","version":1}},"canonical_sha256":"79e8df1ee8dcc37dd23c4a8e4c78145829887e9cf1b6e1585d87367f90b8061b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79e8df1ee8dcc37dd23c4a8e4c78145829887e9cf1b6e1585d87367f90b8061b","first_computed_at":"2026-07-05T11:36:36.958575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:36:36.958575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8ke1pdCKMxBfx+K0zarrjabUEOATBwkuO0xCaO6YiTQi6ba46GOZ7fRbsDqvW/hsuw8Vj19WDhOkNydKtH9UBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:36:36.959035Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.09620","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5174285320955e1b15fa05fcc65a3e403ea19930d015a81c21d41b19cffe3aa4","sha256:f063773641f4d6ca3a9c02bf7fe554b9007c4b13ddca8367520e4e691b69a63d"],"state_sha256":"ed30bde1c3692569ca6af66337615ed103745d2fb410536ea4db5d1b04de9d54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"siDHyk5v4bze0mrV50tQ8rS5CSwETdXBwtfma1gkumJmKMmUVskKdnxQIXMddPEPz7lsOIrvidLJYW06FRLBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T19:31:02.077459Z","bundle_sha256":"ef3a120b5bd1ae41a43c89948fb84e419536df14fe732afde3a02b8c6fc5710f"}}