{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MO5NIXY2OTKFFD24GGRXDNM7AS","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":"6aef6b77472d261c4f6c3271585a26b3543e560a71678f66ddb2836f4eca5f24","cross_cats_sorted":["cs.CG","cs.DM","math.CO","math.MG"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-10-24T17:58:03Z","title_canon_sha256":"976b93d72e6adb3fe741fb5d67f55324140968917d5f02328cdfc897ca5ef76d"},"schema_version":"1.0","source":{"id":"2510.21700","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.21700","created_at":"2026-06-25T01:18:35Z"},{"alias_kind":"arxiv_version","alias_value":"2510.21700v2","created_at":"2026-06-25T01:18:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.21700","created_at":"2026-06-25T01:18:35Z"},{"alias_kind":"pith_short_12","alias_value":"MO5NIXY2OTKF","created_at":"2026-06-25T01:18:35Z"},{"alias_kind":"pith_short_16","alias_value":"MO5NIXY2OTKFFD24","created_at":"2026-06-25T01:18:35Z"},{"alias_kind":"pith_short_8","alias_value":"MO5NIXY2","created_at":"2026-06-25T01:18:35Z"}],"graph_snapshots":[{"event_id":"sha256:7f5a3a1187c26cdc275de2552c303d76250d385f705ee90e84f4b65c1eb4aef1","target":"graph","created_at":"2026-06-25T01:18:35Z","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/2510.21700/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we construct distance sketches for intersection graphs of arbitrary path-connected regions in the plane (known as the string graphs) in the constant and $1+\\varepsilon$ distortion regimes. Furthermore, the distance sketches themselves are planar graphs. First, we show that every unweighted string graph $G$ has an $O(1)$-distortion planar emulator: that is, there exists an edge-weighted planar graph $H$ containing every vertex in $G$, such that every pair of vertices $(u,v)$ satisfies $\\delta_G(u,v) \\le \\delta_H(u,v) \\le O(1) \\cdot \\delta_G(u,v)$. Furthermore, we show that for any","authors_text":"Da Wei Zheng, Hsien-Chih Chang, Jonathan Conroy, Zihan Tan","cross_cats":["cs.CG","cs.DM","math.CO","math.MG"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-10-24T17:58:03Z","title":"Cutting Planarians: Planar Emulators for String Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.21700","kind":"arxiv","version":2},"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:7d8bc6f45a6c29db6941161f9a1eff4502eff0bf906a2dcda84c9838d5eafd17","target":"record","created_at":"2026-06-25T01:18:35Z","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":"6aef6b77472d261c4f6c3271585a26b3543e560a71678f66ddb2836f4eca5f24","cross_cats_sorted":["cs.CG","cs.DM","math.CO","math.MG"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-10-24T17:58:03Z","title_canon_sha256":"976b93d72e6adb3fe741fb5d67f55324140968917d5f02328cdfc897ca5ef76d"},"schema_version":"1.0","source":{"id":"2510.21700","kind":"arxiv","version":2}},"canonical_sha256":"63bad45f1a74d4528f5c31a371b59f0495e76c69a15f951e02cbe704e470c0ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63bad45f1a74d4528f5c31a371b59f0495e76c69a15f951e02cbe704e470c0ba","first_computed_at":"2026-06-25T01:18:35.877285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:18:35.877285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"30U8s2Lt07p2aaP9nmubKcgTmfE5YPqpZYUfOoxmEV+cpVFfYKxU5IBBBy3AGIVKzQ6MgkbB6fo9DpnePGOKCg==","signature_status":"signed_v1","signed_at":"2026-06-25T01:18:35.877871Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.21700","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d8bc6f45a6c29db6941161f9a1eff4502eff0bf906a2dcda84c9838d5eafd17","sha256:7f5a3a1187c26cdc275de2552c303d76250d385f705ee90e84f4b65c1eb4aef1"],"state_sha256":"28a8802e403de9ded0adf4971c8b3ccac86d87675f4e5c4412fe6992cdecf76d"}