{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OUK2IEVM4MWWU4PC6B6XF5N5TA","short_pith_number":"pith:OUK2IEVM","canonical_record":{"source":{"id":"2604.22238","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-04-24T05:27:27Z","cross_cats_sorted":[],"title_canon_sha256":"a4da622b091f8aecb6ce44f63608b06e5d2d13f7348e521d2275ed89d9b76928","abstract_canon_sha256":"3461e6579ac03ee547dfdc08bd43f016980192101bf6b56fef773242c1a18a10"},"schema_version":"1.0"},"canonical_sha256":"7515a412ace32d6a71e2f07d72f5bd980de31fcdf62e3a0be06f543c595d9f07","source":{"kind":"arxiv","id":"2604.22238","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.22238","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"2604.22238v2","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.22238","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"OUK2IEVM4MWW","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"pith_short_16","alias_value":"OUK2IEVM4MWWU4PC","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"pith_short_8","alias_value":"OUK2IEVM","created_at":"2026-06-09T01:05:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OUK2IEVM4MWWU4PC6B6XF5N5TA","target":"record","payload":{"canonical_record":{"source":{"id":"2604.22238","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-04-24T05:27:27Z","cross_cats_sorted":[],"title_canon_sha256":"a4da622b091f8aecb6ce44f63608b06e5d2d13f7348e521d2275ed89d9b76928","abstract_canon_sha256":"3461e6579ac03ee547dfdc08bd43f016980192101bf6b56fef773242c1a18a10"},"schema_version":"1.0"},"canonical_sha256":"7515a412ace32d6a71e2f07d72f5bd980de31fcdf62e3a0be06f543c595d9f07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:17.721298Z","signature_b64":"vlPI3M6eHbXj41k3watgG08h3SLy57VDvL2rkD6STZbr+IkgJTe86EYlH7LUVlJEMZp/yabh1SYZwgZkYJv0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7515a412ace32d6a71e2f07d72f5bd980de31fcdf62e3a0be06f543c595d9f07","last_reissued_at":"2026-06-09T01:05:17.720712Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:17.720712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.22238","source_version":2,"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-06-09T01:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HUwHDdenoQcdYHKB2cOqywqvFsqmQ16Vsw52m1n2mg0vIzvWcQAS+1UTXkVHiU6HXnO0mGpF1PjWpzBjmBufDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T23:36:38.590752Z"},"content_sha256":"83b389e28cd6033e50b4b5a5b567724002b6e69c92e1376f5bd619ba9412a290","schema_version":"1.0","event_id":"sha256:83b389e28cd6033e50b4b5a5b567724002b6e69c92e1376f5bd619ba9412a290"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OUK2IEVM4MWWU4PC6B6XF5N5TA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CodeGraphVLP: Code-as-Planner Meets Semantic-Graph State for Non-Markovian Vision-Language-Action Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"CodeGraphVLP pairs a persistent semantic-graph state with a code planner to succeed more often on non-Markovian robot tasks than standard VLA models.","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Anh Nguyen, Anthony Gunderman, Chase Rainwater, Duy Nguyen, Khoa Vo, Minh Vu, Ngan Le, Nghi D. Q. Bui, Sieu Tran, Taisei Hanyu, Yuki Ikebe","submitted_at":"2026-04-24T05:27:27Z","abstract_excerpt":"Vision-Language-Action (VLA) models promise generalist robot manipulation, but are typically trained and deployed as short-horizon policies that assume the latest observation is sufficient for action reasoning. This assumption breaks in non-Markovian long-horizon tasks, where task-relevant evidence can be occluded or appear only earlier in the trajectory, and where clutter and distractors make fine-grained visual grounding brittle. We present CodeGraphVLP, a hierarchical framework that enables reliable long-horizon manipulation by combining a persistent semantic-graph state with an executable "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"On real-world non-Markovian tasks, CodeGraphVLP improves task completion over strong VLA baselines and history-enabled variants while substantially lowering planning latency compared to VLM-in-the-loop planning.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The semantic-graph state can reliably maintain task-relevant entities and relations under partial observability in cluttered real environments, allowing the code planner to perform accurate progress checks.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"CodeGraphVLP uses a semantic-graph state and executable code planner to enable reliable long-horizon non-Markovian robot manipulation, improving task success and lowering latency over standard VLA baselines.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"CodeGraphVLP pairs a persistent semantic-graph state with a code planner to succeed more often on non-Markovian robot tasks than standard VLA models.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"09fe828855e45a9d9c2c161890c47742bc1522eb56674ccc8fab7a63e9b655f5"},"source":{"id":"2604.22238","kind":"arxiv","version":2},"verdict":{"id":"69089529-7357-4ced-807a-a6354cefc4d8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T11:37:49.770256Z","strongest_claim":"On real-world non-Markovian tasks, CodeGraphVLP improves task completion over strong VLA baselines and history-enabled variants while substantially lowering planning latency compared to VLM-in-the-loop planning.","one_line_summary":"CodeGraphVLP uses a semantic-graph state and executable code planner to enable reliable long-horizon non-Markovian robot manipulation, improving task success and lowering latency over standard VLA baselines.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The semantic-graph state can reliably maintain task-relevant entities and relations under partial observability in cluttered real environments, allowing the code planner to perform accurate progress checks.","pith_extraction_headline":"CodeGraphVLP pairs a persistent semantic-graph state with a code planner to succeed more often on non-Markovian robot tasks than standard VLA models."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.22238/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T11:34:28.423744Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-20T00:12:04.628799Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"85b2985d552e06cbbf0c1dcd1c907c033e7a520a48addd48c89d593eef1fcd1d"},"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"},"verdict_id":"69089529-7357-4ced-807a-a6354cefc4d8"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-09T01:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WrXERboQl2zrHE848vNNj8RfODicYjpy5nAhRbHHRBGB1naVqkKVFow3ZNPL5mC4jNa3og3Gj8idSfSC0S68BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T23:36:38.591233Z"},"content_sha256":"7b69775625ae5bf26ab09b4bf567d826e71a21c507b69675c199b01920c07219","schema_version":"1.0","event_id":"sha256:7b69775625ae5bf26ab09b4bf567d826e71a21c507b69675c199b01920c07219"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA/bundle.json","state_url":"https://pith.science/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA/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-06-27T23:36:38Z","links":{"resolver":"https://pith.science/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA","bundle":"https://pith.science/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA/bundle.json","state":"https://pith.science/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OUK2IEVM4MWWU4PC6B6XF5N5TA","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":"3461e6579ac03ee547dfdc08bd43f016980192101bf6b56fef773242c1a18a10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-04-24T05:27:27Z","title_canon_sha256":"a4da622b091f8aecb6ce44f63608b06e5d2d13f7348e521d2275ed89d9b76928"},"schema_version":"1.0","source":{"id":"2604.22238","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.22238","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"2604.22238v2","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.22238","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"OUK2IEVM4MWW","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"pith_short_16","alias_value":"OUK2IEVM4MWWU4PC","created_at":"2026-06-09T01:05:17Z"},{"alias_kind":"pith_short_8","alias_value":"OUK2IEVM","created_at":"2026-06-09T01:05:17Z"}],"graph_snapshots":[{"event_id":"sha256:7b69775625ae5bf26ab09b4bf567d826e71a21c507b69675c199b01920c07219","target":"graph","created_at":"2026-06-09T01:05:17Z","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":"On real-world non-Markovian tasks, CodeGraphVLP improves task completion over strong VLA baselines and history-enabled variants while substantially lowering planning latency compared to VLM-in-the-loop planning."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The semantic-graph state can reliably maintain task-relevant entities and relations under partial observability in cluttered real environments, allowing the code planner to perform accurate progress checks."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"CodeGraphVLP uses a semantic-graph state and executable code planner to enable reliable long-horizon non-Markovian robot manipulation, improving task success and lowering latency over standard VLA baselines."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"CodeGraphVLP pairs a persistent semantic-graph state with a code planner to succeed more often on non-Markovian robot tasks than standard VLA models."}],"snapshot_sha256":"09fe828855e45a9d9c2c161890c47742bc1522eb56674ccc8fab7a63e9b655f5"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T11:34:28.423744Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-20T00:12:04.628799Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.22238/integrity.json","findings":[],"snapshot_sha256":"85b2985d552e06cbbf0c1dcd1c907c033e7a520a48addd48c89d593eef1fcd1d","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Vision-Language-Action (VLA) models promise generalist robot manipulation, but are typically trained and deployed as short-horizon policies that assume the latest observation is sufficient for action reasoning. This assumption breaks in non-Markovian long-horizon tasks, where task-relevant evidence can be occluded or appear only earlier in the trajectory, and where clutter and distractors make fine-grained visual grounding brittle. We present CodeGraphVLP, a hierarchical framework that enables reliable long-horizon manipulation by combining a persistent semantic-graph state with an executable ","authors_text":"Anh Nguyen, Anthony Gunderman, Chase Rainwater, Duy Nguyen, Khoa Vo, Minh Vu, Ngan Le, Nghi D. Q. Bui, Sieu Tran, Taisei Hanyu, Yuki Ikebe","cross_cats":[],"headline":"CodeGraphVLP pairs a persistent semantic-graph state with a code planner to succeed more often on non-Markovian robot tasks than standard VLA models.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-04-24T05:27:27Z","title":"CodeGraphVLP: Code-as-Planner Meets Semantic-Graph State for Non-Markovian Vision-Language-Action Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.22238","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T11:37:49.770256Z","id":"69089529-7357-4ced-807a-a6354cefc4d8","model_set":{"reader":"grok-4.3"},"one_line_summary":"CodeGraphVLP uses a semantic-graph state and executable code planner to enable reliable long-horizon non-Markovian robot manipulation, improving task success and lowering latency over standard VLA baselines.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"CodeGraphVLP pairs a persistent semantic-graph state with a code planner to succeed more often on non-Markovian robot tasks than standard VLA models.","strongest_claim":"On real-world non-Markovian tasks, CodeGraphVLP improves task completion over strong VLA baselines and history-enabled variants while substantially lowering planning latency compared to VLM-in-the-loop planning.","weakest_assumption":"The semantic-graph state can reliably maintain task-relevant entities and relations under partial observability in cluttered real environments, allowing the code planner to perform accurate progress checks."}},"verdict_id":"69089529-7357-4ced-807a-a6354cefc4d8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:83b389e28cd6033e50b4b5a5b567724002b6e69c92e1376f5bd619ba9412a290","target":"record","created_at":"2026-06-09T01:05:17Z","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":"3461e6579ac03ee547dfdc08bd43f016980192101bf6b56fef773242c1a18a10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-04-24T05:27:27Z","title_canon_sha256":"a4da622b091f8aecb6ce44f63608b06e5d2d13f7348e521d2275ed89d9b76928"},"schema_version":"1.0","source":{"id":"2604.22238","kind":"arxiv","version":2}},"canonical_sha256":"7515a412ace32d6a71e2f07d72f5bd980de31fcdf62e3a0be06f543c595d9f07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7515a412ace32d6a71e2f07d72f5bd980de31fcdf62e3a0be06f543c595d9f07","first_computed_at":"2026-06-09T01:05:17.720712Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:17.720712Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vlPI3M6eHbXj41k3watgG08h3SLy57VDvL2rkD6STZbr+IkgJTe86EYlH7LUVlJEMZp/yabh1SYZwgZkYJv0Bg==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:17.721298Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.22238","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83b389e28cd6033e50b4b5a5b567724002b6e69c92e1376f5bd619ba9412a290","sha256:7b69775625ae5bf26ab09b4bf567d826e71a21c507b69675c199b01920c07219"],"state_sha256":"0db8ce164080c4ab89b7a90f537c61e6d21c2e421fc5cb23ebe8ad25535a9fbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PfEc9botulsMYqKWVXP6m1Cser6M/ExgCjP7WAs/ndkZdZee50bXVvKediIRxe5CEvw+9Z7np/zwN4IhUL0+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T23:36:38.593446Z","bundle_sha256":"67cfbb65ffe283a571a5b1a420bdd0a2e4bd12ed57b8849dc8acc04c4dc9f7eb"}}