{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6JGUS5F4KLWILNNA4C4OJOKART","short_pith_number":"pith:6JGUS5F4","schema_version":"1.0","canonical_sha256":"f24d4974bc52ec85b5a0e0b8e4b9408ced2f1f3de263bab88e804147e09178c5","source":{"kind":"arxiv","id":"2409.12902","version":1},"attestation_state":"computed","paper":{"title":"Fast End-to-End Generation of Belief Space Paths for Minimum Sensing Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Lukas Taus, Richard Tsai, Takashi Tanaka, Vrushabh Zinage","submitted_at":"2024-09-19T16:49:36Z","abstract_excerpt":"We revisit the problem of motion planning in the Gaussian belief space. Motivated by the fact that most existing sampling-based planners suffer from high computational costs due to the high-dimensional nature of the problem, we propose an approach that leverages a deep learning model to predict optimal path candidates directly from the problem description. Our proposed approach consists of three steps. First, we prepare a training dataset comprising a large number of input-output pairs: the input image encodes the problem to be solved (e.g., start states, goal states, and obstacle locations), "},"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":"2409.12902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-09-19T16:49:36Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c448855a60fd1af6995668517b4f814afb29767656f71aebd525731dcab67412","abstract_canon_sha256":"a95e6febda36070ba6ef77a0756615dbf409ceaa6eb13f42ab2484ff4e1f27fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:13.734474Z","signature_b64":"Lxuo7skXmO1W4GkTc1OdJQnE5WzztioknuPt8mSaPxlKPpKcx53kLrFNpZpVzHz2hJZ4Pl5+5fams6dtEA3ODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f24d4974bc52ec85b5a0e0b8e4b9408ced2f1f3de263bab88e804147e09178c5","last_reissued_at":"2026-07-05T09:09:13.733984Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:13.733984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast End-to-End Generation of Belief Space Paths for Minimum Sensing Navigation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Lukas Taus, Richard Tsai, Takashi Tanaka, Vrushabh Zinage","submitted_at":"2024-09-19T16:49:36Z","abstract_excerpt":"We revisit the problem of motion planning in the Gaussian belief space. Motivated by the fact that most existing sampling-based planners suffer from high computational costs due to the high-dimensional nature of the problem, we propose an approach that leverages a deep learning model to predict optimal path candidates directly from the problem description. Our proposed approach consists of three steps. First, we prepare a training dataset comprising a large number of input-output pairs: the input image encodes the problem to be solved (e.g., start states, goal states, and obstacle locations), "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12902","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/2409.12902/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":"2409.12902","created_at":"2026-07-05T09:09:13.734041+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.12902v1","created_at":"2026-07-05T09:09:13.734041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12902","created_at":"2026-07-05T09:09:13.734041+00:00"},{"alias_kind":"pith_short_12","alias_value":"6JGUS5F4KLWI","created_at":"2026-07-05T09:09:13.734041+00:00"},{"alias_kind":"pith_short_16","alias_value":"6JGUS5F4KLWILNNA","created_at":"2026-07-05T09:09:13.734041+00:00"},{"alias_kind":"pith_short_8","alias_value":"6JGUS5F4","created_at":"2026-07-05T09:09:13.734041+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6JGUS5F4KLWILNNA4C4OJOKART","json":"https://pith.science/pith/6JGUS5F4KLWILNNA4C4OJOKART.json","graph_json":"https://pith.science/api/pith-number/6JGUS5F4KLWILNNA4C4OJOKART/graph.json","events_json":"https://pith.science/api/pith-number/6JGUS5F4KLWILNNA4C4OJOKART/events.json","paper":"https://pith.science/paper/6JGUS5F4"},"agent_actions":{"view_html":"https://pith.science/pith/6JGUS5F4KLWILNNA4C4OJOKART","download_json":"https://pith.science/pith/6JGUS5F4KLWILNNA4C4OJOKART.json","view_paper":"https://pith.science/paper/6JGUS5F4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.12902&json=true","fetch_graph":"https://pith.science/api/pith-number/6JGUS5F4KLWILNNA4C4OJOKART/graph.json","fetch_events":"https://pith.science/api/pith-number/6JGUS5F4KLWILNNA4C4OJOKART/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6JGUS5F4KLWILNNA4C4OJOKART/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6JGUS5F4KLWILNNA4C4OJOKART/action/storage_attestation","attest_author":"https://pith.science/pith/6JGUS5F4KLWILNNA4C4OJOKART/action/author_attestation","sign_citation":"https://pith.science/pith/6JGUS5F4KLWILNNA4C4OJOKART/action/citation_signature","submit_replication":"https://pith.science/pith/6JGUS5F4KLWILNNA4C4OJOKART/action/replication_record"}},"created_at":"2026-07-05T09:09:13.734041+00:00","updated_at":"2026-07-05T09:09:13.734041+00:00"}