{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AGK7NG3WQ5R4RNE4B6HXYWM54J","short_pith_number":"pith:AGK7NG3W","schema_version":"1.0","canonical_sha256":"0195f69b768763c8b49c0f8f7c599de275ecd0d320dda2528ceb61434cbbc3c7","source":{"kind":"arxiv","id":"2508.05396","version":1},"attestation_state":"computed","paper":{"title":"Real-Time Iteration Scheme for Diffusion Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Danica Kragic, Hang Yin, Yufei Duan","submitted_at":"2025-08-07T13:49:00Z","abstract_excerpt":"Diffusion Policies have demonstrated impressive performance in robotic manipulation tasks. However, their long inference time, resulting from an extensive iterative denoising process, and the need to execute an action chunk before the next prediction to maintain consistent actions limit their applicability to latency-critical tasks or simple tasks with a short cycle time. While recent methods explored distillation or alternative policy structures to accelerate inference, these often demand additional training, which can be resource-intensive for large robotic models. In this paper, we introduc"},"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":"2508.05396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-08-07T13:49:00Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f721e694ac63b00acc521f80007ad0cdd2198d6a7a2c87398e7fad4d553106ac","abstract_canon_sha256":"efbe7d08209b15993ed2857b71a725e9749e3296f5f78023a1ee69e3420be27a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:12.381189Z","signature_b64":"MlF2qnU2XA2bF3gWnDy08wBILqIumGRbUGz3/T4vyeTXnOI2E0EU9QQMX6tvn6nNIqay/KTFizVZ0n8TCXUlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0195f69b768763c8b49c0f8f7c599de275ecd0d320dda2528ceb61434cbbc3c7","last_reissued_at":"2026-07-05T11:50:12.380532Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:12.380532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Real-Time Iteration Scheme for Diffusion Policy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Danica Kragic, Hang Yin, Yufei Duan","submitted_at":"2025-08-07T13:49:00Z","abstract_excerpt":"Diffusion Policies have demonstrated impressive performance in robotic manipulation tasks. However, their long inference time, resulting from an extensive iterative denoising process, and the need to execute an action chunk before the next prediction to maintain consistent actions limit their applicability to latency-critical tasks or simple tasks with a short cycle time. While recent methods explored distillation or alternative policy structures to accelerate inference, these often demand additional training, which can be resource-intensive for large robotic models. In this paper, we introduc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05396","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/2508.05396/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":"2508.05396","created_at":"2026-07-05T11:50:12.380617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.05396v1","created_at":"2026-07-05T11:50:12.380617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05396","created_at":"2026-07-05T11:50:12.380617+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGK7NG3WQ5R4","created_at":"2026-07-05T11:50:12.380617+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGK7NG3WQ5R4RNE4","created_at":"2026-07-05T11:50:12.380617+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGK7NG3W","created_at":"2026-07-05T11:50:12.380617+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19774","citing_title":"Start Right, Arrive Right: Asynchronous Execution via Initial Noise Selection","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31460","citing_title":"On-Device Robotic Planning: Eliminating Inference Redundancy for Efficient Decision-Making","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01098","citing_title":"Implicit Drifting Policy: One-Step Action Generation via Conditional Expert Geometry","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AGK7NG3WQ5R4RNE4B6HXYWM54J","json":"https://pith.science/pith/AGK7NG3WQ5R4RNE4B6HXYWM54J.json","graph_json":"https://pith.science/api/pith-number/AGK7NG3WQ5R4RNE4B6HXYWM54J/graph.json","events_json":"https://pith.science/api/pith-number/AGK7NG3WQ5R4RNE4B6HXYWM54J/events.json","paper":"https://pith.science/paper/AGK7NG3W"},"agent_actions":{"view_html":"https://pith.science/pith/AGK7NG3WQ5R4RNE4B6HXYWM54J","download_json":"https://pith.science/pith/AGK7NG3WQ5R4RNE4B6HXYWM54J.json","view_paper":"https://pith.science/paper/AGK7NG3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.05396&json=true","fetch_graph":"https://pith.science/api/pith-number/AGK7NG3WQ5R4RNE4B6HXYWM54J/graph.json","fetch_events":"https://pith.science/api/pith-number/AGK7NG3WQ5R4RNE4B6HXYWM54J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGK7NG3WQ5R4RNE4B6HXYWM54J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGK7NG3WQ5R4RNE4B6HXYWM54J/action/storage_attestation","attest_author":"https://pith.science/pith/AGK7NG3WQ5R4RNE4B6HXYWM54J/action/author_attestation","sign_citation":"https://pith.science/pith/AGK7NG3WQ5R4RNE4B6HXYWM54J/action/citation_signature","submit_replication":"https://pith.science/pith/AGK7NG3WQ5R4RNE4B6HXYWM54J/action/replication_record"}},"created_at":"2026-07-05T11:50:12.380617+00:00","updated_at":"2026-07-05T11:50:12.380617+00:00"}