{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MO5NIXY2OTKFFD24GGRXDNM7AS","short_pith_number":"pith:MO5NIXY2","schema_version":"1.0","canonical_sha256":"63bad45f1a74d4528f5c31a371b59f0495e76c69a15f951e02cbe704e470c0ba","source":{"kind":"arxiv","id":"2510.21700","version":2},"attestation_state":"computed","paper":{"title":"Cutting Planarians: Planar Emulators for String Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CG","cs.DM","math.CO","math.MG"],"primary_cat":"cs.DS","authors_text":"Da Wei Zheng, Hsien-Chih Chang, Jonathan Conroy, Zihan Tan","submitted_at":"2025-10-24T17:58:03Z","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"},"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":"2510.21700","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-10-24T17:58:03Z","cross_cats_sorted":["cs.CG","cs.DM","math.CO","math.MG"],"title_canon_sha256":"976b93d72e6adb3fe741fb5d67f55324140968917d5f02328cdfc897ca5ef76d","abstract_canon_sha256":"6aef6b77472d261c4f6c3271585a26b3543e560a71678f66ddb2836f4eca5f24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:18:35.877871Z","signature_b64":"30U8s2Lt07p2aaP9nmubKcgTmfE5YPqpZYUfOoxmEV+cpVFfYKxU5IBBBy3AGIVKzQ6MgkbB6fo9DpnePGOKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63bad45f1a74d4528f5c31a371b59f0495e76c69a15f951e02cbe704e470c0ba","last_reissued_at":"2026-06-25T01:18:35.877285Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:18:35.877285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cutting Planarians: Planar Emulators for String Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CG","cs.DM","math.CO","math.MG"],"primary_cat":"cs.DS","authors_text":"Da Wei Zheng, Hsien-Chih Chang, Jonathan Conroy, Zihan Tan","submitted_at":"2025-10-24T17:58:03Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.21700","kind":"arxiv","version":2},"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/2510.21700/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2510.21700","created_at":"2026-06-25T01:18:35.877361+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.21700v2","created_at":"2026-06-25T01:18:35.877361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.21700","created_at":"2026-06-25T01:18:35.877361+00:00"},{"alias_kind":"pith_short_12","alias_value":"MO5NIXY2OTKF","created_at":"2026-06-25T01:18:35.877361+00:00"},{"alias_kind":"pith_short_16","alias_value":"MO5NIXY2OTKFFD24","created_at":"2026-06-25T01:18:35.877361+00:00"},{"alias_kind":"pith_short_8","alias_value":"MO5NIXY2","created_at":"2026-06-25T01:18:35.877361+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.11112","citing_title":"A coarse Menger's Theorem for planar and bounded genus graphs","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2604.07903","citing_title":"Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MO5NIXY2OTKFFD24GGRXDNM7AS","json":"https://pith.science/pith/MO5NIXY2OTKFFD24GGRXDNM7AS.json","graph_json":"https://pith.science/api/pith-number/MO5NIXY2OTKFFD24GGRXDNM7AS/graph.json","events_json":"https://pith.science/api/pith-number/MO5NIXY2OTKFFD24GGRXDNM7AS/events.json","paper":"https://pith.science/paper/MO5NIXY2"},"agent_actions":{"view_html":"https://pith.science/pith/MO5NIXY2OTKFFD24GGRXDNM7AS","download_json":"https://pith.science/pith/MO5NIXY2OTKFFD24GGRXDNM7AS.json","view_paper":"https://pith.science/paper/MO5NIXY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.21700&json=true","fetch_graph":"https://pith.science/api/pith-number/MO5NIXY2OTKFFD24GGRXDNM7AS/graph.json","fetch_events":"https://pith.science/api/pith-number/MO5NIXY2OTKFFD24GGRXDNM7AS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MO5NIXY2OTKFFD24GGRXDNM7AS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MO5NIXY2OTKFFD24GGRXDNM7AS/action/storage_attestation","attest_author":"https://pith.science/pith/MO5NIXY2OTKFFD24GGRXDNM7AS/action/author_attestation","sign_citation":"https://pith.science/pith/MO5NIXY2OTKFFD24GGRXDNM7AS/action/citation_signature","submit_replication":"https://pith.science/pith/MO5NIXY2OTKFFD24GGRXDNM7AS/action/replication_record"}},"created_at":"2026-06-25T01:18:35.877361+00:00","updated_at":"2026-06-25T01:18:35.877361+00:00"}