{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PBNCXZFNT53MX3LCVHNLLK3R73","short_pith_number":"pith:PBNCXZFN","schema_version":"1.0","canonical_sha256":"785a2be4ad9f76cbed62a9dab5ab71fef58187e6f2e1c55199e7d3ea91802d5a","source":{"kind":"arxiv","id":"2605.04525","version":2},"attestation_state":"computed","paper":{"title":"HDFlow: Hierarchical Diffusion-Flow Planning for Long-horizon Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"HDFlow uses a high-level diffusion planner to generate subgoals in latent space and a low-level rectified flow planner to produce trajectories for long-horizon robotic tasks.","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chaoyi Xu, He Wang, Nandiraju Gireesh, Weiheng Liu, Yuanliang Ju, Yuxuan Wan","submitted_at":"2026-05-06T06:08:51Z","abstract_excerpt":"Recent advances in generative models have shown promise in generating behavior plans for long-horizon, sparse reward tasks. While these approaches have achieved promising results, they often lack a principled framework for hierarchical decomposition and struggle with the computational demands of real-time execution, due to their iterative denoising process. In this work, we introduce Hierarchical Diffusion-Flow (HDFlow), a novel hierarchical planning framework that optimally leverages the strengths of diffusion and rectified flow models to overcome the limitations of single-paradigm generative"},"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":"2605.04525","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-06T06:08:51Z","cross_cats_sorted":[],"title_canon_sha256":"4d459cb006cdea9485f75b3dcd1a08621693d98b09e2612232a91968a1af5e4b","abstract_canon_sha256":"8fd36ec0a49ef150bb7e724326261bbd9c00f100f006e9ccd685d519a2360bc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:15.335532Z","signature_b64":"LMKXrs66sev4lmuz6etAWVqqYTXr3dX8ytrJzp7oZr8lTol4lvHNdvCm9sm8fWcY5pa6elw1I99HNZDXj7JPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"785a2be4ad9f76cbed62a9dab5ab71fef58187e6f2e1c55199e7d3ea91802d5a","last_reissued_at":"2026-05-20T01:05:15.335014Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:15.335014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HDFlow: Hierarchical Diffusion-Flow Planning for Long-horizon Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"HDFlow uses a high-level diffusion planner to generate subgoals in latent space and a low-level rectified flow planner to produce trajectories for long-horizon robotic tasks.","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Chaoyi Xu, He Wang, Nandiraju Gireesh, Weiheng Liu, Yuanliang Ju, Yuxuan Wan","submitted_at":"2026-05-06T06:08:51Z","abstract_excerpt":"Recent advances in generative models have shown promise in generating behavior plans for long-horizon, sparse reward tasks. While these approaches have achieved promising results, they often lack a principled framework for hierarchical decomposition and struggle with the computational demands of real-time execution, due to their iterative denoising process. In this work, we introduce Hierarchical Diffusion-Flow (HDFlow), a novel hierarchical planning framework that optimally leverages the strengths of diffusion and rectified flow models to overcome the limitations of single-paradigm generative"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"HDFlow significantly outperforms state-of-the-art methods on four challenging furniture assembly tasks in both simulation and real-world, and generalizes to two long-horizon benchmarks comprising diverse locomotion and manipulation tasks.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the learned latent space and subgoal conditioning allow the low-level rectified flow planner to generate feasible trajectories without additional feasibility checks or recovery mechanisms when high-level subgoals are unreachable.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"HDFlow pairs a high-level diffusion planner for subgoals with a low-level rectified flow planner for trajectories, outperforming prior methods on furniture assembly and locomotion-manipulation benchmarks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"HDFlow uses a high-level diffusion planner to generate subgoals in latent space and a low-level rectified flow planner to produce trajectories for long-horizon robotic tasks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"6b35e9dc3eaccc0094734a19f848cc80f9819d0092e006717adc92fc4d94636f"},"source":{"id":"2605.04525","kind":"arxiv","version":2},"verdict":{"id":"bc05a89a-48b6-45ac-99d2-0d077d658323","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T16:22:31.381940Z","strongest_claim":"HDFlow significantly outperforms state-of-the-art methods on four challenging furniture assembly tasks in both simulation and real-world, and generalizes to two long-horizon benchmarks comprising diverse locomotion and manipulation tasks.","one_line_summary":"HDFlow pairs a high-level diffusion planner for subgoals with a low-level rectified flow planner for trajectories, outperforming prior methods on furniture assembly and locomotion-manipulation benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the learned latent space and subgoal conditioning allow the low-level rectified flow planner to generate feasible trajectories without additional feasibility checks or recovery mechanisms when high-level subgoals are unreachable.","pith_extraction_headline":"HDFlow uses a high-level diffusion planner to generate subgoals in latent space and a low-level rectified flow planner to produce trajectories for long-horizon robotic tasks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.04525/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T23:01:19.753032Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:21:30.968655Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"b968a7a7b8a5c5518696a090d0c52b5753a7e353c76879dd75c3463dc8f13074"},"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":"2605.04525","created_at":"2026-05-20T01:05:15.335096+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.04525v2","created_at":"2026-05-20T01:05:15.335096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.04525","created_at":"2026-05-20T01:05:15.335096+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBNCXZFNT53M","created_at":"2026-05-20T01:05:15.335096+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBNCXZFNT53MX3LC","created_at":"2026-05-20T01:05:15.335096+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBNCXZFN","created_at":"2026-05-20T01:05:15.335096+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/PBNCXZFNT53MX3LCVHNLLK3R73","json":"https://pith.science/pith/PBNCXZFNT53MX3LCVHNLLK3R73.json","graph_json":"https://pith.science/api/pith-number/PBNCXZFNT53MX3LCVHNLLK3R73/graph.json","events_json":"https://pith.science/api/pith-number/PBNCXZFNT53MX3LCVHNLLK3R73/events.json","paper":"https://pith.science/paper/PBNCXZFN"},"agent_actions":{"view_html":"https://pith.science/pith/PBNCXZFNT53MX3LCVHNLLK3R73","download_json":"https://pith.science/pith/PBNCXZFNT53MX3LCVHNLLK3R73.json","view_paper":"https://pith.science/paper/PBNCXZFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.04525&json=true","fetch_graph":"https://pith.science/api/pith-number/PBNCXZFNT53MX3LCVHNLLK3R73/graph.json","fetch_events":"https://pith.science/api/pith-number/PBNCXZFNT53MX3LCVHNLLK3R73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBNCXZFNT53MX3LCVHNLLK3R73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBNCXZFNT53MX3LCVHNLLK3R73/action/storage_attestation","attest_author":"https://pith.science/pith/PBNCXZFNT53MX3LCVHNLLK3R73/action/author_attestation","sign_citation":"https://pith.science/pith/PBNCXZFNT53MX3LCVHNLLK3R73/action/citation_signature","submit_replication":"https://pith.science/pith/PBNCXZFNT53MX3LCVHNLLK3R73/action/replication_record"}},"created_at":"2026-05-20T01:05:15.335096+00:00","updated_at":"2026-05-20T01:05:15.335096+00:00"}