{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VOXB54DV32CVZ7CJ6XSGE7NRK7","short_pith_number":"pith:VOXB54DV","canonical_record":{"source":{"id":"2411.15651","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-11-23T21:06:26Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"8c453acb531bbe85c592cadfddd47a3d26e22fabd7c5b94a926bffdfa3bb9bc3","abstract_canon_sha256":"5abe4644199c64340fcebc7548801ca43c2e1200514b4c536124ab91d62770ab"},"schema_version":"1.0"},"canonical_sha256":"abae1ef075de855cfc49f5e4627db157f513a8c0a484a944394ed707b342995f","source":{"kind":"arxiv","id":"2411.15651","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.15651","created_at":"2026-07-05T09:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"2411.15651v1","created_at":"2026-07-05T09:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15651","created_at":"2026-07-05T09:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"VOXB54DV32CV","created_at":"2026-07-05T09:39:38Z"},{"alias_kind":"pith_short_16","alias_value":"VOXB54DV32CVZ7CJ","created_at":"2026-07-05T09:39:38Z"},{"alias_kind":"pith_short_8","alias_value":"VOXB54DV","created_at":"2026-07-05T09:39:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VOXB54DV32CVZ7CJ6XSGE7NRK7","target":"record","payload":{"canonical_record":{"source":{"id":"2411.15651","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-11-23T21:06:26Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"8c453acb531bbe85c592cadfddd47a3d26e22fabd7c5b94a926bffdfa3bb9bc3","abstract_canon_sha256":"5abe4644199c64340fcebc7548801ca43c2e1200514b4c536124ab91d62770ab"},"schema_version":"1.0"},"canonical_sha256":"abae1ef075de855cfc49f5e4627db157f513a8c0a484a944394ed707b342995f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:38.540585Z","signature_b64":"rmxUIrD+z7ux2J/eL+DhgljIYsG3Mgz8bKmtNcCTWC4kEunarNM32qCjdhriaXXiInK5J5t/iwzyfaLTVmiFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abae1ef075de855cfc49f5e4627db157f513a8c0a484a944394ed707b342995f","last_reissued_at":"2026-07-05T09:39:38.540168Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:38.540168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.15651","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-05T09:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NCgmvWwuKA1VSci1YhuC3+t+IO8fNj25Phvr3zP8LQWx1aaSJWD0FqlCUmpQI5Yo2mm8Oj4ynwwkVZFcKBy3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:51:11.897270Z"},"content_sha256":"b119c432e8a3f30d66ffa91288583b806c2df599f5be6a11a610e1fff565443c","schema_version":"1.0","event_id":"sha256:b119c432e8a3f30d66ffa91288583b806c2df599f5be6a11a610e1fff565443c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VOXB54DV32CVZ7CJ6XSGE7NRK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Benjamin Rivi`ere, Jedidiah Alindogan, John Lathrop, Soon-Jo Chung","submitted_at":"2024-11-23T21:06:26Z","abstract_excerpt":"We present Model Predictive Trees (MPT), a receding horizon tree search algorithm that improves its performance by reusing information efficiently. Whereas existing solvers reuse only the highest-quality trajectory from the previous iteration as a \"hotstart\", our method reuses the entire optimal subtree, enabling the search to be simultaneously guided away from the low-quality areas and towards the high-quality areas. We characterize the restrictions on tree reuse by analyzing the induced tracking error under time-varying dynamics, revealing a tradeoff between the search depth and the timescal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15651","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/2411.15651/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-05T09:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hM6nlADL3aOV9wrsr5ZdEfd/qI3Zwb3zOAN1A59ZBa0gFnFOl1hjxb6t6TTkQWbjaFQGs6rY0EN6cCyBkPERAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:51:11.898236Z"},"content_sha256":"ad004679f3ef06556579bebdac9ae63a5ddd53c4728b587f1df61c49b0ecd0f9","schema_version":"1.0","event_id":"sha256:ad004679f3ef06556579bebdac9ae63a5ddd53c4728b587f1df61c49b0ecd0f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VOXB54DV32CVZ7CJ6XSGE7NRK7/bundle.json","state_url":"https://pith.science/pith/VOXB54DV32CVZ7CJ6XSGE7NRK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VOXB54DV32CVZ7CJ6XSGE7NRK7/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-08-13T02:51:11Z","links":{"resolver":"https://pith.science/pith/VOXB54DV32CVZ7CJ6XSGE7NRK7","bundle":"https://pith.science/pith/VOXB54DV32CVZ7CJ6XSGE7NRK7/bundle.json","state":"https://pith.science/pith/VOXB54DV32CVZ7CJ6XSGE7NRK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VOXB54DV32CVZ7CJ6XSGE7NRK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VOXB54DV32CVZ7CJ6XSGE7NRK7","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":"5abe4644199c64340fcebc7548801ca43c2e1200514b4c536124ab91d62770ab","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-11-23T21:06:26Z","title_canon_sha256":"8c453acb531bbe85c592cadfddd47a3d26e22fabd7c5b94a926bffdfa3bb9bc3"},"schema_version":"1.0","source":{"id":"2411.15651","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.15651","created_at":"2026-07-05T09:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"2411.15651v1","created_at":"2026-07-05T09:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15651","created_at":"2026-07-05T09:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"VOXB54DV32CV","created_at":"2026-07-05T09:39:38Z"},{"alias_kind":"pith_short_16","alias_value":"VOXB54DV32CVZ7CJ","created_at":"2026-07-05T09:39:38Z"},{"alias_kind":"pith_short_8","alias_value":"VOXB54DV","created_at":"2026-07-05T09:39:38Z"}],"graph_snapshots":[{"event_id":"sha256:ad004679f3ef06556579bebdac9ae63a5ddd53c4728b587f1df61c49b0ecd0f9","target":"graph","created_at":"2026-07-05T09:39:38Z","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/2411.15651/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present Model Predictive Trees (MPT), a receding horizon tree search algorithm that improves its performance by reusing information efficiently. Whereas existing solvers reuse only the highest-quality trajectory from the previous iteration as a \"hotstart\", our method reuses the entire optimal subtree, enabling the search to be simultaneously guided away from the low-quality areas and towards the high-quality areas. We characterize the restrictions on tree reuse by analyzing the induced tracking error under time-varying dynamics, revealing a tradeoff between the search depth and the timescal","authors_text":"Benjamin Rivi`ere, Jedidiah Alindogan, John Lathrop, Soon-Jo Chung","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-11-23T21:06:26Z","title":"Model Predictive Trees: Sample-Efficient Receding Horizon Planning with Reusable Tree Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15651","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:b119c432e8a3f30d66ffa91288583b806c2df599f5be6a11a610e1fff565443c","target":"record","created_at":"2026-07-05T09:39:38Z","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":"5abe4644199c64340fcebc7548801ca43c2e1200514b4c536124ab91d62770ab","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-11-23T21:06:26Z","title_canon_sha256":"8c453acb531bbe85c592cadfddd47a3d26e22fabd7c5b94a926bffdfa3bb9bc3"},"schema_version":"1.0","source":{"id":"2411.15651","kind":"arxiv","version":1}},"canonical_sha256":"abae1ef075de855cfc49f5e4627db157f513a8c0a484a944394ed707b342995f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abae1ef075de855cfc49f5e4627db157f513a8c0a484a944394ed707b342995f","first_computed_at":"2026-07-05T09:39:38.540168Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:39:38.540168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rmxUIrD+z7ux2J/eL+DhgljIYsG3Mgz8bKmtNcCTWC4kEunarNM32qCjdhriaXXiInK5J5t/iwzyfaLTVmiFAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:39:38.540585Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.15651","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b119c432e8a3f30d66ffa91288583b806c2df599f5be6a11a610e1fff565443c","sha256:ad004679f3ef06556579bebdac9ae63a5ddd53c4728b587f1df61c49b0ecd0f9"],"state_sha256":"3771323d730a70694a6c3797b201ea27b3a1761fa8eda60d47b7a1e77d44dc84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DG6NoxJMQbCurqGYd+P4l+5y1778ecbhKvfeI8aYyHTaUN84zsPi0i4qaDQgPdj8/vG3l7uHvhg5Tw1Z1LYXBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T02:51:11.905040Z","bundle_sha256":"a99fed4d9be797237992b60eac8ab85d9d4810910440df062cbd7ee5195a0167"}}