{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KJY3JKFWF55EUTKV2PPDX5IR5D","short_pith_number":"pith:KJY3JKFW","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"},"canonical_sha256":"5271b4a8b62f7a4a4d55d3de3bf511e8cc9fddc2d1c2dd9926db7e4a1c2d00d5","source":{"kind":"arxiv","id":"1807.01478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01478","created_at":"2026-05-18T00:11:29Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01478v1","created_at":"2026-05-18T00:11:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01478","created_at":"2026-05-18T00:11:29Z"},{"alias_kind":"pith_short_12","alias_value":"KJY3JKFWF55E","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KJY3JKFWF55EUTKV","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KJY3JKFW","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KJY3JKFWF55EUTKV2PPDX5IR5D","target":"record","payload":{"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"},"canonical_sha256":"5271b4a8b62f7a4a4d55d3de3bf511e8cc9fddc2d1c2dd9926db7e4a1c2d00d5","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"},"source_kind":"arxiv","source_id":"1807.01478","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-05-18T00:11:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3GEB5bXpsxZZz6Cnu/HnS18RvLk4/Eu+IY1vfr1j72CUd6alRqWN+Lu4yKKWX9om0tGH9ikvcFe6YtmnDB6hDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:17:54.373395Z"},"content_sha256":"9a8c1cd650ed3e9745c936a52191906136d158790ca40b32ca015dc287878689","schema_version":"1.0","event_id":"sha256:9a8c1cd650ed3e9745c936a52191906136d158790ca40b32ca015dc287878689"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KJY3JKFWF55EUTKV2PPDX5IR5D","target":"graph","payload":{"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"},"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-05-18T00:11:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYRtw5nmZtp7glCTi7Cqi6ZNlydUGRwQY3SPYFV1cDmrWnyfxnZiJkRGC2NMjG1E0FRLf24rQ/csGXgqPhugAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:17:54.373833Z"},"content_sha256":"e9b9d93ac08f7175efae7551a523e4140d9502b95aec2e6f81e95b48ea3a2287","schema_version":"1.0","event_id":"sha256:e9b9d93ac08f7175efae7551a523e4140d9502b95aec2e6f81e95b48ea3a2287"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJY3JKFWF55EUTKV2PPDX5IR5D/bundle.json","state_url":"https://pith.science/pith/KJY3JKFWF55EUTKV2PPDX5IR5D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJY3JKFWF55EUTKV2PPDX5IR5D/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-05-25T21:17:54Z","links":{"resolver":"https://pith.science/pith/KJY3JKFWF55EUTKV2PPDX5IR5D","bundle":"https://pith.science/pith/KJY3JKFWF55EUTKV2PPDX5IR5D/bundle.json","state":"https://pith.science/pith/KJY3JKFWF55EUTKV2PPDX5IR5D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJY3JKFWF55EUTKV2PPDX5IR5D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KJY3JKFWF55EUTKV2PPDX5IR5D","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":"875d885e91dc878b54f36010bd01a06303e685d6b373d0238597761013e1054b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-04T08:26:37Z","title_canon_sha256":"b03912b26828e993a28c94676c391f72ef04e096c027ce3de56fe7e41a62b6ab"},"schema_version":"1.0","source":{"id":"1807.01478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01478","created_at":"2026-05-18T00:11:29Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01478v1","created_at":"2026-05-18T00:11:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01478","created_at":"2026-05-18T00:11:29Z"},{"alias_kind":"pith_short_12","alias_value":"KJY3JKFWF55E","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KJY3JKFWF55EUTKV","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KJY3JKFW","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:e9b9d93ac08f7175efae7551a523e4140d9502b95aec2e6f81e95b48ea3a2287","target":"graph","created_at":"2026-05-18T00:11:29Z","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"},"paper":{"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","authors_text":"Hsien-Chih Chang, Oren Weimann, Pawe{\\l} Gawrychowski, Shay Mozes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-04T08:26:37Z","title":"Near-Optimal Distance Emulator for Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01478","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:9a8c1cd650ed3e9745c936a52191906136d158790ca40b32ca015dc287878689","target":"record","created_at":"2026-05-18T00:11:29Z","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":"875d885e91dc878b54f36010bd01a06303e685d6b373d0238597761013e1054b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-04T08:26:37Z","title_canon_sha256":"b03912b26828e993a28c94676c391f72ef04e096c027ce3de56fe7e41a62b6ab"},"schema_version":"1.0","source":{"id":"1807.01478","kind":"arxiv","version":1}},"canonical_sha256":"5271b4a8b62f7a4a4d55d3de3bf511e8cc9fddc2d1c2dd9926db7e4a1c2d00d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5271b4a8b62f7a4a4d55d3de3bf511e8cc9fddc2d1c2dd9926db7e4a1c2d00d5","first_computed_at":"2026-05-18T00:11:29.616872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:29.616872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"anV5pgF+Ta4xsP8y2Mq0921TH94DfdmCDo+OMSisOWlznNDdGAYIcee+7ti0tembRJ2ZpMQ2cFhRQzxp+AUNCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:29.617293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.01478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a8c1cd650ed3e9745c936a52191906136d158790ca40b32ca015dc287878689","sha256:e9b9d93ac08f7175efae7551a523e4140d9502b95aec2e6f81e95b48ea3a2287"],"state_sha256":"ad581b60d0decc65dfa935b9f68f10229ce4e66db37a2560c3f4ddc0c44f29fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6gkTLZ1wGz1FHMsqxoxbmUVc4jOlxOBj5Y1Wj/cn52odR9SpQAqcqzBBIwhaXnTuRI0bdWS10mhAJwXr+TirBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:17:54.376373Z","bundle_sha256":"f809ec29c517283a5a3c42fe5082fb5f6e8e27bedeaad3319d03852a360398b3"}}