{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IIEVSE4QFS5CUCU42FM6IEGPVC","short_pith_number":"pith:IIEVSE4Q","canonical_record":{"source":{"id":"1910.03701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-10-08T21:46:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9e66c3c6a87f5f0f033b5a7929415f4958a6ab41346be44973d2d45cf2ee3ac4","abstract_canon_sha256":"50e2383ed9493dd90c366426f2aa51665c4eede8bd70fb6b103b57e5163a8fba"},"schema_version":"1.0"},"canonical_sha256":"42095913902cba2a0a9cd159e410cfa8a4394afd89fb4f3e8f53b0f81250667b","source":{"kind":"arxiv","id":"1910.03701","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.03701","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1910.03701v1","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.03701","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"IIEVSE4QFS5C","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"pith_short_16","alias_value":"IIEVSE4QFS5CUCU4","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"pith_short_8","alias_value":"IIEVSE4Q","created_at":"2026-07-05T00:10:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IIEVSE4QFS5CUCU42FM6IEGPVC","target":"record","payload":{"canonical_record":{"source":{"id":"1910.03701","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-10-08T21:46:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9e66c3c6a87f5f0f033b5a7929415f4958a6ab41346be44973d2d45cf2ee3ac4","abstract_canon_sha256":"50e2383ed9493dd90c366426f2aa51665c4eede8bd70fb6b103b57e5163a8fba"},"schema_version":"1.0"},"canonical_sha256":"42095913902cba2a0a9cd159e410cfa8a4394afd89fb4f3e8f53b0f81250667b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:10:56.889664Z","signature_b64":"qqNuPyKAuIQv3iuxc55jNYV4Xd02ogsHuLUN8byo/MJcU3EHgNuRdGorS84tbYtzJwG3itMrIl1HC+i3uivfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42095913902cba2a0a9cd159e410cfa8a4394afd89fb4f3e8f53b0f81250667b","last_reissued_at":"2026-07-05T00:10:56.889266Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:10:56.889266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.03701","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-05T00:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l97ESrvh8o/jBagceVQeUYJ0qrSUsOuhO3Z0NEltwxeFcEsCwwGS5eGHrQKUwP0tD5pjgcVfJ7OWDAqfOGNuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T15:01:34.814229Z"},"content_sha256":"db949201004c87f0c546a5baa4379db386a066e4849efff6d118e0320a4e35eb","schema_version":"1.0","event_id":"sha256:db949201004c87f0c546a5baa4379db386a066e4849efff6d118e0320a4e35eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IIEVSE4QFS5CUCU42FM6IEGPVC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learned Critical Probabilistic Roadmaps for Robotic Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Aleksandra Faust, Brian Ichter, Edward Schmerling, Tsang-Wei Edward Lee","submitted_at":"2019-10-08T21:46:34Z","abstract_excerpt":"Sampling-based motion planning techniques have emerged as an efficient algorithmic paradigm for solving complex motion planning problems. These approaches use a set of probing samples to construct an implicit graph representation of the robot's state space, allowing arbitrarily accurate representations as the number of samples increases to infinity. In practice, however, solution trajectories only rely on a few critical states, often defined by structure in the state space (e.g., doorways). In this work we propose a general method to identify these critical states via graph-theoretic technique"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.03701","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/1910.03701/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-05T00:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1hvroP24vifrTZfJwbucXIWn2Po7UTeqTVyEyNizQpF6TUn/m7uA0yhnn/OOLUS/WVFN3LbpFUTDt4WvhJEEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T15:01:34.814615Z"},"content_sha256":"af0257df2094a80b4af9b9d12bcec4af2ae4967091406a474891253ddd2b234a","schema_version":"1.0","event_id":"sha256:af0257df2094a80b4af9b9d12bcec4af2ae4967091406a474891253ddd2b234a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IIEVSE4QFS5CUCU42FM6IEGPVC/bundle.json","state_url":"https://pith.science/pith/IIEVSE4QFS5CUCU42FM6IEGPVC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IIEVSE4QFS5CUCU42FM6IEGPVC/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-19T15:01:34Z","links":{"resolver":"https://pith.science/pith/IIEVSE4QFS5CUCU42FM6IEGPVC","bundle":"https://pith.science/pith/IIEVSE4QFS5CUCU42FM6IEGPVC/bundle.json","state":"https://pith.science/pith/IIEVSE4QFS5CUCU42FM6IEGPVC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IIEVSE4QFS5CUCU42FM6IEGPVC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IIEVSE4QFS5CUCU42FM6IEGPVC","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":"50e2383ed9493dd90c366426f2aa51665c4eede8bd70fb6b103b57e5163a8fba","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-10-08T21:46:34Z","title_canon_sha256":"9e66c3c6a87f5f0f033b5a7929415f4958a6ab41346be44973d2d45cf2ee3ac4"},"schema_version":"1.0","source":{"id":"1910.03701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.03701","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1910.03701v1","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.03701","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"IIEVSE4QFS5C","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"pith_short_16","alias_value":"IIEVSE4QFS5CUCU4","created_at":"2026-07-05T00:10:56Z"},{"alias_kind":"pith_short_8","alias_value":"IIEVSE4Q","created_at":"2026-07-05T00:10:56Z"}],"graph_snapshots":[{"event_id":"sha256:af0257df2094a80b4af9b9d12bcec4af2ae4967091406a474891253ddd2b234a","target":"graph","created_at":"2026-07-05T00:10:56Z","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/1910.03701/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sampling-based motion planning techniques have emerged as an efficient algorithmic paradigm for solving complex motion planning problems. These approaches use a set of probing samples to construct an implicit graph representation of the robot's state space, allowing arbitrarily accurate representations as the number of samples increases to infinity. In practice, however, solution trajectories only rely on a few critical states, often defined by structure in the state space (e.g., doorways). In this work we propose a general method to identify these critical states via graph-theoretic technique","authors_text":"Aleksandra Faust, Brian Ichter, Edward Schmerling, Tsang-Wei Edward Lee","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-10-08T21:46:34Z","title":"Learned Critical Probabilistic Roadmaps for Robotic Motion Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.03701","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:db949201004c87f0c546a5baa4379db386a066e4849efff6d118e0320a4e35eb","target":"record","created_at":"2026-07-05T00:10:56Z","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":"50e2383ed9493dd90c366426f2aa51665c4eede8bd70fb6b103b57e5163a8fba","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-10-08T21:46:34Z","title_canon_sha256":"9e66c3c6a87f5f0f033b5a7929415f4958a6ab41346be44973d2d45cf2ee3ac4"},"schema_version":"1.0","source":{"id":"1910.03701","kind":"arxiv","version":1}},"canonical_sha256":"42095913902cba2a0a9cd159e410cfa8a4394afd89fb4f3e8f53b0f81250667b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42095913902cba2a0a9cd159e410cfa8a4394afd89fb4f3e8f53b0f81250667b","first_computed_at":"2026-07-05T00:10:56.889266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:10:56.889266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qqNuPyKAuIQv3iuxc55jNYV4Xd02ogsHuLUN8byo/MJcU3EHgNuRdGorS84tbYtzJwG3itMrIl1HC+i3uivfDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:10:56.889664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.03701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db949201004c87f0c546a5baa4379db386a066e4849efff6d118e0320a4e35eb","sha256:af0257df2094a80b4af9b9d12bcec4af2ae4967091406a474891253ddd2b234a"],"state_sha256":"5441e72ad058e530cd13cb9331ab9acbb7fcbd7829b5b9e2b198f6fdeba68f48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TMwspSIzGGm6+ts5lSEjlQaNYd6T91hNo5pxnKcNFKxe29+ucrITot4HnY48x3cuRJHhQt5fnbxRXsXxBq7tDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-19T15:01:34.816849Z","bundle_sha256":"0a74c26c31b384ab41d6919041a26111f81856d72bdb61e7e24f05817eb2c311"}}