{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:3YICNLAXVENHINNKVWBZL4OOMU","short_pith_number":"pith:3YICNLAX","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"},"canonical_sha256":"de1026ac17a91a7435aaad8395f1ce650bd17b4cfc582350c72d43c583d6d30a","source":{"kind":"arxiv","id":"2306.15928","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.15928","created_at":"2026-07-05T06:25:46Z"},{"alias_kind":"arxiv_version","alias_value":"2306.15928v1","created_at":"2026-07-05T06:25:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.15928","created_at":"2026-07-05T06:25:46Z"},{"alias_kind":"pith_short_12","alias_value":"3YICNLAXVENH","created_at":"2026-07-05T06:25:46Z"},{"alias_kind":"pith_short_16","alias_value":"3YICNLAXVENHINNK","created_at":"2026-07-05T06:25:46Z"},{"alias_kind":"pith_short_8","alias_value":"3YICNLAX","created_at":"2026-07-05T06:25:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:3YICNLAXVENHINNKVWBZL4OOMU","target":"record","payload":{"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"},"canonical_sha256":"de1026ac17a91a7435aaad8395f1ce650bd17b4cfc582350c72d43c583d6d30a","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"},"source_kind":"arxiv","source_id":"2306.15928","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-07-05T06:25:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kzBYiHPVKGsRjX/sKVMrgkaDvo9wEXoTsUuzWAG+NvBQelghs7j9Bt5zCtowxRFOE4GKyTNQQI/MD7WKyS7nBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:32:54.074852Z"},"content_sha256":"2ef0277baae049a0e0ec3ecbf3c5bedd5599a331a8e7d3ee9a43c544d0d805b6","schema_version":"1.0","event_id":"sha256:2ef0277baae049a0e0ec3ecbf3c5bedd5599a331a8e7d3ee9a43c544d0d805b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:3YICNLAXVENHINNKVWBZL4OOMU","target":"graph","payload":{"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"},"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-07-05T06:25:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86TzeMutORc+F9zAhVh0SZGcg/diVIWtm89MU02khJse/k3/RvbzVcpaJ3IbR11ebIECEnruYDXcqriqm0XBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:32:54.075735Z"},"content_sha256":"7884cb8394da48104ad42d690824b1bb7f33aaefa59935c4f9186f544bc25b11","schema_version":"1.0","event_id":"sha256:7884cb8394da48104ad42d690824b1bb7f33aaefa59935c4f9186f544bc25b11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YICNLAXVENHINNKVWBZL4OOMU/bundle.json","state_url":"https://pith.science/pith/3YICNLAXVENHINNKVWBZL4OOMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YICNLAXVENHINNKVWBZL4OOMU/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-08-14T09:32:54Z","links":{"resolver":"https://pith.science/pith/3YICNLAXVENHINNKVWBZL4OOMU","bundle":"https://pith.science/pith/3YICNLAXVENHINNKVWBZL4OOMU/bundle.json","state":"https://pith.science/pith/3YICNLAXVENHINNKVWBZL4OOMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YICNLAXVENHINNKVWBZL4OOMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:3YICNLAXVENHINNKVWBZL4OOMU","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":"4e1d470b1bfc7cbeb30c3cadb379c59b760d6986e4749aacd071f9768a4f9f46","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-06-28T05:21:59Z","title_canon_sha256":"2c75de2b29437b9f1bc924501679db1847eb85c12a3720b418718fd603ec0efa"},"schema_version":"1.0","source":{"id":"2306.15928","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.15928","created_at":"2026-07-05T06:25:46Z"},{"alias_kind":"arxiv_version","alias_value":"2306.15928v1","created_at":"2026-07-05T06:25:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.15928","created_at":"2026-07-05T06:25:46Z"},{"alias_kind":"pith_short_12","alias_value":"3YICNLAXVENH","created_at":"2026-07-05T06:25:46Z"},{"alias_kind":"pith_short_16","alias_value":"3YICNLAXVENHINNK","created_at":"2026-07-05T06:25:46Z"},{"alias_kind":"pith_short_8","alias_value":"3YICNLAX","created_at":"2026-07-05T06:25:46Z"}],"graph_snapshots":[{"event_id":"sha256:7884cb8394da48104ad42d690824b1bb7f33aaefa59935c4f9186f544bc25b11","target":"graph","created_at":"2026-07-05T06:25:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.15928/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Daniel Harabor, Peter J. Stuckey, Shizhe Zhao","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-06-28T05:21:59Z","title":"Reducing Redundant Work in Jump Point Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.15928","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:2ef0277baae049a0e0ec3ecbf3c5bedd5599a331a8e7d3ee9a43c544d0d805b6","target":"record","created_at":"2026-07-05T06:25:46Z","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":"4e1d470b1bfc7cbeb30c3cadb379c59b760d6986e4749aacd071f9768a4f9f46","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-06-28T05:21:59Z","title_canon_sha256":"2c75de2b29437b9f1bc924501679db1847eb85c12a3720b418718fd603ec0efa"},"schema_version":"1.0","source":{"id":"2306.15928","kind":"arxiv","version":1}},"canonical_sha256":"de1026ac17a91a7435aaad8395f1ce650bd17b4cfc582350c72d43c583d6d30a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de1026ac17a91a7435aaad8395f1ce650bd17b4cfc582350c72d43c583d6d30a","first_computed_at":"2026-07-05T06:25:46.567789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:25:46.567789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UDg6JA1DgkmMbOzfaXy5CaYQQ/ZmQxX11YVQ1cwp0HrSfgcNkGtFtbMz3pmx0ykCF4dnCiOzm5DBVj5kWXY2BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:25:46.568321Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.15928","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ef0277baae049a0e0ec3ecbf3c5bedd5599a331a8e7d3ee9a43c544d0d805b6","sha256:7884cb8394da48104ad42d690824b1bb7f33aaefa59935c4f9186f544bc25b11"],"state_sha256":"a541712e1d19f591bc168a75f0bb533a4bb981ed5ba2df03cbe29635fac68c2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zHLV1yP0J61ffn+rHlthAGB9lD3B4cm9W8ptH+Av04kWfaT2U9Y1ftTAPI6LgVlczgsyuiO6LITLrPOqKFOyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T09:32:54.087437Z","bundle_sha256":"db239cb326f12d400cf66ba13240e601a0c5dd5a7431549c682d0cd68a622f79"}}