{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3YICNLAXVENHINNKVWBZL4OOMU","short_pith_number":"pith:3YICNLAX","schema_version":"1.0","canonical_sha256":"de1026ac17a91a7435aaad8395f1ce650bd17b4cfc582350c72d43c583d6d30a","source":{"kind":"arxiv","id":"2306.15928","version":1},"attestation_state":"computed","paper":{"title":"Reducing Redundant Work in Jump Point Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Daniel Harabor, Peter J. Stuckey, Shizhe Zhao","submitted_at":"2023-06-28T05:21:59Z","abstract_excerpt":"JPS (Jump Point Search) is a state-of-the-art optimal algorithm for online grid-based pathfinding. Widely used in games and other navigation scenarios, JPS nevertheless can exhibit pathological behaviours which are not well studied: (i) it may repeatedly scan the same area of the map to find successors; (ii) it may generate and expand suboptimal search nodes. In this work, we examine the source of these pathological behaviours, show how they can occur in practice, and propose a purely online approach, called Constrained JPS (CJPS), to tackle them efficiently. Experimental results show that CJP"},"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":"2306.15928","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-06-28T05:21:59Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2c75de2b29437b9f1bc924501679db1847eb85c12a3720b418718fd603ec0efa","abstract_canon_sha256":"4e1d470b1bfc7cbeb30c3cadb379c59b760d6986e4749aacd071f9768a4f9f46"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:25:46.568321Z","signature_b64":"UDg6JA1DgkmMbOzfaXy5CaYQQ/ZmQxX11YVQ1cwp0HrSfgcNkGtFtbMz3pmx0ykCF4dnCiOzm5DBVj5kWXY2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de1026ac17a91a7435aaad8395f1ce650bd17b4cfc582350c72d43c583d6d30a","last_reissued_at":"2026-07-05T06:25:46.567789Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:25:46.567789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing Redundant Work in Jump Point Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Daniel Harabor, Peter J. Stuckey, Shizhe Zhao","submitted_at":"2023-06-28T05:21:59Z","abstract_excerpt":"JPS (Jump Point Search) is a state-of-the-art optimal algorithm for online grid-based pathfinding. Widely used in games and other navigation scenarios, JPS nevertheless can exhibit pathological behaviours which are not well studied: (i) it may repeatedly scan the same area of the map to find successors; (ii) it may generate and expand suboptimal search nodes. In this work, we examine the source of these pathological behaviours, show how they can occur in practice, and propose a purely online approach, called Constrained JPS (CJPS), to tackle them efficiently. Experimental results show that CJP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.15928","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.15928/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.15928","created_at":"2026-07-05T06:25:46.567846+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.15928v1","created_at":"2026-07-05T06:25:46.567846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.15928","created_at":"2026-07-05T06:25:46.567846+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YICNLAXVENH","created_at":"2026-07-05T06:25:46.567846+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YICNLAXVENHINNK","created_at":"2026-07-05T06:25:46.567846+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YICNLAX","created_at":"2026-07-05T06:25:46.567846+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/3YICNLAXVENHINNKVWBZL4OOMU","json":"https://pith.science/pith/3YICNLAXVENHINNKVWBZL4OOMU.json","graph_json":"https://pith.science/api/pith-number/3YICNLAXVENHINNKVWBZL4OOMU/graph.json","events_json":"https://pith.science/api/pith-number/3YICNLAXVENHINNKVWBZL4OOMU/events.json","paper":"https://pith.science/paper/3YICNLAX"},"agent_actions":{"view_html":"https://pith.science/pith/3YICNLAXVENHINNKVWBZL4OOMU","download_json":"https://pith.science/pith/3YICNLAXVENHINNKVWBZL4OOMU.json","view_paper":"https://pith.science/paper/3YICNLAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.15928&json=true","fetch_graph":"https://pith.science/api/pith-number/3YICNLAXVENHINNKVWBZL4OOMU/graph.json","fetch_events":"https://pith.science/api/pith-number/3YICNLAXVENHINNKVWBZL4OOMU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YICNLAXVENHINNKVWBZL4OOMU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YICNLAXVENHINNKVWBZL4OOMU/action/storage_attestation","attest_author":"https://pith.science/pith/3YICNLAXVENHINNKVWBZL4OOMU/action/author_attestation","sign_citation":"https://pith.science/pith/3YICNLAXVENHINNKVWBZL4OOMU/action/citation_signature","submit_replication":"https://pith.science/pith/3YICNLAXVENHINNKVWBZL4OOMU/action/replication_record"}},"created_at":"2026-07-05T06:25:46.567846+00:00","updated_at":"2026-07-05T06:25:46.567846+00:00"}