{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UVYFN4HBWKMPWQQJRAK5AWKNZO","short_pith_number":"pith:UVYFN4HB","schema_version":"1.0","canonical_sha256":"a57056f0e1b298fb42098815d0594dcba46479682eead1003773b235a388ebdb","source":{"kind":"arxiv","id":"1607.00715","version":1},"attestation_state":"computed","paper":{"title":"Path planning with Inventory-driven Jump-Point-Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Davide Aversa, Sebastian Sardina, Stavros Vassos","submitted_at":"2016-07-04T01:13:32Z","abstract_excerpt":"In many navigational domains the traversability of cells is conditioned on the path taken. This is often the case in video-games, in which a character may need to acquire a certain object (i.e., a key or a flying suit) to be able to traverse specific locations (e.g., doors or high walls). In order for non-player characters to handle such scenarios we present invJPS, an \"inventory-driven\" pathfinding approach based on the highly successful grid-based Jump-Point-Search (JPS) algorithm. We show, formally and experimentally, that the invJPS preserves JPS's optimality guarantees and its symmetry br"},"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":"1607.00715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-07-04T01:13:32Z","cross_cats_sorted":[],"title_canon_sha256":"cc818eff4caad7a02f63a7be92b1b23f8e67833525a279112ffe885fbb108b4f","abstract_canon_sha256":"8440ad5c0e66209a241bce647898206d77eb8b27671f6f4eeb3b0f259d2abd67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:34.396699Z","signature_b64":"YDFD/Q/zlNPg42RgHILPsi9be31p/07ohyBREdeR1a/a3XJg1bynwkhpGvcDOmJnY29BxoxZDXKX0GptTn6yAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a57056f0e1b298fb42098815d0594dcba46479682eead1003773b235a388ebdb","last_reissued_at":"2026-05-18T01:11:34.396280Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:34.396280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path planning with Inventory-driven Jump-Point-Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Davide Aversa, Sebastian Sardina, Stavros Vassos","submitted_at":"2016-07-04T01:13:32Z","abstract_excerpt":"In many navigational domains the traversability of cells is conditioned on the path taken. This is often the case in video-games, in which a character may need to acquire a certain object (i.e., a key or a flying suit) to be able to traverse specific locations (e.g., doors or high walls). In order for non-player characters to handle such scenarios we present invJPS, an \"inventory-driven\" pathfinding approach based on the highly successful grid-based Jump-Point-Search (JPS) algorithm. We show, formally and experimentally, that the invJPS preserves JPS's optimality guarantees and its symmetry br"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00715","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.00715","created_at":"2026-05-18T01:11:34.396341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00715v1","created_at":"2026-05-18T01:11:34.396341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00715","created_at":"2026-05-18T01:11:34.396341+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVYFN4HBWKMP","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVYFN4HBWKMPWQQJ","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVYFN4HB","created_at":"2026-05-18T12:30:46.583412+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/UVYFN4HBWKMPWQQJRAK5AWKNZO","json":"https://pith.science/pith/UVYFN4HBWKMPWQQJRAK5AWKNZO.json","graph_json":"https://pith.science/api/pith-number/UVYFN4HBWKMPWQQJRAK5AWKNZO/graph.json","events_json":"https://pith.science/api/pith-number/UVYFN4HBWKMPWQQJRAK5AWKNZO/events.json","paper":"https://pith.science/paper/UVYFN4HB"},"agent_actions":{"view_html":"https://pith.science/pith/UVYFN4HBWKMPWQQJRAK5AWKNZO","download_json":"https://pith.science/pith/UVYFN4HBWKMPWQQJRAK5AWKNZO.json","view_paper":"https://pith.science/paper/UVYFN4HB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00715&json=true","fetch_graph":"https://pith.science/api/pith-number/UVYFN4HBWKMPWQQJRAK5AWKNZO/graph.json","fetch_events":"https://pith.science/api/pith-number/UVYFN4HBWKMPWQQJRAK5AWKNZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVYFN4HBWKMPWQQJRAK5AWKNZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVYFN4HBWKMPWQQJRAK5AWKNZO/action/storage_attestation","attest_author":"https://pith.science/pith/UVYFN4HBWKMPWQQJRAK5AWKNZO/action/author_attestation","sign_citation":"https://pith.science/pith/UVYFN4HBWKMPWQQJRAK5AWKNZO/action/citation_signature","submit_replication":"https://pith.science/pith/UVYFN4HBWKMPWQQJRAK5AWKNZO/action/replication_record"}},"created_at":"2026-05-18T01:11:34.396341+00:00","updated_at":"2026-05-18T01:11:34.396341+00:00"}