{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OFWTIAGRDFEZW3LELETWRPH3OY","short_pith_number":"pith:OFWTIAGR","schema_version":"1.0","canonical_sha256":"716d3400d119499b6d64592768bcfb762c927732e3ecb5be133a6263c8483a35","source":{"kind":"arxiv","id":"2305.10395","version":2},"attestation_state":"computed","paper":{"title":"Motion Planning (In)feasibility Detection using a Prior Roadmap via Path and Cut Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Peter Stone, Yoonchang Sung","submitted_at":"2023-05-17T17:36:22Z","abstract_excerpt":"Motion planning seeks a collision-free path in a configuration space (C-space), representing all possible robot configurations in the environment. As it is challenging to construct a C-space explicitly for a high-dimensional robot, we generally build a graph structure called a roadmap, a discrete approximation of a complex continuous C-space, to reason about connectivity. Checking collision-free connectivity in the roadmap requires expensive edge-evaluation computations, and thus, reducing the number of evaluations has become a significant research objective. However, in practice, we often fac"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2305.10395","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-05-17T17:36:22Z","cross_cats_sorted":[],"title_canon_sha256":"6f9b1a35a4bf41742046ab722bada791e819c148293e8a1027ddedab1489db16","abstract_canon_sha256":"2324208e6e53f084da16bd84a0378c1d55ac9b238b2e19566c946d2fb79d02d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:11:22.329553Z","signature_b64":"yuaNGLsg8Otq5bb/ihV9uIh3gUKcvibcH6j4ft/hmRgEBt220zRotzwwoBJQ3/FZIsZdUF55JtSchCgYGHgjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"716d3400d119499b6d64592768bcfb762c927732e3ecb5be133a6263c8483a35","last_reissued_at":"2026-07-05T06:11:22.329135Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:11:22.329135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Motion Planning (In)feasibility Detection using a Prior Roadmap via Path and Cut Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Peter Stone, Yoonchang Sung","submitted_at":"2023-05-17T17:36:22Z","abstract_excerpt":"Motion planning seeks a collision-free path in a configuration space (C-space), representing all possible robot configurations in the environment. As it is challenging to construct a C-space explicitly for a high-dimensional robot, we generally build a graph structure called a roadmap, a discrete approximation of a complex continuous C-space, to reason about connectivity. Checking collision-free connectivity in the roadmap requires expensive edge-evaluation computations, and thus, reducing the number of evaluations has become a significant research objective. However, in practice, we often fac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.10395","kind":"arxiv","version":2},"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/2305.10395/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.10395","created_at":"2026-07-05T06:11:22.329200+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.10395v2","created_at":"2026-07-05T06:11:22.329200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.10395","created_at":"2026-07-05T06:11:22.329200+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFWTIAGRDFEZ","created_at":"2026-07-05T06:11:22.329200+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFWTIAGRDFEZW3LE","created_at":"2026-07-05T06:11:22.329200+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFWTIAGR","created_at":"2026-07-05T06:11:22.329200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.00792","citing_title":"StochSIPP: Safe Interval Path Planning in Stochastic Dynamic Environments","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OFWTIAGRDFEZW3LELETWRPH3OY","json":"https://pith.science/pith/OFWTIAGRDFEZW3LELETWRPH3OY.json","graph_json":"https://pith.science/api/pith-number/OFWTIAGRDFEZW3LELETWRPH3OY/graph.json","events_json":"https://pith.science/api/pith-number/OFWTIAGRDFEZW3LELETWRPH3OY/events.json","paper":"https://pith.science/paper/OFWTIAGR"},"agent_actions":{"view_html":"https://pith.science/pith/OFWTIAGRDFEZW3LELETWRPH3OY","download_json":"https://pith.science/pith/OFWTIAGRDFEZW3LELETWRPH3OY.json","view_paper":"https://pith.science/paper/OFWTIAGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.10395&json=true","fetch_graph":"https://pith.science/api/pith-number/OFWTIAGRDFEZW3LELETWRPH3OY/graph.json","fetch_events":"https://pith.science/api/pith-number/OFWTIAGRDFEZW3LELETWRPH3OY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFWTIAGRDFEZW3LELETWRPH3OY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFWTIAGRDFEZW3LELETWRPH3OY/action/storage_attestation","attest_author":"https://pith.science/pith/OFWTIAGRDFEZW3LELETWRPH3OY/action/author_attestation","sign_citation":"https://pith.science/pith/OFWTIAGRDFEZW3LELETWRPH3OY/action/citation_signature","submit_replication":"https://pith.science/pith/OFWTIAGRDFEZW3LELETWRPH3OY/action/replication_record"}},"created_at":"2026-07-05T06:11:22.329200+00:00","updated_at":"2026-07-05T06:11:22.329200+00:00"}