{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MHFEI5HEL2K67XNUHXBIPMIN56","short_pith_number":"pith:MHFEI5HE","schema_version":"1.0","canonical_sha256":"61ca4474e45e95efddb43dc287b10defbedefa82cdf56db27c37ac753c2bb5d0","source":{"kind":"arxiv","id":"2605.11567","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Execution Commitment of Vision-Language-Action Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Vision-language-action models can adaptively commit to action sequences by verifying the longest consistent prefix through consensus sampling and invariance checks.","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Boying Li, Feng Chen, Xianghui Wang, Yefei He, Yicheng Wu, Yuxuan Chen, Zeyu Zhang","submitted_at":"2026-05-12T05:52:58Z","abstract_excerpt":"Vision-Language-Action (VLA) models predominantly adopt action chunking, i.e., predicting and committing to a short horizon of consecutive low-level actions in a single forward pass, to amortize the inference cost of large-scale backbones and reduce per-step latency. However, committing these multi-step predictions to real-world execution requires balancing success rate against inference efficiency, a decision typically governed by fixed execution horizons tuned per task. Such heuristics ignore the state-dependent nature of predictive reliability, leading to brittle performance in dynamic or o"},"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.11567","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-12T05:52:58Z","cross_cats_sorted":[],"title_canon_sha256":"1a8a165342265d0d19f40a5a1ecc204b36209b2847417d7ed7de489e94905286","abstract_canon_sha256":"30b8f1381fefd9b7767dbf45ab304ca871a5d62314642a9e196d9aebac337377"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:36.088852Z","signature_b64":"IpVNOuHQh5zGe8iHwhNJF+JLLvIDyBxD1M6pfE/uHr1cvZWYrg6J/X4SjwmKRlrwuVFdLbT7nSnvCOE81dfBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61ca4474e45e95efddb43dc287b10defbedefa82cdf56db27c37ac753c2bb5d0","last_reissued_at":"2026-05-20T00:04:36.087778Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:36.087778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Execution Commitment of Vision-Language-Action Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Vision-language-action models can adaptively commit to action sequences by verifying the longest consistent prefix through consensus sampling and invariance checks.","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Boying Li, Feng Chen, Xianghui Wang, Yefei He, Yicheng Wu, Yuxuan Chen, Zeyu Zhang","submitted_at":"2026-05-12T05:52:58Z","abstract_excerpt":"Vision-Language-Action (VLA) models predominantly adopt action chunking, i.e., predicting and committing to a short horizon of consecutive low-level actions in a single forward pass, to amortize the inference cost of large-scale backbones and reduce per-step latency. However, committing these multi-step predictions to real-world execution requires balancing success rate against inference efficiency, a decision typically governed by fixed execution horizons tuned per task. Such heuristics ignore the state-dependent nature of predictive reliability, leading to brittle performance in dynamic or o"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Consequently, the execution horizon emerges as the longest verifiable prefix satisfying both internal model logic and sequential execution constraints.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That a trajectory-wise consensus score computed via group sampling, combined with the two proposed verification rules, reliably identifies state-dependent predictive reliability in dynamic or out-of-distribution settings.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A3 determines the execution horizon in VLA models as the longest prefix of actions that passes consensus-based verification and sequential consistency checks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Vision-language-action models can adaptively commit to action sequences by verifying the longest consistent prefix through consensus sampling and invariance checks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"4f8b4fc661d6c72e804cb8f28a49f48685fa365d46e2f2701c117076215d6a88"},"source":{"id":"2605.11567","kind":"arxiv","version":2},"verdict":{"id":"cf67dc37-556f-4b28-b58e-c7e02c22bfe6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T01:41:53.869503Z","strongest_claim":"Consequently, the execution horizon emerges as the longest verifiable prefix satisfying both internal model logic and sequential execution constraints.","one_line_summary":"A3 determines the execution horizon in VLA models as the longest prefix of actions that passes consensus-based verification and sequential consistency checks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That a trajectory-wise consensus score computed via group sampling, combined with the two proposed verification rules, reliably identifies state-dependent predictive reliability in dynamic or out-of-distribution settings.","pith_extraction_headline":"Vision-language-action models can adaptively commit to action sequences by verifying the longest consistent prefix through consensus sampling and invariance checks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.11567/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T12:33:46.736920Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T09:31:18.516352Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T08:19:30.518076Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"6b68a89a42c9ee3502a6e4e9a815f00c1c75f266a8f4a86c0851f2705baf3c45"},"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.11567","created_at":"2026-05-20T00:04:36.087922+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.11567v2","created_at":"2026-05-20T00:04:36.087922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11567","created_at":"2026-05-20T00:04:36.087922+00:00"},{"alias_kind":"pith_short_12","alias_value":"MHFEI5HEL2K6","created_at":"2026-05-20T00:04:36.087922+00:00"},{"alias_kind":"pith_short_16","alias_value":"MHFEI5HEL2K67XNU","created_at":"2026-05-20T00:04:36.087922+00:00"},{"alias_kind":"pith_short_8","alias_value":"MHFEI5HE","created_at":"2026-05-20T00:04:36.087922+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/MHFEI5HEL2K67XNUHXBIPMIN56","json":"https://pith.science/pith/MHFEI5HEL2K67XNUHXBIPMIN56.json","graph_json":"https://pith.science/api/pith-number/MHFEI5HEL2K67XNUHXBIPMIN56/graph.json","events_json":"https://pith.science/api/pith-number/MHFEI5HEL2K67XNUHXBIPMIN56/events.json","paper":"https://pith.science/paper/MHFEI5HE"},"agent_actions":{"view_html":"https://pith.science/pith/MHFEI5HEL2K67XNUHXBIPMIN56","download_json":"https://pith.science/pith/MHFEI5HEL2K67XNUHXBIPMIN56.json","view_paper":"https://pith.science/paper/MHFEI5HE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.11567&json=true","fetch_graph":"https://pith.science/api/pith-number/MHFEI5HEL2K67XNUHXBIPMIN56/graph.json","fetch_events":"https://pith.science/api/pith-number/MHFEI5HEL2K67XNUHXBIPMIN56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MHFEI5HEL2K67XNUHXBIPMIN56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MHFEI5HEL2K67XNUHXBIPMIN56/action/storage_attestation","attest_author":"https://pith.science/pith/MHFEI5HEL2K67XNUHXBIPMIN56/action/author_attestation","sign_citation":"https://pith.science/pith/MHFEI5HEL2K67XNUHXBIPMIN56/action/citation_signature","submit_replication":"https://pith.science/pith/MHFEI5HEL2K67XNUHXBIPMIN56/action/replication_record"}},"created_at":"2026-05-20T00:04:36.087922+00:00","updated_at":"2026-05-20T00:04:36.087922+00:00"}