{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2X4IV4IZ2S6XTEG4LDYQVD2POI","short_pith_number":"pith:2X4IV4IZ","canonical_record":{"source":{"id":"1107.0041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:38:33Z","cross_cats_sorted":[],"title_canon_sha256":"acd1e158f39c2c789a781c487ac6620fb98edaf4ce9d0851a7b242efa81b9ac0","abstract_canon_sha256":"4b88e6d3b677f7b8cc2152c660ee2e225fe07ff6069e56d82c5a9d2c5d860b81"},"schema_version":"1.0"},"canonical_sha256":"d5f88af119d4bd7990dc58f10a8f4f720e9586401484d1bf41ff0fbc1d52527c","source":{"kind":"arxiv","id":"1107.0041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0041","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0041v1","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0041","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"2X4IV4IZ2S6X","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2X4IV4IZ2S6XTEG4","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2X4IV4IZ","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2X4IV4IZ2S6XTEG4LDYQVD2POI","target":"record","payload":{"canonical_record":{"source":{"id":"1107.0041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:38:33Z","cross_cats_sorted":[],"title_canon_sha256":"acd1e158f39c2c789a781c487ac6620fb98edaf4ce9d0851a7b242efa81b9ac0","abstract_canon_sha256":"4b88e6d3b677f7b8cc2152c660ee2e225fe07ff6069e56d82c5a9d2c5d860b81"},"schema_version":"1.0"},"canonical_sha256":"d5f88af119d4bd7990dc58f10a8f4f720e9586401484d1bf41ff0fbc1d52527c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:02.851608Z","signature_b64":"qYlnnWjf/J1XtySa0mcglKaURaRN+SReIu97pumQ6PVUtDxb1lg2/xuxD4YIP/rvEx+h6Hh0AEGxsxQ0RRKeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5f88af119d4bd7990dc58f10a8f4f720e9586401484d1bf41ff0fbc1d52527c","last_reissued_at":"2026-05-18T04:19:02.850922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:02.850922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.0041","source_version":1,"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-18T04:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/VbTFHYA0nSE5+AcQJ+hAKBjuwGEGC3jGc9Xm0gsAvw3n5zEZKTGyByb/AyQfmC05rvtmrvnvWx5Y/RlZwcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T08:43:08.935249Z"},"content_sha256":"9cdd30a3a4df5bacbc0dff96ca4191a31392067f5a5822a8b6e56f8a311fc1d8","schema_version":"1.0","event_id":"sha256:9cdd30a3a4df5bacbc0dff96ca4191a31392067f5a5822a8b6e56f8a311fc1d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2X4IV4IZ2S6XTEG4LDYQVD2POI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"A. Ben-Yair, A. Felner, N. Netanyahu, R. Stern, S. Kraus","submitted_at":"2011-06-30T20:38:33Z","abstract_excerpt":"We address the problem of finding the shortest path between two points in an unknown real physical environment, where a traveling agent must move around in the environment to explore unknown territory.  We introduce the Physical-A* algorithm (PHA*) for solving this problem. PHA* expands all the mandatory nodes that A* would expand and returns the shortest path between the two points.  However, due to the physical nature of the problem, the complexity of the algorithm is measured by the traveling effort of the moving agent and not by the number of generated nodes, as in standard A*.  PHA* is pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0041","kind":"arxiv","version":1},"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-18T04:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LSi14EpLOXOvLW6gBNz/2GJ01Cb0tjM7RUyz3KenbPrSzQwcLpcjwtCeE7ThyF4jFYWh0LbA0J3s33IsyY6vBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T08:43:08.935609Z"},"content_sha256":"1428665798310b66a852e2bc188815d487402ab96a02eb583dc87d956f5272fc","schema_version":"1.0","event_id":"sha256:1428665798310b66a852e2bc188815d487402ab96a02eb583dc87d956f5272fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2X4IV4IZ2S6XTEG4LDYQVD2POI/bundle.json","state_url":"https://pith.science/pith/2X4IV4IZ2S6XTEG4LDYQVD2POI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2X4IV4IZ2S6XTEG4LDYQVD2POI/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-20T08:43:08Z","links":{"resolver":"https://pith.science/pith/2X4IV4IZ2S6XTEG4LDYQVD2POI","bundle":"https://pith.science/pith/2X4IV4IZ2S6XTEG4LDYQVD2POI/bundle.json","state":"https://pith.science/pith/2X4IV4IZ2S6XTEG4LDYQVD2POI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2X4IV4IZ2S6XTEG4LDYQVD2POI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2X4IV4IZ2S6XTEG4LDYQVD2POI","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":"4b88e6d3b677f7b8cc2152c660ee2e225fe07ff6069e56d82c5a9d2c5d860b81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:38:33Z","title_canon_sha256":"acd1e158f39c2c789a781c487ac6620fb98edaf4ce9d0851a7b242efa81b9ac0"},"schema_version":"1.0","source":{"id":"1107.0041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0041","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0041v1","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0041","created_at":"2026-05-18T04:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"2X4IV4IZ2S6X","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2X4IV4IZ2S6XTEG4","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2X4IV4IZ","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:1428665798310b66a852e2bc188815d487402ab96a02eb583dc87d956f5272fc","target":"graph","created_at":"2026-05-18T04:19:02Z","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 address the problem of finding the shortest path between two points in an unknown real physical environment, where a traveling agent must move around in the environment to explore unknown territory.  We introduce the Physical-A* algorithm (PHA*) for solving this problem. PHA* expands all the mandatory nodes that A* would expand and returns the shortest path between the two points.  However, due to the physical nature of the problem, the complexity of the algorithm is measured by the traveling effort of the moving agent and not by the number of generated nodes, as in standard A*.  PHA* is pr","authors_text":"A. Ben-Yair, A. Felner, N. Netanyahu, R. Stern, S. Kraus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:38:33Z","title":"PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0041","kind":"arxiv","version":1},"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:9cdd30a3a4df5bacbc0dff96ca4191a31392067f5a5822a8b6e56f8a311fc1d8","target":"record","created_at":"2026-05-18T04:19:02Z","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":"4b88e6d3b677f7b8cc2152c660ee2e225fe07ff6069e56d82c5a9d2c5d860b81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:38:33Z","title_canon_sha256":"acd1e158f39c2c789a781c487ac6620fb98edaf4ce9d0851a7b242efa81b9ac0"},"schema_version":"1.0","source":{"id":"1107.0041","kind":"arxiv","version":1}},"canonical_sha256":"d5f88af119d4bd7990dc58f10a8f4f720e9586401484d1bf41ff0fbc1d52527c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5f88af119d4bd7990dc58f10a8f4f720e9586401484d1bf41ff0fbc1d52527c","first_computed_at":"2026-05-18T04:19:02.850922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:02.850922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qYlnnWjf/J1XtySa0mcglKaURaRN+SReIu97pumQ6PVUtDxb1lg2/xuxD4YIP/rvEx+h6Hh0AEGxsxQ0RRKeDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:02.851608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cdd30a3a4df5bacbc0dff96ca4191a31392067f5a5822a8b6e56f8a311fc1d8","sha256:1428665798310b66a852e2bc188815d487402ab96a02eb583dc87d956f5272fc"],"state_sha256":"5b48e986ae983cd09d9d3805fe1e3a5b52a9f44cb5e2432100a520f7369cccaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pz1QsGmnw1PHKlMuAFlWxRJeCl38kR8EZVrROTeVh++T0eGiJfG+Fs1zEhm7IX/sF1H/CV5aFUU8Ab5Ww8vgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T08:43:08.937486Z","bundle_sha256":"cc935b9412f133df9cabb0074d9c6e09972b35017f5b67c5ba82cb88cfdb0407"}}