{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2EKB6XSBSNG4RSXLKZPNSHCX3F","short_pith_number":"pith:2EKB6XSB","canonical_record":{"source":{"id":"2408.11341","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-08-21T04:55:10Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0252b2987bc3f12e525ef28a110c9f8cad530bbf8ddffeac71923f99bfba3691","abstract_canon_sha256":"9371741958dc4daf2ec7b8fa780d0bee51953c0fa76d9943eb33c5bfa3cc43a2"},"schema_version":"1.0"},"canonical_sha256":"d1141f5e41934dc8caeb565ed91c57d9404c313bce79c3d361c02402f68d2320","source":{"kind":"arxiv","id":"2408.11341","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.11341","created_at":"2026-07-05T08:57:42Z"},{"alias_kind":"arxiv_version","alias_value":"2408.11341v1","created_at":"2026-07-05T08:57:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.11341","created_at":"2026-07-05T08:57:42Z"},{"alias_kind":"pith_short_12","alias_value":"2EKB6XSBSNG4","created_at":"2026-07-05T08:57:42Z"},{"alias_kind":"pith_short_16","alias_value":"2EKB6XSBSNG4RSXL","created_at":"2026-07-05T08:57:42Z"},{"alias_kind":"pith_short_8","alias_value":"2EKB6XSB","created_at":"2026-07-05T08:57:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2EKB6XSBSNG4RSXLKZPNSHCX3F","target":"record","payload":{"canonical_record":{"source":{"id":"2408.11341","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-08-21T04:55:10Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"0252b2987bc3f12e525ef28a110c9f8cad530bbf8ddffeac71923f99bfba3691","abstract_canon_sha256":"9371741958dc4daf2ec7b8fa780d0bee51953c0fa76d9943eb33c5bfa3cc43a2"},"schema_version":"1.0"},"canonical_sha256":"d1141f5e41934dc8caeb565ed91c57d9404c313bce79c3d361c02402f68d2320","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:57:42.204187Z","signature_b64":"jVltkZg9PlW9jMjz2PP4/VkbukI4K5KazSuvdZdwqe56aOA+nepdP81A1u096gdOaX5MwAOHB7DcKBftG69NAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1141f5e41934dc8caeb565ed91c57d9404c313bce79c3d361c02402f68d2320","last_reissued_at":"2026-07-05T08:57:42.203772Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:57:42.203772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.11341","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-05T08:57:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vDJD6LjnetmFjWg/PutF4hpDTiJ6TOblJUgLVAenlAHoyxlrox2EfCg0w3O+bR1666hF68UDkB6P7/IQ3/hkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T13:28:36.175944Z"},"content_sha256":"66c8be9d24580696c3ff8d6adc28b64c4cee54ff169b0bb4a997bbd6e29dd022","schema_version":"1.0","event_id":"sha256:66c8be9d24580696c3ff8d6adc28b64c4cee54ff169b0bb4a997bbd6e29dd022"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2EKB6XSBSNG4RSXLKZPNSHCX3F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"EHL*: Memory-Budgeted Indexing for Ultrafast Optimal Euclidean Pathfinding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Bojie Shen, Jinchun Du, Muhammad Aamir Cheema","submitted_at":"2024-08-21T04:55:10Z","abstract_excerpt":"The Euclidean Shortest Path Problem (ESPP), which involves finding the shortest path in a Euclidean plane with polygonal obstacles, is a classic problem with numerous real-world applications. The current state-of-the-art solution, Euclidean Hub Labeling (EHL), offers ultra-fast query performance, outperforming existing techniques by 1-2 orders of magnitude in runtime efficiency. However, this performance comes at the cost of significant memory overhead, requiring up to tens of gigabytes of storage on large maps, which can limit its applicability in memory-constrained environments like mobile p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.11341","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/2408.11341/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-05T08:57:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4JGpL68uRg3cNoa31/Ib8CNZbJi29RN9TiwRM83wSysOqZmp5I7uiLc1dsFIpJFjWSUX5L57Q17qMTYp+p0tAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T13:28:36.176337Z"},"content_sha256":"52cefde70d7ec0caf212be5ccaa09fee2d7c555749d3b044e4e555cb9d9f3d7d","schema_version":"1.0","event_id":"sha256:52cefde70d7ec0caf212be5ccaa09fee2d7c555749d3b044e4e555cb9d9f3d7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2EKB6XSBSNG4RSXLKZPNSHCX3F/bundle.json","state_url":"https://pith.science/pith/2EKB6XSBSNG4RSXLKZPNSHCX3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2EKB6XSBSNG4RSXLKZPNSHCX3F/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-07-11T13:28:36Z","links":{"resolver":"https://pith.science/pith/2EKB6XSBSNG4RSXLKZPNSHCX3F","bundle":"https://pith.science/pith/2EKB6XSBSNG4RSXLKZPNSHCX3F/bundle.json","state":"https://pith.science/pith/2EKB6XSBSNG4RSXLKZPNSHCX3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2EKB6XSBSNG4RSXLKZPNSHCX3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2EKB6XSBSNG4RSXLKZPNSHCX3F","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":"9371741958dc4daf2ec7b8fa780d0bee51953c0fa76d9943eb33c5bfa3cc43a2","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-08-21T04:55:10Z","title_canon_sha256":"0252b2987bc3f12e525ef28a110c9f8cad530bbf8ddffeac71923f99bfba3691"},"schema_version":"1.0","source":{"id":"2408.11341","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.11341","created_at":"2026-07-05T08:57:42Z"},{"alias_kind":"arxiv_version","alias_value":"2408.11341v1","created_at":"2026-07-05T08:57:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.11341","created_at":"2026-07-05T08:57:42Z"},{"alias_kind":"pith_short_12","alias_value":"2EKB6XSBSNG4","created_at":"2026-07-05T08:57:42Z"},{"alias_kind":"pith_short_16","alias_value":"2EKB6XSBSNG4RSXL","created_at":"2026-07-05T08:57:42Z"},{"alias_kind":"pith_short_8","alias_value":"2EKB6XSB","created_at":"2026-07-05T08:57:42Z"}],"graph_snapshots":[{"event_id":"sha256:52cefde70d7ec0caf212be5ccaa09fee2d7c555749d3b044e4e555cb9d9f3d7d","target":"graph","created_at":"2026-07-05T08:57:42Z","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/2408.11341/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Euclidean Shortest Path Problem (ESPP), which involves finding the shortest path in a Euclidean plane with polygonal obstacles, is a classic problem with numerous real-world applications. The current state-of-the-art solution, Euclidean Hub Labeling (EHL), offers ultra-fast query performance, outperforming existing techniques by 1-2 orders of magnitude in runtime efficiency. However, this performance comes at the cost of significant memory overhead, requiring up to tens of gigabytes of storage on large maps, which can limit its applicability in memory-constrained environments like mobile p","authors_text":"Bojie Shen, Jinchun Du, Muhammad Aamir Cheema","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-08-21T04:55:10Z","title":"EHL*: Memory-Budgeted Indexing for Ultrafast Optimal Euclidean Pathfinding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.11341","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:66c8be9d24580696c3ff8d6adc28b64c4cee54ff169b0bb4a997bbd6e29dd022","target":"record","created_at":"2026-07-05T08:57:42Z","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":"9371741958dc4daf2ec7b8fa780d0bee51953c0fa76d9943eb33c5bfa3cc43a2","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2024-08-21T04:55:10Z","title_canon_sha256":"0252b2987bc3f12e525ef28a110c9f8cad530bbf8ddffeac71923f99bfba3691"},"schema_version":"1.0","source":{"id":"2408.11341","kind":"arxiv","version":1}},"canonical_sha256":"d1141f5e41934dc8caeb565ed91c57d9404c313bce79c3d361c02402f68d2320","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1141f5e41934dc8caeb565ed91c57d9404c313bce79c3d361c02402f68d2320","first_computed_at":"2026-07-05T08:57:42.203772Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:57:42.203772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jVltkZg9PlW9jMjz2PP4/VkbukI4K5KazSuvdZdwqe56aOA+nepdP81A1u096gdOaX5MwAOHB7DcKBftG69NAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:57:42.204187Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.11341","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66c8be9d24580696c3ff8d6adc28b64c4cee54ff169b0bb4a997bbd6e29dd022","sha256:52cefde70d7ec0caf212be5ccaa09fee2d7c555749d3b044e4e555cb9d9f3d7d"],"state_sha256":"41d212339683f1a4f37090fbe2a8b0932c444a95336963fe9a8e198db88b2be6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GGLwA1IzPV+cSyDXC99/hL7UQBafB3pv1Nt4OiHOJUS+lHUAKl8FxxIbRo5Yc9OItBiBgVXAR9stPEoNm1pQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T13:28:36.181936Z","bundle_sha256":"2c3a02fd046daa3fb2ecca379ea69e60b5b46661993f6263b5b05382dfc7a491"}}