{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XQXERBKPHXLRYRCDFPWU3LJR3C","short_pith_number":"pith:XQXERBKP","schema_version":"1.0","canonical_sha256":"bc2e48854f3dd71c44432bed4dad31d893ee9adf1c4950d95ea8b0bbb370d5c5","source":{"kind":"arxiv","id":"2511.20906","version":2},"attestation_state":"computed","paper":{"title":"DASIP: Dynamic Test-Time Compute Scaling for Robot Control with Stochastic Interpolant Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Eric Vanden-Eijnden, Inkook Chun, Michael S. Albergo, Saining Xie, Seungjae Lee","submitted_at":"2025-11-25T22:46:42Z","abstract_excerpt":"Diffusion- and flow-based policies deliver state-of-the-art performance on long-horizon robotic manipulation and imitation learning tasks. However, these controllers employ a fixed inference budget at every control step, regardless of task complexity, leading to computational inefficiency for simple subtasks while potentially underperforming on challenging ones. To address these issues, we introduce Difficulty-Aware Stochastic Interpolant Policy (DA-SIP), a framework that enables robotic controllers to adaptively adjust their integration horizon in real time based on task difficulty. Our appro"},"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":"2511.20906","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-11-25T22:46:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"505fe0170555cc648289e48112ea3c257005a274434ad410e8a763f0f290e369","abstract_canon_sha256":"56e1e7a15738875549ea80d9bdc9befb3f50978a2cbce16e5a6df86680766647"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:18.925349Z","signature_b64":"GTOwxaH5TLNBETqVz5tBxuZautOzZYi6ZovDv0awZEgxcoEI6zNvzT5trozbWJU9kY3PF+ywvdEjUK8MrLwkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc2e48854f3dd71c44432bed4dad31d893ee9adf1c4950d95ea8b0bbb370d5c5","last_reissued_at":"2026-06-23T02:13:18.924847Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:18.924847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DASIP: Dynamic Test-Time Compute Scaling for Robot Control with Stochastic Interpolant Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Eric Vanden-Eijnden, Inkook Chun, Michael S. Albergo, Saining Xie, Seungjae Lee","submitted_at":"2025-11-25T22:46:42Z","abstract_excerpt":"Diffusion- and flow-based policies deliver state-of-the-art performance on long-horizon robotic manipulation and imitation learning tasks. However, these controllers employ a fixed inference budget at every control step, regardless of task complexity, leading to computational inefficiency for simple subtasks while potentially underperforming on challenging ones. To address these issues, we introduce Difficulty-Aware Stochastic Interpolant Policy (DA-SIP), a framework that enables robotic controllers to adaptively adjust their integration horizon in real time based on task difficulty. Our appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.20906","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/2511.20906/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":"2511.20906","created_at":"2026-06-23T02:13:18.924908+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.20906v2","created_at":"2026-06-23T02:13:18.924908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.20906","created_at":"2026-06-23T02:13:18.924908+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQXERBKPHXLR","created_at":"2026-06-23T02:13:18.924908+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQXERBKPHXLRYRCD","created_at":"2026-06-23T02:13:18.924908+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQXERBKP","created_at":"2026-06-23T02:13:18.924908+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/XQXERBKPHXLRYRCDFPWU3LJR3C","json":"https://pith.science/pith/XQXERBKPHXLRYRCDFPWU3LJR3C.json","graph_json":"https://pith.science/api/pith-number/XQXERBKPHXLRYRCDFPWU3LJR3C/graph.json","events_json":"https://pith.science/api/pith-number/XQXERBKPHXLRYRCDFPWU3LJR3C/events.json","paper":"https://pith.science/paper/XQXERBKP"},"agent_actions":{"view_html":"https://pith.science/pith/XQXERBKPHXLRYRCDFPWU3LJR3C","download_json":"https://pith.science/pith/XQXERBKPHXLRYRCDFPWU3LJR3C.json","view_paper":"https://pith.science/paper/XQXERBKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.20906&json=true","fetch_graph":"https://pith.science/api/pith-number/XQXERBKPHXLRYRCDFPWU3LJR3C/graph.json","fetch_events":"https://pith.science/api/pith-number/XQXERBKPHXLRYRCDFPWU3LJR3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQXERBKPHXLRYRCDFPWU3LJR3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQXERBKPHXLRYRCDFPWU3LJR3C/action/storage_attestation","attest_author":"https://pith.science/pith/XQXERBKPHXLRYRCDFPWU3LJR3C/action/author_attestation","sign_citation":"https://pith.science/pith/XQXERBKPHXLRYRCDFPWU3LJR3C/action/citation_signature","submit_replication":"https://pith.science/pith/XQXERBKPHXLRYRCDFPWU3LJR3C/action/replication_record"}},"created_at":"2026-06-23T02:13:18.924908+00:00","updated_at":"2026-06-23T02:13:18.924908+00:00"}