{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FRQDQI5QGVHOLGSWI5CWP4D54T","short_pith_number":"pith:FRQDQI5Q","schema_version":"1.0","canonical_sha256":"2c603823b0354ee59a56474567f07de4fe2b47cb1e971b26494125d4655c4baa","source":{"kind":"arxiv","id":"1712.06747","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.06747","created_at":"2026-05-18T00:27:40.529232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06747v1","created_at":"2026-05-18T00:27:40.529232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06747","created_at":"2026-05-18T00:27:40.529232+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRQDQI5QGVHO","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRQDQI5QGVHOLGSW","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRQDQI5Q","created_at":"2026-05-18T12:31:15.632608+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/FRQDQI5QGVHOLGSWI5CWP4D54T","json":"https://pith.science/pith/FRQDQI5QGVHOLGSWI5CWP4D54T.json","graph_json":"https://pith.science/api/pith-number/FRQDQI5QGVHOLGSWI5CWP4D54T/graph.json","events_json":"https://pith.science/api/pith-number/FRQDQI5QGVHOLGSWI5CWP4D54T/events.json","paper":"https://pith.science/paper/FRQDQI5Q"},"agent_actions":{"view_html":"https://pith.science/pith/FRQDQI5QGVHOLGSWI5CWP4D54T","download_json":"https://pith.science/pith/FRQDQI5QGVHOLGSWI5CWP4D54T.json","view_paper":"https://pith.science/paper/FRQDQI5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06747&json=true","fetch_graph":"https://pith.science/api/pith-number/FRQDQI5QGVHOLGSWI5CWP4D54T/graph.json","fetch_events":"https://pith.science/api/pith-number/FRQDQI5QGVHOLGSWI5CWP4D54T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRQDQI5QGVHOLGSWI5CWP4D54T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRQDQI5QGVHOLGSWI5CWP4D54T/action/storage_attestation","attest_author":"https://pith.science/pith/FRQDQI5QGVHOLGSWI5CWP4D54T/action/author_attestation","sign_citation":"https://pith.science/pith/FRQDQI5QGVHOLGSWI5CWP4D54T/action/citation_signature","submit_replication":"https://pith.science/pith/FRQDQI5QGVHOLGSWI5CWP4D54T/action/replication_record"}},"created_at":"2026-05-18T00:27:40.529232+00:00","updated_at":"2026-05-18T00:27:40.529232+00:00"}