{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5LYI6LJCZSFD25DY5VI7UDYZ4V","short_pith_number":"pith:5LYI6LJC","canonical_record":{"source":{"id":"1409.8112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-29T13:24:32Z","cross_cats_sorted":[],"title_canon_sha256":"26ec0b11716b75516db692c7c314b3e522cbff6a3312fa2d60ee2091e6d0fd9f","abstract_canon_sha256":"ed45a5c2aa6ebfe00b356448c8e6c31c862328129b7cdca577865726db141781"},"schema_version":"1.0"},"canonical_sha256":"eaf08f2d22cc8a3d7478ed51fa0f19e557d58fb3106127cc49cce0621065bf76","source":{"kind":"arxiv","id":"1409.8112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8112","created_at":"2026-05-18T02:41:33Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8112v1","created_at":"2026-05-18T02:41:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8112","created_at":"2026-05-18T02:41:33Z"},{"alias_kind":"pith_short_12","alias_value":"5LYI6LJCZSFD","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5LYI6LJCZSFD25DY","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5LYI6LJC","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5LYI6LJCZSFD25DY5VI7UDYZ4V","target":"record","payload":{"canonical_record":{"source":{"id":"1409.8112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-29T13:24:32Z","cross_cats_sorted":[],"title_canon_sha256":"26ec0b11716b75516db692c7c314b3e522cbff6a3312fa2d60ee2091e6d0fd9f","abstract_canon_sha256":"ed45a5c2aa6ebfe00b356448c8e6c31c862328129b7cdca577865726db141781"},"schema_version":"1.0"},"canonical_sha256":"eaf08f2d22cc8a3d7478ed51fa0f19e557d58fb3106127cc49cce0621065bf76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:33.692383Z","signature_b64":"QMWDFqQqti7BJKj/s6flA9FmAxbCF32W4+A5eyO1DELicKiG/IPG2vPHpJkBMYSByw5tvRBAcTA4jkys0wJzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaf08f2d22cc8a3d7478ed51fa0f19e557d58fb3106127cc49cce0621065bf76","last_reissued_at":"2026-05-18T02:41:33.692020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:33.692020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.8112","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-18T02:41:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CRW7JvAPKvRkO36/xIbhD4s8pXQw8zxWuitVKryW6Qqpjfpgzz1AgninHIy2yttzvcTKRUpY/iblQV51QVy3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:21:20.424582Z"},"content_sha256":"43e26e3c9170f9ff5f113c61cccf316eb46448099ee0cf42608ed5a06df4d22e","schema_version":"1.0","event_id":"sha256:43e26e3c9170f9ff5f113c61cccf316eb46448099ee0cf42608ed5a06df4d22e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5LYI6LJCZSFD25DY5VI7UDYZ4V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dan Halperin, Michal Kleinbort, Oren Salzman","submitted_at":"2014-09-29T13:24:32Z","abstract_excerpt":"Sampling-based motion-planning algorithms typically rely on nearest-neighbor (NN) queries when constructing a roadmap. Recent results suggest that in various settings NN queries may be the computational bottleneck of such algorithms. Moreover, in several asymptotically-optimal algorithms these NN queries are of a specific form: Given a set of points and a radius r report all pairs of points whose distance is at most r. This calls for an application-specific NN data structure tailored to efficiently answering this type of queries. Randomly transformed grids (RTG) were recently proposed by Aiger"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8112","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-18T02:41:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SdyObyrnOydaUUfGppgg6igwln6RK8mjEu1k2cMxFEyHTi4bLEej7Qjf94tOE+Uj/Wx3C+ItDgWH/9epNYgdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:21:20.425230Z"},"content_sha256":"0e3f055e7ace8c7be038f7213ef81fc49e42ef5ec9a24ebf002fad316d19f157","schema_version":"1.0","event_id":"sha256:0e3f055e7ace8c7be038f7213ef81fc49e42ef5ec9a24ebf002fad316d19f157"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LYI6LJCZSFD25DY5VI7UDYZ4V/bundle.json","state_url":"https://pith.science/pith/5LYI6LJCZSFD25DY5VI7UDYZ4V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LYI6LJCZSFD25DY5VI7UDYZ4V/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-26T12:21:20Z","links":{"resolver":"https://pith.science/pith/5LYI6LJCZSFD25DY5VI7UDYZ4V","bundle":"https://pith.science/pith/5LYI6LJCZSFD25DY5VI7UDYZ4V/bundle.json","state":"https://pith.science/pith/5LYI6LJCZSFD25DY5VI7UDYZ4V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LYI6LJCZSFD25DY5VI7UDYZ4V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5LYI6LJCZSFD25DY5VI7UDYZ4V","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":"ed45a5c2aa6ebfe00b356448c8e6c31c862328129b7cdca577865726db141781","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-29T13:24:32Z","title_canon_sha256":"26ec0b11716b75516db692c7c314b3e522cbff6a3312fa2d60ee2091e6d0fd9f"},"schema_version":"1.0","source":{"id":"1409.8112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8112","created_at":"2026-05-18T02:41:33Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8112v1","created_at":"2026-05-18T02:41:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8112","created_at":"2026-05-18T02:41:33Z"},{"alias_kind":"pith_short_12","alias_value":"5LYI6LJCZSFD","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5LYI6LJCZSFD25DY","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5LYI6LJC","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:0e3f055e7ace8c7be038f7213ef81fc49e42ef5ec9a24ebf002fad316d19f157","target":"graph","created_at":"2026-05-18T02:41:33Z","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":"Sampling-based motion-planning algorithms typically rely on nearest-neighbor (NN) queries when constructing a roadmap. Recent results suggest that in various settings NN queries may be the computational bottleneck of such algorithms. Moreover, in several asymptotically-optimal algorithms these NN queries are of a specific form: Given a set of points and a radius r report all pairs of points whose distance is at most r. This calls for an application-specific NN data structure tailored to efficiently answering this type of queries. Randomly transformed grids (RTG) were recently proposed by Aiger","authors_text":"Dan Halperin, Michal Kleinbort, Oren Salzman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-29T13:24:32Z","title":"Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8112","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:43e26e3c9170f9ff5f113c61cccf316eb46448099ee0cf42608ed5a06df4d22e","target":"record","created_at":"2026-05-18T02:41:33Z","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":"ed45a5c2aa6ebfe00b356448c8e6c31c862328129b7cdca577865726db141781","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-29T13:24:32Z","title_canon_sha256":"26ec0b11716b75516db692c7c314b3e522cbff6a3312fa2d60ee2091e6d0fd9f"},"schema_version":"1.0","source":{"id":"1409.8112","kind":"arxiv","version":1}},"canonical_sha256":"eaf08f2d22cc8a3d7478ed51fa0f19e557d58fb3106127cc49cce0621065bf76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaf08f2d22cc8a3d7478ed51fa0f19e557d58fb3106127cc49cce0621065bf76","first_computed_at":"2026-05-18T02:41:33.692020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:33.692020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QMWDFqQqti7BJKj/s6flA9FmAxbCF32W4+A5eyO1DELicKiG/IPG2vPHpJkBMYSByw5tvRBAcTA4jkys0wJzAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:33.692383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43e26e3c9170f9ff5f113c61cccf316eb46448099ee0cf42608ed5a06df4d22e","sha256:0e3f055e7ace8c7be038f7213ef81fc49e42ef5ec9a24ebf002fad316d19f157"],"state_sha256":"c5516af7d6586862ef57fdb5c8e06de7468333c8f2bb25721742fdc9f0b35b98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fK09Au54UBSlYs7qT1EcKJM+lXhZVIyLcz5y0Tb6lRZPkgcw1ieH4YnZkMm82n1JxUFSqPqDlr0QsyO/nk8wDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:21:20.428570Z","bundle_sha256":"f40df6e0ba7e36c1dcc25b109e893beacb76ac199ccd2a5330db8d18182d10d6"}}