{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZZEY5R5GJDPTJM6HUX4J5D62LO","short_pith_number":"pith:ZZEY5R5G","schema_version":"1.0","canonical_sha256":"ce498ec7a648df34b3c7a5f89e8fda5ba352d91f2541b22a41c85dc1253f0737","source":{"kind":"arxiv","id":"1706.02792","version":3},"attestation_state":"computed","paper":{"title":"The FastMap Algorithm for Shortest Path Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aliyah Arunasalam, Liron Cohen, Shiva Jahangiri, Sven Koenig, Tansel Uras, T.K. Satish Kumar","submitted_at":"2017-06-08T23:29:05Z","abstract_excerpt":"We present a new preprocessing algorithm for embedding the nodes of a given edge-weighted undirected graph into a Euclidean space. The Euclidean distance between any two nodes in this space approximates the length of the shortest path between them in the given graph. Later, at runtime, a shortest path between any two nodes can be computed with A* search using the Euclidean distances as heuristic. Our preprocessing algorithm, called FastMap, is inspired by the data mining algorithm of the same name and runs in near-linear time. Hence, FastMap is orders of magnitude faster than competing approac"},"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":"1706.02792","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-08T23:29:05Z","cross_cats_sorted":[],"title_canon_sha256":"f44e1aaa78f3a6fdda2b2b6bd30f297cf3691770408ae9d04c4af8b90d464146","abstract_canon_sha256":"a18f2b1f2e5b7667039664429bb084a59dd01e6cdeadabdf33460edf3ffa499f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:28.088221Z","signature_b64":"CVw+v0rV7nA3wdmjvVf7O1ogw7iTDF4vVCvLEXmJqhJqvNUCfQTxHeXhPtMpEkOYY67CQaigTXDHhHJGmxPSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce498ec7a648df34b3c7a5f89e8fda5ba352d91f2541b22a41c85dc1253f0737","last_reissued_at":"2026-05-18T00:27:28.087483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:28.087483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The FastMap Algorithm for Shortest Path Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aliyah Arunasalam, Liron Cohen, Shiva Jahangiri, Sven Koenig, Tansel Uras, T.K. Satish Kumar","submitted_at":"2017-06-08T23:29:05Z","abstract_excerpt":"We present a new preprocessing algorithm for embedding the nodes of a given edge-weighted undirected graph into a Euclidean space. The Euclidean distance between any two nodes in this space approximates the length of the shortest path between them in the given graph. Later, at runtime, a shortest path between any two nodes can be computed with A* search using the Euclidean distances as heuristic. Our preprocessing algorithm, called FastMap, is inspired by the data mining algorithm of the same name and runs in near-linear time. Hence, FastMap is orders of magnitude faster than competing approac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02792","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":"1706.02792","created_at":"2026-05-18T00:27:28.087596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02792v3","created_at":"2026-05-18T00:27:28.087596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02792","created_at":"2026-05-18T00:27:28.087596+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZEY5R5GJDPT","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZEY5R5GJDPTJM6H","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZEY5R5G","created_at":"2026-05-18T12:31:59.375834+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/ZZEY5R5GJDPTJM6HUX4J5D62LO","json":"https://pith.science/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO.json","graph_json":"https://pith.science/api/pith-number/ZZEY5R5GJDPTJM6HUX4J5D62LO/graph.json","events_json":"https://pith.science/api/pith-number/ZZEY5R5GJDPTJM6HUX4J5D62LO/events.json","paper":"https://pith.science/paper/ZZEY5R5G"},"agent_actions":{"view_html":"https://pith.science/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO","download_json":"https://pith.science/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO.json","view_paper":"https://pith.science/paper/ZZEY5R5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02792&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZEY5R5GJDPTJM6HUX4J5D62LO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZEY5R5GJDPTJM6HUX4J5D62LO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO/action/storage_attestation","attest_author":"https://pith.science/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO/action/author_attestation","sign_citation":"https://pith.science/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO/action/citation_signature","submit_replication":"https://pith.science/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO/action/replication_record"}},"created_at":"2026-05-18T00:27:28.087596+00:00","updated_at":"2026-05-18T00:27:28.087596+00:00"}