{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZZEY5R5GJDPTJM6HUX4J5D62LO","short_pith_number":"pith:ZZEY5R5G","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"},"canonical_sha256":"ce498ec7a648df34b3c7a5f89e8fda5ba352d91f2541b22a41c85dc1253f0737","source":{"kind":"arxiv","id":"1706.02792","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZZEY5R5GJDPTJM6HUX4J5D62LO","target":"record","payload":{"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"},"canonical_sha256":"ce498ec7a648df34b3c7a5f89e8fda5ba352d91f2541b22a41c85dc1253f0737","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"},"source_kind":"arxiv","source_id":"1706.02792","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:27:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r31d9i2X/yPms0aGbI5KOMlbqDbkQUkZ2Jv+d0JIzHYPEkUI+gSVHS3gijJvfsSSr+wtgeDmxTS2xuTcaIupAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:46:05.175954Z"},"content_sha256":"2685c33c54cead4474c783cb240705013ff3c1415e898f5e455102d14d44f312","schema_version":"1.0","event_id":"sha256:2685c33c54cead4474c783cb240705013ff3c1415e898f5e455102d14d44f312"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZZEY5R5GJDPTJM6HUX4J5D62LO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:27:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TObLjt8/wK4YERbSd0sdfBAi/PndTPnVA+cZUCk8ev9a4TbFSWim7EUygd30gdXCcY2InFCb88ys/7Ur7luBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:46:05.176301Z"},"content_sha256":"db018bbca54790ae8292367bf61e127054104a76cb2cb62880dc0c00869ff372","schema_version":"1.0","event_id":"sha256:db018bbca54790ae8292367bf61e127054104a76cb2cb62880dc0c00869ff372"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO/bundle.json","state_url":"https://pith.science/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T11:46:05Z","links":{"resolver":"https://pith.science/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO","bundle":"https://pith.science/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO/bundle.json","state":"https://pith.science/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZEY5R5GJDPTJM6HUX4J5D62LO/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CQcSH+mYEPCGIBvYPvytxhN19lSAJUspn3osainrSU3jULHVVWMT7/E3/HKaACvBTpyh1fWXYCqjmOIHeqbCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:46:05.178406Z","bundle_sha256":"ba1434f77f45915b447d7ac7b9c7bccd3a1a92e74f2df00a52abccc227547329"}}