{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KII5VIUFAUPFYQHV2JLTIY5OOK","short_pith_number":"pith:KII5VIUF","canonical_record":{"source":{"id":"1706.09351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-28T16:32:46Z","cross_cats_sorted":[],"title_canon_sha256":"4b335de5d63f7c33ef56afed78966d701322aebb3b7215f85c7baaba1a5538ba","abstract_canon_sha256":"47443a326e208e822ff6333b843fea8984ff45d7a81d56ee38a75d13b94cb67d"},"schema_version":"1.0"},"canonical_sha256":"5211daa285051e5c40f5d2573463ae72bf7893b8facaeb5f9449efe19c81e699","source":{"kind":"arxiv","id":"1706.09351","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09351","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09351v1","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09351","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"KII5VIUFAUPF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KII5VIUFAUPFYQHV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KII5VIUF","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KII5VIUFAUPFYQHV2JLTIY5OOK","target":"record","payload":{"canonical_record":{"source":{"id":"1706.09351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-28T16:32:46Z","cross_cats_sorted":[],"title_canon_sha256":"4b335de5d63f7c33ef56afed78966d701322aebb3b7215f85c7baaba1a5538ba","abstract_canon_sha256":"47443a326e208e822ff6333b843fea8984ff45d7a81d56ee38a75d13b94cb67d"},"schema_version":"1.0"},"canonical_sha256":"5211daa285051e5c40f5d2573463ae72bf7893b8facaeb5f9449efe19c81e699","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:18.905579Z","signature_b64":"Nt+ki1tNIvZGee4qyCRiQYRvnsvITIoDQfRF2YeLpejT8zUCuz/yFXLum4d+E+L8EnH+ULFouG8GEYyXUJ7ECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5211daa285051e5c40f5d2573463ae72bf7893b8facaeb5f9449efe19c81e699","last_reissued_at":"2026-05-18T00:41:18.904795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:18.904795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.09351","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-18T00:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BvmKVnIcXIm6rO+pm2G8ZF/VH6D23nYtc/vpPw6VaWmOeXOeSI7pU6lI0lkk9vIbWXzrbN+0LltZLRtCmwtPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:33:52.966918Z"},"content_sha256":"f52193504fa670a633a82f344627a91f79d71223c612626599d9766f34b703b9","schema_version":"1.0","event_id":"sha256:f52193504fa670a633a82f344627a91f79d71223c612626599d9766f34b703b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KII5VIUFAUPFYQHV2JLTIY5OOK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Edge Evaluation in Explicit Generalized Binomial Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Sanjiban Choudhury, Sebastian Scherer, Shervin Javdani, Siddhartha Srinivasa","submitted_at":"2017-06-28T16:32:46Z","abstract_excerpt":"Robotic motion-planning problems, such as a UAV flying fast in a partially-known environment or a robot arm moving around cluttered objects, require finding collision-free paths quickly. Typically, this is solved by constructing a graph, where vertices represent robot configurations and edges represent potentially valid movements of the robot between these configurations. The main computational bottlenecks are expensive edge evaluations to check for collisions. State of the art planning methods do not reason about the optimal sequence of edges to evaluate in order to find a collision free path"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09351","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-18T00:41:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5yC1exRje73vg4XZNBIH/SCOwRlgdmylBQu11JEaVLymwAfXYyiNaIL9c+woDdvqYqhuaMkVZBY+kmtHkG7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:33:52.967523Z"},"content_sha256":"cb81c2440a3cfa09b2d8fee093c7616a31bf0f066149ca1730d68beb8f2e5696","schema_version":"1.0","event_id":"sha256:cb81c2440a3cfa09b2d8fee093c7616a31bf0f066149ca1730d68beb8f2e5696"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KII5VIUFAUPFYQHV2JLTIY5OOK/bundle.json","state_url":"https://pith.science/pith/KII5VIUFAUPFYQHV2JLTIY5OOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KII5VIUFAUPFYQHV2JLTIY5OOK/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-06-04T23:33:52Z","links":{"resolver":"https://pith.science/pith/KII5VIUFAUPFYQHV2JLTIY5OOK","bundle":"https://pith.science/pith/KII5VIUFAUPFYQHV2JLTIY5OOK/bundle.json","state":"https://pith.science/pith/KII5VIUFAUPFYQHV2JLTIY5OOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KII5VIUFAUPFYQHV2JLTIY5OOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KII5VIUFAUPFYQHV2JLTIY5OOK","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":"47443a326e208e822ff6333b843fea8984ff45d7a81d56ee38a75d13b94cb67d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-28T16:32:46Z","title_canon_sha256":"4b335de5d63f7c33ef56afed78966d701322aebb3b7215f85c7baaba1a5538ba"},"schema_version":"1.0","source":{"id":"1706.09351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09351","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09351v1","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09351","created_at":"2026-05-18T00:41:18Z"},{"alias_kind":"pith_short_12","alias_value":"KII5VIUFAUPF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KII5VIUFAUPFYQHV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KII5VIUF","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:cb81c2440a3cfa09b2d8fee093c7616a31bf0f066149ca1730d68beb8f2e5696","target":"graph","created_at":"2026-05-18T00:41:18Z","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":"Robotic motion-planning problems, such as a UAV flying fast in a partially-known environment or a robot arm moving around cluttered objects, require finding collision-free paths quickly. Typically, this is solved by constructing a graph, where vertices represent robot configurations and edges represent potentially valid movements of the robot between these configurations. The main computational bottlenecks are expensive edge evaluations to check for collisions. State of the art planning methods do not reason about the optimal sequence of edges to evaluate in order to find a collision free path","authors_text":"Sanjiban Choudhury, Sebastian Scherer, Shervin Javdani, Siddhartha Srinivasa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-28T16:32:46Z","title":"Near-Optimal Edge Evaluation in Explicit Generalized Binomial Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09351","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:f52193504fa670a633a82f344627a91f79d71223c612626599d9766f34b703b9","target":"record","created_at":"2026-05-18T00:41:18Z","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":"47443a326e208e822ff6333b843fea8984ff45d7a81d56ee38a75d13b94cb67d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-28T16:32:46Z","title_canon_sha256":"4b335de5d63f7c33ef56afed78966d701322aebb3b7215f85c7baaba1a5538ba"},"schema_version":"1.0","source":{"id":"1706.09351","kind":"arxiv","version":1}},"canonical_sha256":"5211daa285051e5c40f5d2573463ae72bf7893b8facaeb5f9449efe19c81e699","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5211daa285051e5c40f5d2573463ae72bf7893b8facaeb5f9449efe19c81e699","first_computed_at":"2026-05-18T00:41:18.904795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:18.904795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nt+ki1tNIvZGee4qyCRiQYRvnsvITIoDQfRF2YeLpejT8zUCuz/yFXLum4d+E+L8EnH+ULFouG8GEYyXUJ7ECw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:18.905579Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f52193504fa670a633a82f344627a91f79d71223c612626599d9766f34b703b9","sha256:cb81c2440a3cfa09b2d8fee093c7616a31bf0f066149ca1730d68beb8f2e5696"],"state_sha256":"9742903ea8baf9ace09025632e24897bbded9b5c0157601db94e5137bd856241"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bUWtXIZprVm2m6IpKGHSxFXXv848rKw+eEhAKXQmQFB65HmBZzKFRCQaz5KE/H5QHuF3HWSHczejNhMziWW3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:33:52.970459Z","bundle_sha256":"4ad912e7cbb8150365c8b4e073ca80f0da361aac489360761f66f47515d25ddd"}}