{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KJY3JKFWF55EUTKV2PPDX5IR5D","short_pith_number":"pith:KJY3JKFW","schema_version":"1.0","canonical_sha256":"5271b4a8b62f7a4a4d55d3de3bf511e8cc9fddc2d1c2dd9926db7e4a1c2d00d5","source":{"kind":"arxiv","id":"1807.01478","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Distance Emulator for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hsien-Chih Chang, Oren Weimann, Pawe{\\l} Gawrychowski, Shay Mozes","submitted_at":"2018-07-04T08:26:37Z","abstract_excerpt":"Given a graph $G$ and a set of terminals $T$, a \\emph{distance emulator} of $G$ is another graph $H$ (not necessarily a subgraph of $G$) containing $T$, such that all the pairwise distances in $G$ between vertices of $T$ are preserved in $H$. An important open question is to find the smallest possible distance emulator.\n  We prove that, given any subset of $k$ terminals in an $n$-vertex undirected unweighted planar graph, we can construct in $\\tilde O(n)$ time a distance emulator of size $\\tilde O(\\min(k^2,\\sqrt{k\\cdot n}))$. This is optimal up to logarithmic factors. The existence of such dis"},"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":"1807.01478","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-04T08:26:37Z","cross_cats_sorted":[],"title_canon_sha256":"b03912b26828e993a28c94676c391f72ef04e096c027ce3de56fe7e41a62b6ab","abstract_canon_sha256":"875d885e91dc878b54f36010bd01a06303e685d6b373d0238597761013e1054b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:29.617293Z","signature_b64":"anV5pgF+Ta4xsP8y2Mq0921TH94DfdmCDo+OMSisOWlznNDdGAYIcee+7ti0tembRJ2ZpMQ2cFhRQzxp+AUNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5271b4a8b62f7a4a4d55d3de3bf511e8cc9fddc2d1c2dd9926db7e4a1c2d00d5","last_reissued_at":"2026-05-18T00:11:29.616872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:29.616872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Distance Emulator for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hsien-Chih Chang, Oren Weimann, Pawe{\\l} Gawrychowski, Shay Mozes","submitted_at":"2018-07-04T08:26:37Z","abstract_excerpt":"Given a graph $G$ and a set of terminals $T$, a \\emph{distance emulator} of $G$ is another graph $H$ (not necessarily a subgraph of $G$) containing $T$, such that all the pairwise distances in $G$ between vertices of $T$ are preserved in $H$. An important open question is to find the smallest possible distance emulator.\n  We prove that, given any subset of $k$ terminals in an $n$-vertex undirected unweighted planar graph, we can construct in $\\tilde O(n)$ time a distance emulator of size $\\tilde O(\\min(k^2,\\sqrt{k\\cdot n}))$. This is optimal up to logarithmic factors. The existence of such dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01478","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":""},"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":"1807.01478","created_at":"2026-05-18T00:11:29.616929+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01478v1","created_at":"2026-05-18T00:11:29.616929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01478","created_at":"2026-05-18T00:11:29.616929+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJY3JKFWF55E","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJY3JKFWF55EUTKV","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJY3JKFW","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KJY3JKFWF55EUTKV2PPDX5IR5D","json":"https://pith.science/pith/KJY3JKFWF55EUTKV2PPDX5IR5D.json","graph_json":"https://pith.science/api/pith-number/KJY3JKFWF55EUTKV2PPDX5IR5D/graph.json","events_json":"https://pith.science/api/pith-number/KJY3JKFWF55EUTKV2PPDX5IR5D/events.json","paper":"https://pith.science/paper/KJY3JKFW"},"agent_actions":{"view_html":"https://pith.science/pith/KJY3JKFWF55EUTKV2PPDX5IR5D","download_json":"https://pith.science/pith/KJY3JKFWF55EUTKV2PPDX5IR5D.json","view_paper":"https://pith.science/paper/KJY3JKFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01478&json=true","fetch_graph":"https://pith.science/api/pith-number/KJY3JKFWF55EUTKV2PPDX5IR5D/graph.json","fetch_events":"https://pith.science/api/pith-number/KJY3JKFWF55EUTKV2PPDX5IR5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJY3JKFWF55EUTKV2PPDX5IR5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJY3JKFWF55EUTKV2PPDX5IR5D/action/storage_attestation","attest_author":"https://pith.science/pith/KJY3JKFWF55EUTKV2PPDX5IR5D/action/author_attestation","sign_citation":"https://pith.science/pith/KJY3JKFWF55EUTKV2PPDX5IR5D/action/citation_signature","submit_replication":"https://pith.science/pith/KJY3JKFWF55EUTKV2PPDX5IR5D/action/replication_record"}},"created_at":"2026-05-18T00:11:29.616929+00:00","updated_at":"2026-05-18T00:11:29.616929+00:00"}