{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OUK2IEVM4MWWU4PC6B6XF5N5TA","short_pith_number":"pith:OUK2IEVM","schema_version":"1.0","canonical_sha256":"7515a412ace32d6a71e2f07d72f5bd980de31fcdf62e3a0be06f543c595d9f07","source":{"kind":"arxiv","id":"2604.22238","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2604.22238","created_at":"2026-06-09T01:05:17.720789+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.22238v2","created_at":"2026-06-09T01:05:17.720789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.22238","created_at":"2026-06-09T01:05:17.720789+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUK2IEVM4MWW","created_at":"2026-06-09T01:05:17.720789+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUK2IEVM4MWWU4PC","created_at":"2026-06-09T01:05:17.720789+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUK2IEVM","created_at":"2026-06-09T01:05:17.720789+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/OUK2IEVM4MWWU4PC6B6XF5N5TA","json":"https://pith.science/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA.json","graph_json":"https://pith.science/api/pith-number/OUK2IEVM4MWWU4PC6B6XF5N5TA/graph.json","events_json":"https://pith.science/api/pith-number/OUK2IEVM4MWWU4PC6B6XF5N5TA/events.json","paper":"https://pith.science/paper/OUK2IEVM"},"agent_actions":{"view_html":"https://pith.science/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA","download_json":"https://pith.science/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA.json","view_paper":"https://pith.science/paper/OUK2IEVM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.22238&json=true","fetch_graph":"https://pith.science/api/pith-number/OUK2IEVM4MWWU4PC6B6XF5N5TA/graph.json","fetch_events":"https://pith.science/api/pith-number/OUK2IEVM4MWWU4PC6B6XF5N5TA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA/action/storage_attestation","attest_author":"https://pith.science/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA/action/author_attestation","sign_citation":"https://pith.science/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA/action/citation_signature","submit_replication":"https://pith.science/pith/OUK2IEVM4MWWU4PC6B6XF5N5TA/action/replication_record"}},"created_at":"2026-06-09T01:05:17.720789+00:00","updated_at":"2026-06-09T01:05:17.720789+00:00"}