{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OZB7D6Z7ZJ6PNUXYSWE7YX3BOQ","short_pith_number":"pith:OZB7D6Z7","canonical_record":{"source":{"id":"2601.23087","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-01-30T15:36:43Z","cross_cats_sorted":[],"title_canon_sha256":"75666717ccb8cd8ac498d0327249efa5c4b4a08cdaf6d2003864f8edc4f9bb3c","abstract_canon_sha256":"9e14f6549dec4a4a7f90a6315997159984303265202a65c6d40d065b602d4e17"},"schema_version":"1.0"},"canonical_sha256":"7643f1fb3fca7cf6d2f89589fc5f61742d979611e538d806aaa30d488643d484","source":{"kind":"arxiv","id":"2601.23087","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.23087","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"2601.23087v4","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.23087","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"OZB7D6Z7ZJ6P","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"pith_short_16","alias_value":"OZB7D6Z7ZJ6PNUXY","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"pith_short_8","alias_value":"OZB7D6Z7","created_at":"2026-05-20T00:04:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OZB7D6Z7ZJ6PNUXYSWE7YX3BOQ","target":"record","payload":{"canonical_record":{"source":{"id":"2601.23087","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-01-30T15:36:43Z","cross_cats_sorted":[],"title_canon_sha256":"75666717ccb8cd8ac498d0327249efa5c4b4a08cdaf6d2003864f8edc4f9bb3c","abstract_canon_sha256":"9e14f6549dec4a4a7f90a6315997159984303265202a65c6d40d065b602d4e17"},"schema_version":"1.0"},"canonical_sha256":"7643f1fb3fca7cf6d2f89589fc5f61742d979611e538d806aaa30d488643d484","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:23.904994Z","signature_b64":"AnQUNDFJJQauOamHFg8S+v1vUvNzQI7LwqWl4GHDzWBz67BUd0URXfiaHz/k8eF7rv+dl27B4qOn/adbGKbOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7643f1fb3fca7cf6d2f89589fc5f61742d979611e538d806aaa30d488643d484","last_reissued_at":"2026-05-20T00:04:23.904173Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:23.904173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.23087","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hdk2dJv8RfUN9N89v2sntBqCc4M7Pu858r4kAaJAMjMsGL+XpWajlQDcULaqNoSCYM3V2sRN9JulwNBqfLOOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:41:13.744130Z"},"content_sha256":"e165255737ed6980fd4cc1dc2c2fbfa660818ba0565c84685644ccb1c380a2cd","schema_version":"1.0","event_id":"sha256:e165255737ed6980fd4cc1dc2c2fbfa660818ba0565c84685644ccb1c380a2cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OZB7D6Z7ZJ6PNUXYSWE7YX3BOQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CoLA-Flow Policy: Temporally Coherent Imitation Learning via Continuous Latent Action Flow Matching for Robotic Manipulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Performing flow matching inside a continuous latent action space produces near-single-step inference and markedly smoother robotic trajectories than direct action-space methods.","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jiang Zhiduo, Liu Hong, Liu Yang, Sun Wandong, Wu Songwei, Xie Guanghu, Zhao Rui","submitted_at":"2026-01-30T15:36:43Z","abstract_excerpt":"Learning long-horizon robotic manipulation requires jointly achieving expressive behavior modeling, real-time inference, and stable execution, which remains challenging for existing generative policies. Diffusion-based approaches offer strong modeling capacity but incur high inference latency, while flow matching enables fast, near-single-step generation yet often suffers from unstable execution when operating directly in the raw action space. We propose Continuous Latent Action Flow Policy (CoLA-Flow Policy), a trajectory-level imitation learning framework that performs flow matching in a con"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"CoLA-Flow Policy achieves near-single-step inference, improves trajectory smoothness by up to 93.7% and task success by up to 25 percentage points over raw action-space flow baselines, while remaining significantly faster than diffusion-based policies.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That mapping action sequences into a continuous latent space and learning an explicit latent flow will reliably separate global motion structure from low-level control noise across varied real-world conditions and sensor modalities.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"CoLA-Flow Policy encodes action sequences into latent trajectories and performs flow matching there, yielding near-single-step inference with up to 93.7% smoother trajectories and 25-point higher success rates than raw-action flow baselines.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Performing flow matching inside a continuous latent action space produces near-single-step inference and markedly smoother robotic trajectories than direct action-space methods.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"61ff2559757420cfdbeb856b37388c4652e99abca0872b5ccd223a3d5770759e"},"source":{"id":"2601.23087","kind":"arxiv","version":4},"verdict":{"id":"37b9ea98-e446-4308-8941-ee8f4584e041","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T09:19:32.024297Z","strongest_claim":"CoLA-Flow Policy achieves near-single-step inference, improves trajectory smoothness by up to 93.7% and task success by up to 25 percentage points over raw action-space flow baselines, while remaining significantly faster than diffusion-based policies.","one_line_summary":"CoLA-Flow Policy encodes action sequences into latent trajectories and performs flow matching there, yielding near-single-step inference with up to 93.7% smoother trajectories and 25-point higher success rates than raw-action flow baselines.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That mapping action sequences into a continuous latent space and learning an explicit latent flow will reliably separate global motion structure from low-level control noise across varied real-world conditions and sensor modalities.","pith_extraction_headline":"Performing flow matching inside a continuous latent action space produces near-single-step inference and markedly smoother robotic trajectories than direct action-space methods."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.23087/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":3,"snapshot_sha256":"a17a8d15a1840ee98955022b2ffd4612c9b6cbe178e2235ec06bcbf4aa80f334"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"37b9ea98-e446-4308-8941-ee8f4584e041"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:04:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wao6yd1EXxitItX44GXmWa6fnlLNYAjkYcLu4JerEV8h/RZHzL4IgTBKIZnsMspMzdjxPJKVRXhGqIEMDlfXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:41:13.744625Z"},"content_sha256":"99c834616b502791842491234436a0ffecda784995c0db15680214af8d6c04ea","schema_version":"1.0","event_id":"sha256:99c834616b502791842491234436a0ffecda784995c0db15680214af8d6c04ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZB7D6Z7ZJ6PNUXYSWE7YX3BOQ/bundle.json","state_url":"https://pith.science/pith/OZB7D6Z7ZJ6PNUXYSWE7YX3BOQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZB7D6Z7ZJ6PNUXYSWE7YX3BOQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T14:41:13Z","links":{"resolver":"https://pith.science/pith/OZB7D6Z7ZJ6PNUXYSWE7YX3BOQ","bundle":"https://pith.science/pith/OZB7D6Z7ZJ6PNUXYSWE7YX3BOQ/bundle.json","state":"https://pith.science/pith/OZB7D6Z7ZJ6PNUXYSWE7YX3BOQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZB7D6Z7ZJ6PNUXYSWE7YX3BOQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OZB7D6Z7ZJ6PNUXYSWE7YX3BOQ","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":"9e14f6549dec4a4a7f90a6315997159984303265202a65c6d40d065b602d4e17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-01-30T15:36:43Z","title_canon_sha256":"75666717ccb8cd8ac498d0327249efa5c4b4a08cdaf6d2003864f8edc4f9bb3c"},"schema_version":"1.0","source":{"id":"2601.23087","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.23087","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"arxiv_version","alias_value":"2601.23087v4","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.23087","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"pith_short_12","alias_value":"OZB7D6Z7ZJ6P","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"pith_short_16","alias_value":"OZB7D6Z7ZJ6PNUXY","created_at":"2026-05-20T00:04:23Z"},{"alias_kind":"pith_short_8","alias_value":"OZB7D6Z7","created_at":"2026-05-20T00:04:23Z"}],"graph_snapshots":[{"event_id":"sha256:99c834616b502791842491234436a0ffecda784995c0db15680214af8d6c04ea","target":"graph","created_at":"2026-05-20T00:04:23Z","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":"CoLA-Flow Policy achieves near-single-step inference, improves trajectory smoothness by up to 93.7% and task success by up to 25 percentage points over raw action-space flow baselines, while remaining significantly faster than diffusion-based policies."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That mapping action sequences into a continuous latent space and learning an explicit latent flow will reliably separate global motion structure from low-level control noise across varied real-world conditions and sensor modalities."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"CoLA-Flow Policy encodes action sequences into latent trajectories and performs flow matching there, yielding near-single-step inference with up to 93.7% smoother trajectories and 25-point higher success rates than raw-action flow baselines."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Performing flow matching inside a continuous latent action space produces near-single-step inference and markedly smoother robotic trajectories than direct action-space methods."}],"snapshot_sha256":"61ff2559757420cfdbeb856b37388c4652e99abca0872b5ccd223a3d5770759e"},"formal_canon":{"evidence_count":3,"snapshot_sha256":"a17a8d15a1840ee98955022b2ffd4612c9b6cbe178e2235ec06bcbf4aa80f334"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2601.23087/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning long-horizon robotic manipulation requires jointly achieving expressive behavior modeling, real-time inference, and stable execution, which remains challenging for existing generative policies. Diffusion-based approaches offer strong modeling capacity but incur high inference latency, while flow matching enables fast, near-single-step generation yet often suffers from unstable execution when operating directly in the raw action space. We propose Continuous Latent Action Flow Policy (CoLA-Flow Policy), a trajectory-level imitation learning framework that performs flow matching in a con","authors_text":"Jiang Zhiduo, Liu Hong, Liu Yang, Sun Wandong, Wu Songwei, Xie Guanghu, Zhao Rui","cross_cats":[],"headline":"Performing flow matching inside a continuous latent action space produces near-single-step inference and markedly smoother robotic trajectories than direct action-space methods.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-01-30T15:36:43Z","title":"CoLA-Flow Policy: Temporally Coherent Imitation Learning via Continuous Latent Action Flow Matching for Robotic Manipulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.23087","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-16T09:19:32.024297Z","id":"37b9ea98-e446-4308-8941-ee8f4584e041","model_set":{"reader":"grok-4.3"},"one_line_summary":"CoLA-Flow Policy encodes action sequences into latent trajectories and performs flow matching there, yielding near-single-step inference with up to 93.7% smoother trajectories and 25-point higher success rates than raw-action flow baselines.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Performing flow matching inside a continuous latent action space produces near-single-step inference and markedly smoother robotic trajectories than direct action-space methods.","strongest_claim":"CoLA-Flow Policy achieves near-single-step inference, improves trajectory smoothness by up to 93.7% and task success by up to 25 percentage points over raw action-space flow baselines, while remaining significantly faster than diffusion-based policies.","weakest_assumption":"That mapping action sequences into a continuous latent space and learning an explicit latent flow will reliably separate global motion structure from low-level control noise across varied real-world conditions and sensor modalities."}},"verdict_id":"37b9ea98-e446-4308-8941-ee8f4584e041"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e165255737ed6980fd4cc1dc2c2fbfa660818ba0565c84685644ccb1c380a2cd","target":"record","created_at":"2026-05-20T00:04:23Z","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":"9e14f6549dec4a4a7f90a6315997159984303265202a65c6d40d065b602d4e17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-01-30T15:36:43Z","title_canon_sha256":"75666717ccb8cd8ac498d0327249efa5c4b4a08cdaf6d2003864f8edc4f9bb3c"},"schema_version":"1.0","source":{"id":"2601.23087","kind":"arxiv","version":4}},"canonical_sha256":"7643f1fb3fca7cf6d2f89589fc5f61742d979611e538d806aaa30d488643d484","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7643f1fb3fca7cf6d2f89589fc5f61742d979611e538d806aaa30d488643d484","first_computed_at":"2026-05-20T00:04:23.904173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:23.904173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AnQUNDFJJQauOamHFg8S+v1vUvNzQI7LwqWl4GHDzWBz67BUd0URXfiaHz/k8eF7rv+dl27B4qOn/adbGKbOBw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:23.904994Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.23087","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e165255737ed6980fd4cc1dc2c2fbfa660818ba0565c84685644ccb1c380a2cd","sha256:99c834616b502791842491234436a0ffecda784995c0db15680214af8d6c04ea"],"state_sha256":"64a8a82366c979f65f750df88107bbf418c0afabf1e2ecfb559869f89585f81e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RI21w8K3qnug3IHJtqXqnzZNRKZxXtGSTZY6yKmeHGcn/85+Pxvfo8/iTX1sz2oNME6EvGN3XvDWx9aoCB2TBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:41:13.746880Z","bundle_sha256":"7f31a8a576640ed07bf4fe4db4d8af67a87b7dbdd9f9869dfad9427c274124f2"}}