{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PBNCXZFNT53MX3LCVHNLLK3R73","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":"8fd36ec0a49ef150bb7e724326261bbd9c00f100f006e9ccd685d519a2360bc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-06T06:08:51Z","title_canon_sha256":"4d459cb006cdea9485f75b3dcd1a08621693d98b09e2612232a91968a1af5e4b"},"schema_version":"1.0","source":{"id":"2605.04525","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.04525","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"2605.04525v2","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.04525","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"PBNCXZFNT53M","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_16","alias_value":"PBNCXZFNT53MX3LC","created_at":"2026-05-20T01:05:15Z"},{"alias_kind":"pith_short_8","alias_value":"PBNCXZFN","created_at":"2026-05-20T01:05:15Z"}],"graph_snapshots":[{"event_id":"sha256:39bc615cc701c1397f1793bed53fb9b9155808895f07a3007ecd55f2aa84c64b","target":"graph","created_at":"2026-05-20T01:05:15Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","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."}],"snapshot_sha256":"6b35e9dc3eaccc0094734a19f848cc80f9819d0092e006717adc92fc4d94636f"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.04525/integrity.json","findings":[],"snapshot_sha256":"b968a7a7b8a5c5518696a090d0c52b5753a7e353c76879dd75c3463dc8f13074","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chaoyi Xu, He Wang, Nandiraju Gireesh, Weiheng Liu, Yuanliang Ju, Yuxuan Wan","cross_cats":[],"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.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-06T06:08:51Z","title":"HDFlow: Hierarchical Diffusion-Flow Planning for Long-horizon Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.04525","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T16:22:31.381940Z","id":"bc05a89a-48b6-45ac-99d2-0d077d658323","model_set":{"reader":"grok-4.3"},"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","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.","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.","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."}},"verdict_id":"bc05a89a-48b6-45ac-99d2-0d077d658323"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:680839d15301b03da05201aa266a947d3de97e691d09bbd9f6fbe548889889f2","target":"record","created_at":"2026-05-20T01:05:15Z","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":"8fd36ec0a49ef150bb7e724326261bbd9c00f100f006e9ccd685d519a2360bc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-06T06:08:51Z","title_canon_sha256":"4d459cb006cdea9485f75b3dcd1a08621693d98b09e2612232a91968a1af5e4b"},"schema_version":"1.0","source":{"id":"2605.04525","kind":"arxiv","version":2}},"canonical_sha256":"785a2be4ad9f76cbed62a9dab5ab71fef58187e6f2e1c55199e7d3ea91802d5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"785a2be4ad9f76cbed62a9dab5ab71fef58187e6f2e1c55199e7d3ea91802d5a","first_computed_at":"2026-05-20T01:05:15.335014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:15.335014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LMKXrs66sev4lmuz6etAWVqqYTXr3dX8ytrJzp7oZr8lTol4lvHNdvCm9sm8fWcY5pa6elw1I99HNZDXj7JPAA==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:15.335532Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.04525","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:680839d15301b03da05201aa266a947d3de97e691d09bbd9f6fbe548889889f2","sha256:39bc615cc701c1397f1793bed53fb9b9155808895f07a3007ecd55f2aa84c64b"],"state_sha256":"33741b141cc27492610077c727423d0fed15627f732ecc4a6a9dc0a1d625c324"}