{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:U5TLXF7QKCBTZ5CZGHW5WTM63R","short_pith_number":"pith:U5TLXF7Q","schema_version":"1.0","canonical_sha256":"a766bb97f050833cf45931eddb4d9edc5006bcc175d9228f38c17ad5e8359b5b","source":{"kind":"arxiv","id":"2412.11270","version":1},"attestation_state":"computed","paper":{"title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Benjamin Riviere, John Lathrop, Soon-Jo Chung","submitted_at":"2024-12-15T18:24:26Z","abstract_excerpt":"The ability of a robot to plan complex behaviors with real-time computation, rather than adhering to predesigned or offline-learned routines, alleviates the need for specialized algorithms or training for each problem instance. Monte Carlo Tree Search is a powerful planning algorithm that strategically explores simulated future possibilities, but it requires a discrete problem representation that is irreconcilable with the continuous dynamics of the physical world. We present Spectral Expansion Tree Search (SETS), a real-time, tree-based planner that uses the spectrum of the locally linearized"},"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":"2412.11270","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-12-15T18:24:26Z","cross_cats_sorted":[],"title_canon_sha256":"7650e2d1758169c41400dfb0f6ca21f2bcacd6e453f573335392de3b44aa8a1a","abstract_canon_sha256":"f52d40e73258bbe2453bbf8da9f1003eff20167fa4feb657889bae2267debb8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:49:29.846397Z","signature_b64":"QUSG+ZTh8oCczA3keMmuofxThHzQxE5Z9L9vBg6E6I3fSvWDxe3JQWseRtjVF53145C4Dg537LkXn3zSDrzBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a766bb97f050833cf45931eddb4d9edc5006bcc175d9228f38c17ad5e8359b5b","last_reissued_at":"2026-07-05T09:49:29.845989Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:49:29.845989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monte Carlo Tree Search with Spectral Expansion for Planning with Dynamical Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Benjamin Riviere, John Lathrop, Soon-Jo Chung","submitted_at":"2024-12-15T18:24:26Z","abstract_excerpt":"The ability of a robot to plan complex behaviors with real-time computation, rather than adhering to predesigned or offline-learned routines, alleviates the need for specialized algorithms or training for each problem instance. Monte Carlo Tree Search is a powerful planning algorithm that strategically explores simulated future possibilities, but it requires a discrete problem representation that is irreconcilable with the continuous dynamics of the physical world. We present Spectral Expansion Tree Search (SETS), a real-time, tree-based planner that uses the spectrum of the locally linearized"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.11270","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/2412.11270/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":"2412.11270","created_at":"2026-07-05T09:49:29.846044+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.11270v1","created_at":"2026-07-05T09:49:29.846044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.11270","created_at":"2026-07-05T09:49:29.846044+00:00"},{"alias_kind":"pith_short_12","alias_value":"U5TLXF7QKCBT","created_at":"2026-07-05T09:49:29.846044+00:00"},{"alias_kind":"pith_short_16","alias_value":"U5TLXF7QKCBTZ5CZ","created_at":"2026-07-05T09:49:29.846044+00:00"},{"alias_kind":"pith_short_8","alias_value":"U5TLXF7Q","created_at":"2026-07-05T09:49:29.846044+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/U5TLXF7QKCBTZ5CZGHW5WTM63R","json":"https://pith.science/pith/U5TLXF7QKCBTZ5CZGHW5WTM63R.json","graph_json":"https://pith.science/api/pith-number/U5TLXF7QKCBTZ5CZGHW5WTM63R/graph.json","events_json":"https://pith.science/api/pith-number/U5TLXF7QKCBTZ5CZGHW5WTM63R/events.json","paper":"https://pith.science/paper/U5TLXF7Q"},"agent_actions":{"view_html":"https://pith.science/pith/U5TLXF7QKCBTZ5CZGHW5WTM63R","download_json":"https://pith.science/pith/U5TLXF7QKCBTZ5CZGHW5WTM63R.json","view_paper":"https://pith.science/paper/U5TLXF7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.11270&json=true","fetch_graph":"https://pith.science/api/pith-number/U5TLXF7QKCBTZ5CZGHW5WTM63R/graph.json","fetch_events":"https://pith.science/api/pith-number/U5TLXF7QKCBTZ5CZGHW5WTM63R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U5TLXF7QKCBTZ5CZGHW5WTM63R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U5TLXF7QKCBTZ5CZGHW5WTM63R/action/storage_attestation","attest_author":"https://pith.science/pith/U5TLXF7QKCBTZ5CZGHW5WTM63R/action/author_attestation","sign_citation":"https://pith.science/pith/U5TLXF7QKCBTZ5CZGHW5WTM63R/action/citation_signature","submit_replication":"https://pith.science/pith/U5TLXF7QKCBTZ5CZGHW5WTM63R/action/replication_record"}},"created_at":"2026-07-05T09:49:29.846044+00:00","updated_at":"2026-07-05T09:49:29.846044+00:00"}