{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UM6YOTXS6727ICRJMWQ3EIHQ4B","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":"9dda02bc47bb49fb56ed0bbcffb4768b5ae69d4734abfa554eb927f4bd6df564","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-01-10T07:19:58Z","title_canon_sha256":"6ea47c20754f92ad0145995e636155f53e772ca93abd4137de90b17e1770b250"},"schema_version":"1.0","source":{"id":"1801.03253","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03253","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03253v3","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03253","created_at":"2026-05-18T00:12:24Z"},{"alias_kind":"pith_short_12","alias_value":"UM6YOTXS6727","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UM6YOTXS6727ICRJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UM6YOTXS","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:cfcad0f8fc6f9052a76273b96635da0b702dd34b6098ccdb1edeb4b282cc2ddf","target":"graph","created_at":"2026-05-18T00:12:24Z","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":"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","authors_text":"Arijit Ghosh, Gopinath Mishra, Sudeshna Kolay","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-01-10T07:19:58Z","title":"FPT algorithms for embedding into low complexity graphic metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03253","kind":"arxiv","version":3},"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:4ea5ab67f142673a066ab609d6bb7740e2983f338e63542578a3d1eb09d39cce","target":"record","created_at":"2026-05-18T00:12:24Z","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":"9dda02bc47bb49fb56ed0bbcffb4768b5ae69d4734abfa554eb927f4bd6df564","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-01-10T07:19:58Z","title_canon_sha256":"6ea47c20754f92ad0145995e636155f53e772ca93abd4137de90b17e1770b250"},"schema_version":"1.0","source":{"id":"1801.03253","kind":"arxiv","version":3}},"canonical_sha256":"a33d874ef2f7f5f40a2965a1b220f0e04a41d07c4979f7c615994e697dc64adb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a33d874ef2f7f5f40a2965a1b220f0e04a41d07c4979f7c615994e697dc64adb","first_computed_at":"2026-05-18T00:12:24.613036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:24.613036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z9nLy3KZh9QTaaEoEdRDUlMDUtHzVz9fOOP+eal+e2Uipm94D1u/GgcDsIXgH47ufF8Y8w31J++QwqYIc2BLDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:24.613795Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03253","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ea5ab67f142673a066ab609d6bb7740e2983f338e63542578a3d1eb09d39cce","sha256:cfcad0f8fc6f9052a76273b96635da0b702dd34b6098ccdb1edeb4b282cc2ddf"],"state_sha256":"cf42673a8c77b30dcd0ed7b6aa5fa2599c53400502eab0ef7e87e4ed4f64e209"}