{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZZEY5R5GJDPTJM6HUX4J5D62LO","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":"a18f2b1f2e5b7667039664429bb084a59dd01e6cdeadabdf33460edf3ffa499f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-08T23:29:05Z","title_canon_sha256":"f44e1aaa78f3a6fdda2b2b6bd30f297cf3691770408ae9d04c4af8b90d464146"},"schema_version":"1.0","source":{"id":"1706.02792","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02792","created_at":"2026-05-18T00:27:28Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02792v3","created_at":"2026-05-18T00:27:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02792","created_at":"2026-05-18T00:27:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZZEY5R5GJDPT","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZZEY5R5GJDPTJM6H","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZZEY5R5G","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:db018bbca54790ae8292367bf61e127054104a76cb2cb62880dc0c00869ff372","target":"graph","created_at":"2026-05-18T00:27:28Z","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 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","authors_text":"Aliyah Arunasalam, Liron Cohen, Shiva Jahangiri, Sven Koenig, Tansel Uras, T.K. Satish Kumar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-08T23:29:05Z","title":"The FastMap Algorithm for Shortest Path Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02792","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:2685c33c54cead4474c783cb240705013ff3c1415e898f5e455102d14d44f312","target":"record","created_at":"2026-05-18T00:27:28Z","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":"a18f2b1f2e5b7667039664429bb084a59dd01e6cdeadabdf33460edf3ffa499f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-06-08T23:29:05Z","title_canon_sha256":"f44e1aaa78f3a6fdda2b2b6bd30f297cf3691770408ae9d04c4af8b90d464146"},"schema_version":"1.0","source":{"id":"1706.02792","kind":"arxiv","version":3}},"canonical_sha256":"ce498ec7a648df34b3c7a5f89e8fda5ba352d91f2541b22a41c85dc1253f0737","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce498ec7a648df34b3c7a5f89e8fda5ba352d91f2541b22a41c85dc1253f0737","first_computed_at":"2026-05-18T00:27:28.087483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:28.087483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CVw+v0rV7nA3wdmjvVf7O1ogw7iTDF4vVCvLEXmJqhJqvNUCfQTxHeXhPtMpEkOYY67CQaigTXDHhHJGmxPSCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:28.088221Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02792","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2685c33c54cead4474c783cb240705013ff3c1415e898f5e455102d14d44f312","sha256:db018bbca54790ae8292367bf61e127054104a76cb2cb62880dc0c00869ff372"],"state_sha256":"fef92e2607cd30ab0159a1de0a2178b5696418d79033dd380d9408ea062b3808"}