{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FRQDQI5QGVHOLGSWI5CWP4D54T","short_pith_number":"pith:FRQDQI5Q","canonical_record":{"source":{"id":"1712.06747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-19T01:52:44Z","cross_cats_sorted":[],"title_canon_sha256":"64a9c7e15f2bef7d6dd6eec02c6e905ee2cc1706cefeece94c854c6f046c7f6d","abstract_canon_sha256":"b50ce7a07ceacb5fdf425b4eff352624cb07df918383bc3d3be2691f1e07c215"},"schema_version":"1.0"},"canonical_sha256":"2c603823b0354ee59a56474567f07de4fe2b47cb1e971b26494125d4655c4baa","source":{"kind":"arxiv","id":"1712.06747","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06747","created_at":"2026-05-18T00:27:40Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06747v1","created_at":"2026-05-18T00:27:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06747","created_at":"2026-05-18T00:27:40Z"},{"alias_kind":"pith_short_12","alias_value":"FRQDQI5QGVHO","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRQDQI5QGVHOLGSW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRQDQI5Q","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FRQDQI5QGVHOLGSWI5CWP4D54T","target":"record","payload":{"canonical_record":{"source":{"id":"1712.06747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-19T01:52:44Z","cross_cats_sorted":[],"title_canon_sha256":"64a9c7e15f2bef7d6dd6eec02c6e905ee2cc1706cefeece94c854c6f046c7f6d","abstract_canon_sha256":"b50ce7a07ceacb5fdf425b4eff352624cb07df918383bc3d3be2691f1e07c215"},"schema_version":"1.0"},"canonical_sha256":"2c603823b0354ee59a56474567f07de4fe2b47cb1e971b26494125d4655c4baa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:40.529821Z","signature_b64":"bT+9VOrnaby/IuPJ2jzYiLP3SgFVyaptXu6Do6Pcwr8odi9CQ1xvcB5a42rLiAGQm02QCu0ULGQF6QAqzzerCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c603823b0354ee59a56474567f07de4fe2b47cb1e971b26494125d4655c4baa","last_reissued_at":"2026-05-18T00:27:40.529130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:40.529130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.06747","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:27:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2evtYegHRKBOLsVyk3sABwIgcXiH9g8aBQ4vcuNRFm2OQNSdKHXIAjFq0JzmXGve6+587lNSz3Dovz5Jb6XcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T04:36:55.565571Z"},"content_sha256":"f8447d6e54c02ee341d39e4876c7967298238c56ba86a2bc4b958fb6b0d84dee","schema_version":"1.0","event_id":"sha256:f8447d6e54c02ee341d39e4876c7967298238c56ba86a2bc4b958fb6b0d84dee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FRQDQI5QGVHOLGSWI5CWP4D54T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Anastasios Sidiropoulos, Daniel Lokshtanov, Fedor V. Fomin, Saket Saurabh, Timothy Carpenter","submitted_at":"2017-12-19T01:52:44Z","abstract_excerpt":"We study the problem of finding a minimum-distortion embedding of the shortest path metric of an unweighted graph into a \"simpler\" metric $X$. Computing such an embedding (exactly or approximately) is a non-trivial task even when $X$ is the metric induced by a path, or, equivalently, into the real line. In this paper we give approximation and fixed-parameter tractable (FPT) algorithms for minimum-distortion embeddings into the metric of a subdivision of some fixed graph $H$, or, equivalently, into any fixed 1-dimensional simplicial complex. More precisely, we study the following problem: For g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06747","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:27:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VxD/fLzaW1+TnCHMrIYS9yDLUPWWZnmQJaYBgDQjwf/1Rn/NN/vICSd/PONAvCOWedCUokbGVh7A//JgZh1eDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T04:36:55.566274Z"},"content_sha256":"f2542b44c65b943e198855afcf274e2adf63f3073f6675068c55055338b5de0a","schema_version":"1.0","event_id":"sha256:f2542b44c65b943e198855afcf274e2adf63f3073f6675068c55055338b5de0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRQDQI5QGVHOLGSWI5CWP4D54T/bundle.json","state_url":"https://pith.science/pith/FRQDQI5QGVHOLGSWI5CWP4D54T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRQDQI5QGVHOLGSWI5CWP4D54T/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-20T04:36:55Z","links":{"resolver":"https://pith.science/pith/FRQDQI5QGVHOLGSWI5CWP4D54T","bundle":"https://pith.science/pith/FRQDQI5QGVHOLGSWI5CWP4D54T/bundle.json","state":"https://pith.science/pith/FRQDQI5QGVHOLGSWI5CWP4D54T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRQDQI5QGVHOLGSWI5CWP4D54T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FRQDQI5QGVHOLGSWI5CWP4D54T","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":"b50ce7a07ceacb5fdf425b4eff352624cb07df918383bc3d3be2691f1e07c215","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-19T01:52:44Z","title_canon_sha256":"64a9c7e15f2bef7d6dd6eec02c6e905ee2cc1706cefeece94c854c6f046c7f6d"},"schema_version":"1.0","source":{"id":"1712.06747","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06747","created_at":"2026-05-18T00:27:40Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06747v1","created_at":"2026-05-18T00:27:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06747","created_at":"2026-05-18T00:27:40Z"},{"alias_kind":"pith_short_12","alias_value":"FRQDQI5QGVHO","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRQDQI5QGVHOLGSW","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRQDQI5Q","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:f2542b44c65b943e198855afcf274e2adf63f3073f6675068c55055338b5de0a","target":"graph","created_at":"2026-05-18T00:27:40Z","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":"We study the problem of finding a minimum-distortion embedding of the shortest path metric of an unweighted graph into a \"simpler\" metric $X$. Computing such an embedding (exactly or approximately) is a non-trivial task even when $X$ is the metric induced by a path, or, equivalently, into the real line. In this paper we give approximation and fixed-parameter tractable (FPT) algorithms for minimum-distortion embeddings into the metric of a subdivision of some fixed graph $H$, or, equivalently, into any fixed 1-dimensional simplicial complex. More precisely, we study the following problem: For g","authors_text":"Anastasios Sidiropoulos, Daniel Lokshtanov, Fedor V. Fomin, Saket Saurabh, Timothy Carpenter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-19T01:52:44Z","title":"Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06747","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:f8447d6e54c02ee341d39e4876c7967298238c56ba86a2bc4b958fb6b0d84dee","target":"record","created_at":"2026-05-18T00:27:40Z","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":"b50ce7a07ceacb5fdf425b4eff352624cb07df918383bc3d3be2691f1e07c215","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-19T01:52:44Z","title_canon_sha256":"64a9c7e15f2bef7d6dd6eec02c6e905ee2cc1706cefeece94c854c6f046c7f6d"},"schema_version":"1.0","source":{"id":"1712.06747","kind":"arxiv","version":1}},"canonical_sha256":"2c603823b0354ee59a56474567f07de4fe2b47cb1e971b26494125d4655c4baa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c603823b0354ee59a56474567f07de4fe2b47cb1e971b26494125d4655c4baa","first_computed_at":"2026-05-18T00:27:40.529130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:40.529130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bT+9VOrnaby/IuPJ2jzYiLP3SgFVyaptXu6Do6Pcwr8odi9CQ1xvcB5a42rLiAGQm02QCu0ULGQF6QAqzzerCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:40.529821Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06747","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8447d6e54c02ee341d39e4876c7967298238c56ba86a2bc4b958fb6b0d84dee","sha256:f2542b44c65b943e198855afcf274e2adf63f3073f6675068c55055338b5de0a"],"state_sha256":"f10ced2725e47056a4bcde1bca4b02796a7bf1efe9a2a55c493fa08d6d748da9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DdyAF/12fXp+n5wCnYXdM7kKFlnw9DvC7xjrPdf+QoHZh1wcSi+sFNHyqs3MRHMYlMGpSrJLKDBgW/VOZTzYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T04:36:55.570145Z","bundle_sha256":"4d788b53b295efe2c346d2e66c22f18af0f95ba1e51865114e3bedcde243355d"}}