{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UM6YOTXS6727ICRJMWQ3EIHQ4B","short_pith_number":"pith:UM6YOTXS","schema_version":"1.0","canonical_sha256":"a33d874ef2f7f5f40a2965a1b220f0e04a41d07c4979f7c615994e697dc64adb","source":{"kind":"arxiv","id":"1801.03253","version":3},"attestation_state":"computed","paper":{"title":"FPT algorithms for embedding into low complexity graphic metrics","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Arijit Ghosh, Gopinath Mishra, Sudeshna Kolay","submitted_at":"2018-01-10T07:19:58Z","abstract_excerpt":"The Metric Embedding problem takes as input two metric spaces $(X,D_X)$ and $(Y,D_Y)$, and a positive integer $d$. The objective is to determine whether there is an embedding $F:X \\rightarrow Y$ such that $d_{F} \\leq d$, where $d_{F}$ denotes the distortion of the map $F$. Such an embedding is called a distortion $d$ embedding. The bijective Metric Embedding problem is a special case of the Metric Embedding problem where $|X| = |Y|$. In parameterized complexity, the Metric Embedding problem, in full generality, is known to be W-hard and therefore, not expected to have an FPT algorithm. In this"},"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":"1801.03253","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-01-10T07:19:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6ea47c20754f92ad0145995e636155f53e772ca93abd4137de90b17e1770b250","abstract_canon_sha256":"9dda02bc47bb49fb56ed0bbcffb4768b5ae69d4734abfa554eb927f4bd6df564"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:24.613795Z","signature_b64":"Z9nLy3KZh9QTaaEoEdRDUlMDUtHzVz9fOOP+eal+e2Uipm94D1u/GgcDsIXgH47ufF8Y8w31J++QwqYIc2BLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a33d874ef2f7f5f40a2965a1b220f0e04a41d07c4979f7c615994e697dc64adb","last_reissued_at":"2026-05-18T00:12:24.613036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:24.613036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FPT algorithms for embedding into low complexity graphic metrics","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Arijit Ghosh, Gopinath Mishra, Sudeshna Kolay","submitted_at":"2018-01-10T07:19:58Z","abstract_excerpt":"The Metric Embedding problem takes as input two metric spaces $(X,D_X)$ and $(Y,D_Y)$, and a positive integer $d$. The objective is to determine whether there is an embedding $F:X \\rightarrow Y$ such that $d_{F} \\leq d$, where $d_{F}$ denotes the distortion of the map $F$. Such an embedding is called a distortion $d$ embedding. The bijective Metric Embedding problem is a special case of the Metric Embedding problem where $|X| = |Y|$. In parameterized complexity, the Metric Embedding problem, in full generality, is known to be W-hard and therefore, not expected to have an FPT algorithm. In this"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03253","kind":"arxiv","version":3},"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":"1801.03253","created_at":"2026-05-18T00:12:24.613125+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03253v3","created_at":"2026-05-18T00:12:24.613125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03253","created_at":"2026-05-18T00:12:24.613125+00:00"},{"alias_kind":"pith_short_12","alias_value":"UM6YOTXS6727","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UM6YOTXS6727ICRJ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UM6YOTXS","created_at":"2026-05-18T12:32:56.356000+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/UM6YOTXS6727ICRJMWQ3EIHQ4B","json":"https://pith.science/pith/UM6YOTXS6727ICRJMWQ3EIHQ4B.json","graph_json":"https://pith.science/api/pith-number/UM6YOTXS6727ICRJMWQ3EIHQ4B/graph.json","events_json":"https://pith.science/api/pith-number/UM6YOTXS6727ICRJMWQ3EIHQ4B/events.json","paper":"https://pith.science/paper/UM6YOTXS"},"agent_actions":{"view_html":"https://pith.science/pith/UM6YOTXS6727ICRJMWQ3EIHQ4B","download_json":"https://pith.science/pith/UM6YOTXS6727ICRJMWQ3EIHQ4B.json","view_paper":"https://pith.science/paper/UM6YOTXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03253&json=true","fetch_graph":"https://pith.science/api/pith-number/UM6YOTXS6727ICRJMWQ3EIHQ4B/graph.json","fetch_events":"https://pith.science/api/pith-number/UM6YOTXS6727ICRJMWQ3EIHQ4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UM6YOTXS6727ICRJMWQ3EIHQ4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UM6YOTXS6727ICRJMWQ3EIHQ4B/action/storage_attestation","attest_author":"https://pith.science/pith/UM6YOTXS6727ICRJMWQ3EIHQ4B/action/author_attestation","sign_citation":"https://pith.science/pith/UM6YOTXS6727ICRJMWQ3EIHQ4B/action/citation_signature","submit_replication":"https://pith.science/pith/UM6YOTXS6727ICRJMWQ3EIHQ4B/action/replication_record"}},"created_at":"2026-05-18T00:12:24.613125+00:00","updated_at":"2026-05-18T00:12:24.613125+00:00"}