{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HCTFN23MXKPZVIFJKX6ZVEG3IV","short_pith_number":"pith:HCTFN23M","schema_version":"1.0","canonical_sha256":"38a656eb6cba9f9aa0a955fd9a90db4559a27e8c9d020ea3fbc5202fa8c99a8b","source":{"kind":"arxiv","id":"2508.21001","version":2},"attestation_state":"computed","paper":{"title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.LG","authors_text":"Kiril Solovey, Tom Jurgenson, Yaniv Hassidof","submitted_at":"2025-08-28T17:04:00Z","abstract_excerpt":"Kinodynamic motion planning is concerned with computing collision-free trajectories while abiding by the robot's dynamic constraints. This critical problem is often tackled using sampling-based planners (SBPs) that explore the robot's high-dimensional state space by constructing a search tree via action propagations. Although SBPs can offer global guarantees on completeness and solution quality, their performance is often hindered by slow exploration due to uninformed action sampling. Learning-based approaches can yield significantly faster runtimes, yet they fail to generalize to out-of-distr"},"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":"2508.21001","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-28T17:04:00Z","cross_cats_sorted":["cs.AI","cs.RO"],"title_canon_sha256":"8ae492877a71b0a1041915222f2d5e7f1b94e09f772246d970927896f21bf8f0","abstract_canon_sha256":"126575ce674c01761c8a12ca985e7fb494a14e933b8e0ddc61689d83ce24ef6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:05:20.827390Z","signature_b64":"gB6ls89ETMIzGLXojZcJrWo8goONTYMh85tx332Hn0lu5f+CKa70KS76IC7B5RIj4LrbSg8XfPUEle3AawfpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38a656eb6cba9f9aa0a955fd9a90db4559a27e8c9d020ea3fbc5202fa8c99a8b","last_reissued_at":"2026-07-05T12:05:20.826846Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:05:20.826846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Train-Once Plan-Anywhere Kinodynamic Motion Planning via Diffusion Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.LG","authors_text":"Kiril Solovey, Tom Jurgenson, Yaniv Hassidof","submitted_at":"2025-08-28T17:04:00Z","abstract_excerpt":"Kinodynamic motion planning is concerned with computing collision-free trajectories while abiding by the robot's dynamic constraints. This critical problem is often tackled using sampling-based planners (SBPs) that explore the robot's high-dimensional state space by constructing a search tree via action propagations. Although SBPs can offer global guarantees on completeness and solution quality, their performance is often hindered by slow exploration due to uninformed action sampling. Learning-based approaches can yield significantly faster runtimes, yet they fail to generalize to out-of-distr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.21001","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/2508.21001/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":"2508.21001","created_at":"2026-07-05T12:05:20.826916+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.21001v2","created_at":"2026-07-05T12:05:20.826916+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.21001","created_at":"2026-07-05T12:05:20.826916+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCTFN23MXKPZ","created_at":"2026-07-05T12:05:20.826916+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCTFN23MXKPZVIFJ","created_at":"2026-07-05T12:05:20.826916+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCTFN23M","created_at":"2026-07-05T12:05:20.826916+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03756","citing_title":"Neural Navigation Functions for Zero-Shot Generalizable Motion Planning","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HCTFN23MXKPZVIFJKX6ZVEG3IV","json":"https://pith.science/pith/HCTFN23MXKPZVIFJKX6ZVEG3IV.json","graph_json":"https://pith.science/api/pith-number/HCTFN23MXKPZVIFJKX6ZVEG3IV/graph.json","events_json":"https://pith.science/api/pith-number/HCTFN23MXKPZVIFJKX6ZVEG3IV/events.json","paper":"https://pith.science/paper/HCTFN23M"},"agent_actions":{"view_html":"https://pith.science/pith/HCTFN23MXKPZVIFJKX6ZVEG3IV","download_json":"https://pith.science/pith/HCTFN23MXKPZVIFJKX6ZVEG3IV.json","view_paper":"https://pith.science/paper/HCTFN23M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.21001&json=true","fetch_graph":"https://pith.science/api/pith-number/HCTFN23MXKPZVIFJKX6ZVEG3IV/graph.json","fetch_events":"https://pith.science/api/pith-number/HCTFN23MXKPZVIFJKX6ZVEG3IV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCTFN23MXKPZVIFJKX6ZVEG3IV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCTFN23MXKPZVIFJKX6ZVEG3IV/action/storage_attestation","attest_author":"https://pith.science/pith/HCTFN23MXKPZVIFJKX6ZVEG3IV/action/author_attestation","sign_citation":"https://pith.science/pith/HCTFN23MXKPZVIFJKX6ZVEG3IV/action/citation_signature","submit_replication":"https://pith.science/pith/HCTFN23MXKPZVIFJKX6ZVEG3IV/action/replication_record"}},"created_at":"2026-07-05T12:05:20.826916+00:00","updated_at":"2026-07-05T12:05:20.826916+00:00"}