{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7AXLLDYJ47GS47GR52OCAJJ34E","short_pith_number":"pith:7AXLLDYJ","canonical_record":{"source":{"id":"1304.1449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T17:55:24Z","cross_cats_sorted":[],"title_canon_sha256":"91ab96e851f686d9f298b494ec824c782c660a938dae56b81d9768f5fc097bf3","abstract_canon_sha256":"55ec0667320ecaed6ffce33950682030719cb591b36f28db9f34e8777f1573bb"},"schema_version":"1.0"},"canonical_sha256":"f82eb58f09e7cd2e7cd1ee9c20253be13721d067130f9bd049f1bbc84799165f","source":{"kind":"arxiv","id":"1304.1449","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1449","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1449v2","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1449","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"7AXLLDYJ47GS","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7AXLLDYJ47GS47GR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7AXLLDYJ","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7AXLLDYJ47GS47GR52OCAJJ34E","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T17:55:24Z","cross_cats_sorted":[],"title_canon_sha256":"91ab96e851f686d9f298b494ec824c782c660a938dae56b81d9768f5fc097bf3","abstract_canon_sha256":"55ec0667320ecaed6ffce33950682030719cb591b36f28db9f34e8777f1573bb"},"schema_version":"1.0"},"canonical_sha256":"f82eb58f09e7cd2e7cd1ee9c20253be13721d067130f9bd049f1bbc84799165f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:01.254435Z","signature_b64":"Rd9+wYRJ2cwMTcpKCDkslofbnLV0/eZvmEC1rworV4D3jAoFwVOJUN+1zqNgGxiho9zG8MlO//m8SNsSkOazCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f82eb58f09e7cd2e7cd1ee9c20253be13721d067130f9bd049f1bbc84799165f","last_reissued_at":"2026-05-18T01:35:01.254039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:01.254039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1449","source_version":2,"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-18T01:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L8bNXvr3HGSvkFgPCXgCzLFDXono4wNpW+u6bdWMnnrqxnhZFL0GoCHmDuVpJDzvQoe762wA6x7WNlolqX5lCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:11:17.986701Z"},"content_sha256":"192f45c1ac4304e127f3162525f1069e69e28298ab64c4cad57c0415cc0a63f5","schema_version":"1.0","event_id":"sha256:192f45c1ac4304e127f3162525f1069e69e28298ab64c4cad57c0415cc0a63f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7AXLLDYJ47GS47GR52OCAJJ34E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cutting corners cheaply, or how to remove Steiner points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Huy L. Nguyen, Lior Kamma, Robert Krauthgamer","submitted_at":"2013-04-04T17:55:24Z","abstract_excerpt":"Our main result is that the Steiner Point Removal (SPR) problem can always be solved with polylogarithmic distortion, which answers in the affirmative a question posed by Chan, Xia, Konjevod, and Richa (2006). Specifically, we prove that for every edge-weighted graph $G = (V,E,w)$ and a subset of terminals $T \\subseteq V$, there is a graph $G'=(T,E',w')$ that is isomorphic to a minor of $G$, such that for every two terminals $u,v\\in T$, the shortest-path distances between them in $G$ and in $G'$ satisfy $d_{G,w}(u,v) \\le d_{G',w'}(u,v) \\le O(\\log^5|T|) \\cdot d_{G,w}(u,v)$. Our existence proof "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1449","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":""},"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-18T01:35:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGTQLzNjJl9/5KrIkcoIQ7qy3iyVyo/BwicWMUow73EQOZaePt+cEEJ42fIYm3ZtHngYdivjqj7itQJkRgEKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:11:17.987047Z"},"content_sha256":"d48e240920bfbfd1a0193e840493e599d53c23d6ab1ef3813d081d937b16f506","schema_version":"1.0","event_id":"sha256:d48e240920bfbfd1a0193e840493e599d53c23d6ab1ef3813d081d937b16f506"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7AXLLDYJ47GS47GR52OCAJJ34E/bundle.json","state_url":"https://pith.science/pith/7AXLLDYJ47GS47GR52OCAJJ34E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7AXLLDYJ47GS47GR52OCAJJ34E/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-06-11T12:11:17Z","links":{"resolver":"https://pith.science/pith/7AXLLDYJ47GS47GR52OCAJJ34E","bundle":"https://pith.science/pith/7AXLLDYJ47GS47GR52OCAJJ34E/bundle.json","state":"https://pith.science/pith/7AXLLDYJ47GS47GR52OCAJJ34E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7AXLLDYJ47GS47GR52OCAJJ34E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7AXLLDYJ47GS47GR52OCAJJ34E","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":"55ec0667320ecaed6ffce33950682030719cb591b36f28db9f34e8777f1573bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T17:55:24Z","title_canon_sha256":"91ab96e851f686d9f298b494ec824c782c660a938dae56b81d9768f5fc097bf3"},"schema_version":"1.0","source":{"id":"1304.1449","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1449","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1449v2","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1449","created_at":"2026-05-18T01:35:01Z"},{"alias_kind":"pith_short_12","alias_value":"7AXLLDYJ47GS","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7AXLLDYJ47GS47GR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7AXLLDYJ","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:d48e240920bfbfd1a0193e840493e599d53c23d6ab1ef3813d081d937b16f506","target":"graph","created_at":"2026-05-18T01:35:01Z","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":"Our main result is that the Steiner Point Removal (SPR) problem can always be solved with polylogarithmic distortion, which answers in the affirmative a question posed by Chan, Xia, Konjevod, and Richa (2006). Specifically, we prove that for every edge-weighted graph $G = (V,E,w)$ and a subset of terminals $T \\subseteq V$, there is a graph $G'=(T,E',w')$ that is isomorphic to a minor of $G$, such that for every two terminals $u,v\\in T$, the shortest-path distances between them in $G$ and in $G'$ satisfy $d_{G,w}(u,v) \\le d_{G',w'}(u,v) \\le O(\\log^5|T|) \\cdot d_{G,w}(u,v)$. Our existence proof ","authors_text":"Huy L. Nguyen, Lior Kamma, Robert Krauthgamer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T17:55:24Z","title":"Cutting corners cheaply, or how to remove Steiner points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1449","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:192f45c1ac4304e127f3162525f1069e69e28298ab64c4cad57c0415cc0a63f5","target":"record","created_at":"2026-05-18T01:35:01Z","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":"55ec0667320ecaed6ffce33950682030719cb591b36f28db9f34e8777f1573bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T17:55:24Z","title_canon_sha256":"91ab96e851f686d9f298b494ec824c782c660a938dae56b81d9768f5fc097bf3"},"schema_version":"1.0","source":{"id":"1304.1449","kind":"arxiv","version":2}},"canonical_sha256":"f82eb58f09e7cd2e7cd1ee9c20253be13721d067130f9bd049f1bbc84799165f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f82eb58f09e7cd2e7cd1ee9c20253be13721d067130f9bd049f1bbc84799165f","first_computed_at":"2026-05-18T01:35:01.254039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:01.254039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rd9+wYRJ2cwMTcpKCDkslofbnLV0/eZvmEC1rworV4D3jAoFwVOJUN+1zqNgGxiho9zG8MlO//m8SNsSkOazCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:01.254435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1449","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:192f45c1ac4304e127f3162525f1069e69e28298ab64c4cad57c0415cc0a63f5","sha256:d48e240920bfbfd1a0193e840493e599d53c23d6ab1ef3813d081d937b16f506"],"state_sha256":"47283a12ea7fe989fb29b76cb60c77ee68c769079258783ced181d968a7354bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zeNJ6VkMv22xMznbrs9Lno8V6KQD0kORk8EZ4ja+A/hTctongqQeVZiZcNj2F093XCX+ZL0KOHm0heCkGDzpDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:11:17.989090Z","bundle_sha256":"74ff2fdc920c23dcd4875049dbd997650f671c23bd3590823ecc991608fb08a8"}}