{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QIJOLOYCZVSAN6DEQO7WOL4XH7","short_pith_number":"pith:QIJOLOYC","schema_version":"1.0","canonical_sha256":"8212e5bb02cd6406f86483bf672f973fdce43bcb9e2da16729df8c8f8def1a21","source":{"kind":"arxiv","id":"2405.17879","version":2},"attestation_state":"computed","paper":{"title":"Resisting Stochastic Risks in Diffusion Planners with the Trajectory Aggregation Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bo An, Gang Pan, Lang Feng, Pengjie Gu","submitted_at":"2024-05-28T06:57:22Z","abstract_excerpt":"Diffusion planners have shown promise in handling long-horizon and sparse-reward tasks due to the non-autoregressive plan generation. However, their inherent stochastic risk of generating infeasible trajectories presents significant challenges to their reliability and stability. We introduce a novel approach, the Trajectory Aggregation Tree (TAT), to address this issue in diffusion planners. Compared to prior methods that rely solely on raw trajectory predictions, TAT aggregates information from both historical and current trajectories, forming a dynamic tree-like structure. Each trajectory is"},"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":"2405.17879","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-28T06:57:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4c814bbab50626daf0e96fdfdbe094a4374f9cdc3d421bc3f71b0a208d9e652a","abstract_canon_sha256":"3f9aa564e1e6658a2852433761b9e31bae0259233f96c395150b0468e57b4eda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:41.296507Z","signature_b64":"oDa047P3cza62k0+Segwb4inJznWMgruiGgBIEwT12FtNBMUjnXGB9JihliXGM5xgW+v0d2NRbYMl5psTwq1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8212e5bb02cd6406f86483bf672f973fdce43bcb9e2da16729df8c8f8def1a21","last_reissued_at":"2026-07-05T08:28:41.296020Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:41.296020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resisting Stochastic Risks in Diffusion Planners with the Trajectory Aggregation Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bo An, Gang Pan, Lang Feng, Pengjie Gu","submitted_at":"2024-05-28T06:57:22Z","abstract_excerpt":"Diffusion planners have shown promise in handling long-horizon and sparse-reward tasks due to the non-autoregressive plan generation. However, their inherent stochastic risk of generating infeasible trajectories presents significant challenges to their reliability and stability. We introduce a novel approach, the Trajectory Aggregation Tree (TAT), to address this issue in diffusion planners. Compared to prior methods that rely solely on raw trajectory predictions, TAT aggregates information from both historical and current trajectories, forming a dynamic tree-like structure. Each trajectory is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.17879","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/2405.17879/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":"2405.17879","created_at":"2026-07-05T08:28:41.296084+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.17879v2","created_at":"2026-07-05T08:28:41.296084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.17879","created_at":"2026-07-05T08:28:41.296084+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIJOLOYCZVSA","created_at":"2026-07-05T08:28:41.296084+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIJOLOYCZVSAN6DE","created_at":"2026-07-05T08:28:41.296084+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIJOLOYC","created_at":"2026-07-05T08:28:41.296084+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.15308","citing_title":"RAD-2: Scaling Reinforcement Learning in a Generator-Discriminator Framework","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QIJOLOYCZVSAN6DEQO7WOL4XH7","json":"https://pith.science/pith/QIJOLOYCZVSAN6DEQO7WOL4XH7.json","graph_json":"https://pith.science/api/pith-number/QIJOLOYCZVSAN6DEQO7WOL4XH7/graph.json","events_json":"https://pith.science/api/pith-number/QIJOLOYCZVSAN6DEQO7WOL4XH7/events.json","paper":"https://pith.science/paper/QIJOLOYC"},"agent_actions":{"view_html":"https://pith.science/pith/QIJOLOYCZVSAN6DEQO7WOL4XH7","download_json":"https://pith.science/pith/QIJOLOYCZVSAN6DEQO7WOL4XH7.json","view_paper":"https://pith.science/paper/QIJOLOYC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.17879&json=true","fetch_graph":"https://pith.science/api/pith-number/QIJOLOYCZVSAN6DEQO7WOL4XH7/graph.json","fetch_events":"https://pith.science/api/pith-number/QIJOLOYCZVSAN6DEQO7WOL4XH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIJOLOYCZVSAN6DEQO7WOL4XH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIJOLOYCZVSAN6DEQO7WOL4XH7/action/storage_attestation","attest_author":"https://pith.science/pith/QIJOLOYCZVSAN6DEQO7WOL4XH7/action/author_attestation","sign_citation":"https://pith.science/pith/QIJOLOYCZVSAN6DEQO7WOL4XH7/action/citation_signature","submit_replication":"https://pith.science/pith/QIJOLOYCZVSAN6DEQO7WOL4XH7/action/replication_record"}},"created_at":"2026-07-05T08:28:41.296084+00:00","updated_at":"2026-07-05T08:28:41.296084+00:00"}