{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HDGH2BZ6SGTR7QAZ22ATFDMFDH","short_pith_number":"pith:HDGH2BZ6","schema_version":"1.0","canonical_sha256":"38cc7d073e91a71fc019d681328d8519ddca8191d054ecd622905f719ed21d30","source":{"kind":"arxiv","id":"2412.04987","version":2},"attestation_state":"computed","paper":{"title":"FlowPolicy: Enabling Fast and Robust 3D Flow-based Policy via Consistency Flow Matching for Robot Manipulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Bing Zeng, Guanghui Liu, Haoqiang Fan, Qinglun Zhang, Shuaicheng Liu, Zhen Liu","submitted_at":"2024-12-06T12:15:24Z","abstract_excerpt":"Robots can acquire complex manipulation skills by learning policies from expert demonstrations, which is often known as vision-based imitation learning. Generating policies based on diffusion and flow matching models has been shown to be effective, particularly in robotic manipulation tasks. However, recursion-based approaches are inference inefficient in working from noise distributions to policy distributions, posing a challenging trade-off between efficiency and quality. This motivates us to propose FlowPolicy, a novel framework for fast policy generation based on consistency flow matching "},"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.04987","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-12-06T12:15:24Z","cross_cats_sorted":[],"title_canon_sha256":"fda5a7f19245af0510951aa819221e4e5d549d287299d851cc8244a871fb735a","abstract_canon_sha256":"a98874b68c85589d801bb403facb24390dce0bfbebaab76fede32826baa2a856"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:49:13.424249Z","signature_b64":"MNxXcPXGw9A6sRZcG8bSZE8PI2R5Smg5ogK+LXDNAC9bd0oqqe9abDvTmWS0erCUKhw47I7nkOt/8dA7JPeVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38cc7d073e91a71fc019d681328d8519ddca8191d054ecd622905f719ed21d30","last_reissued_at":"2026-07-05T09:49:13.423751Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:49:13.423751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FlowPolicy: Enabling Fast and Robust 3D Flow-based Policy via Consistency Flow Matching for Robot Manipulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Bing Zeng, Guanghui Liu, Haoqiang Fan, Qinglun Zhang, Shuaicheng Liu, Zhen Liu","submitted_at":"2024-12-06T12:15:24Z","abstract_excerpt":"Robots can acquire complex manipulation skills by learning policies from expert demonstrations, which is often known as vision-based imitation learning. Generating policies based on diffusion and flow matching models has been shown to be effective, particularly in robotic manipulation tasks. However, recursion-based approaches are inference inefficient in working from noise distributions to policy distributions, posing a challenging trade-off between efficiency and quality. This motivates us to propose FlowPolicy, a novel framework for fast policy generation based on consistency flow matching "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.04987","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/2412.04987/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.04987","created_at":"2026-07-05T09:49:13.423809+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.04987v2","created_at":"2026-07-05T09:49:13.423809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.04987","created_at":"2026-07-05T09:49:13.423809+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDGH2BZ6SGTR","created_at":"2026-07-05T09:49:13.423809+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDGH2BZ6SGTR7QAZ","created_at":"2026-07-05T09:49:13.423809+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDGH2BZ6","created_at":"2026-07-05T09:49:13.423809+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30318","citing_title":"Chronos: A Physics-Informed Full-History Framework for Non-Markovian Long-Horizon Manipulation","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01098","citing_title":"Implicit Drifting Policy: One-Step Action Generation via Conditional Expert Geometry","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10371","citing_title":"Test-time Adversarial Takeover: A Real-time Hijacking Interface against Robotic Diffusion Policies","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2511.14148","citing_title":"AsyncVLA: Asynchronous Flow Matching for Vision-Language-Action Models","ref_index":77,"is_internal_anchor":false},{"citing_arxiv_id":"2603.05117","citing_title":"SeedPolicy: Horizon Scaling via Self-Evolving Diffusion Policy for Robot Manipulation","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13428","citing_title":"SID: Sliding into Distribution for Robust Few-Demonstration Manipulation","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HDGH2BZ6SGTR7QAZ22ATFDMFDH","json":"https://pith.science/pith/HDGH2BZ6SGTR7QAZ22ATFDMFDH.json","graph_json":"https://pith.science/api/pith-number/HDGH2BZ6SGTR7QAZ22ATFDMFDH/graph.json","events_json":"https://pith.science/api/pith-number/HDGH2BZ6SGTR7QAZ22ATFDMFDH/events.json","paper":"https://pith.science/paper/HDGH2BZ6"},"agent_actions":{"view_html":"https://pith.science/pith/HDGH2BZ6SGTR7QAZ22ATFDMFDH","download_json":"https://pith.science/pith/HDGH2BZ6SGTR7QAZ22ATFDMFDH.json","view_paper":"https://pith.science/paper/HDGH2BZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.04987&json=true","fetch_graph":"https://pith.science/api/pith-number/HDGH2BZ6SGTR7QAZ22ATFDMFDH/graph.json","fetch_events":"https://pith.science/api/pith-number/HDGH2BZ6SGTR7QAZ22ATFDMFDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDGH2BZ6SGTR7QAZ22ATFDMFDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDGH2BZ6SGTR7QAZ22ATFDMFDH/action/storage_attestation","attest_author":"https://pith.science/pith/HDGH2BZ6SGTR7QAZ22ATFDMFDH/action/author_attestation","sign_citation":"https://pith.science/pith/HDGH2BZ6SGTR7QAZ22ATFDMFDH/action/citation_signature","submit_replication":"https://pith.science/pith/HDGH2BZ6SGTR7QAZ22ATFDMFDH/action/replication_record"}},"created_at":"2026-07-05T09:49:13.423809+00:00","updated_at":"2026-07-05T09:49:13.423809+00:00"}