{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GRKH4CGP5VC6YE3TL5DYWXK5UM","short_pith_number":"pith:GRKH4CGP","canonical_record":{"source":{"id":"2505.10749","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-05-15T23:23:31Z","cross_cats_sorted":[],"title_canon_sha256":"0176d73341fa9b9066ca371d8cb89b5b7a8243dc45c1ab22a94d35025c69eab4","abstract_canon_sha256":"51b19eb0bdc83cbb726c402045b4a2721cf260b0e9fa1401c369398657321d38"},"schema_version":"1.0"},"canonical_sha256":"34547e08cfed45ec13735f478b5d5da312dcdb06f4db23d3c0d180e81bbd9a80","source":{"kind":"arxiv","id":"2505.10749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.10749","created_at":"2026-07-05T11:04:04Z"},{"alias_kind":"arxiv_version","alias_value":"2505.10749v1","created_at":"2026-07-05T11:04:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10749","created_at":"2026-07-05T11:04:04Z"},{"alias_kind":"pith_short_12","alias_value":"GRKH4CGP5VC6","created_at":"2026-07-05T11:04:04Z"},{"alias_kind":"pith_short_16","alias_value":"GRKH4CGP5VC6YE3T","created_at":"2026-07-05T11:04:04Z"},{"alias_kind":"pith_short_8","alias_value":"GRKH4CGP","created_at":"2026-07-05T11:04:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GRKH4CGP5VC6YE3TL5DYWXK5UM","target":"record","payload":{"canonical_record":{"source":{"id":"2505.10749","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-05-15T23:23:31Z","cross_cats_sorted":[],"title_canon_sha256":"0176d73341fa9b9066ca371d8cb89b5b7a8243dc45c1ab22a94d35025c69eab4","abstract_canon_sha256":"51b19eb0bdc83cbb726c402045b4a2721cf260b0e9fa1401c369398657321d38"},"schema_version":"1.0"},"canonical_sha256":"34547e08cfed45ec13735f478b5d5da312dcdb06f4db23d3c0d180e81bbd9a80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:04.868959Z","signature_b64":"yXv8cmLYjN2EP9vDTDtx9rWNJimLN5VqS93Upau29XMZWHgzGOww9dzcDfT0kreoC9NQ8CKhaWTKNYM2rdT5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34547e08cfed45ec13735f478b5d5da312dcdb06f4db23d3c0d180e81bbd9a80","last_reissued_at":"2026-07-05T11:04:04.868486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:04.868486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.10749","source_version":1,"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-07-05T11:04:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1aNmr67y1jCyN1o1tkPD+vrt/f9SjijRYM2nGcRkoMRERnonHS/3YKuLdnpOFTcvEJnYygSgzy1xid6/liq1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:57:06.179749Z"},"content_sha256":"2b27e27591d9f48a8c29254825a243fb6af760c88b24f343d58805837b5f86c1","schema_version":"1.0","event_id":"sha256:2b27e27591d9f48a8c29254825a243fb6af760c88b24f343d58805837b5f86c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GRKH4CGP5VC6YE3TL5DYWXK5UM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Code-Driven Planning in Grid Worlds with Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ashwath Vaithinathan Aravindan, Mayank Kejriwal, Zhisheng Tang","submitted_at":"2025-05-15T23:23:31Z","abstract_excerpt":"We propose an iterative programmatic planning (IPP) framework for solving grid-based tasks by synthesizing interpretable agent policies expressed in code using large language models (LLMs). Instead of relying on traditional search or reinforcement learning, our approach uses code generation as policy synthesis, where the LLM outputs executable programs that map environment states to action sequences. Our proposed architecture incorporates several prompting strategies, including direct code generation, pseudocode-conditioned refinement, and curriculum-based prompting, but also includes an itera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10749","kind":"arxiv","version":1},"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/2505.10749/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:04:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O8oPJpfxCWalz+u5rz615M0kbQ89Z3BrH9bWy7FL83d65Ixv0yf0XeRXc2xQ3RTlit2oEmKoPEyjac2daE3BBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T12:57:06.180182Z"},"content_sha256":"bd0677652c4f6b891ce50629f92906ed92be899e52ba8ca673c5d40c03f97473","schema_version":"1.0","event_id":"sha256:bd0677652c4f6b891ce50629f92906ed92be899e52ba8ca673c5d40c03f97473"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRKH4CGP5VC6YE3TL5DYWXK5UM/bundle.json","state_url":"https://pith.science/pith/GRKH4CGP5VC6YE3TL5DYWXK5UM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRKH4CGP5VC6YE3TL5DYWXK5UM/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-08-17T12:57:06Z","links":{"resolver":"https://pith.science/pith/GRKH4CGP5VC6YE3TL5DYWXK5UM","bundle":"https://pith.science/pith/GRKH4CGP5VC6YE3TL5DYWXK5UM/bundle.json","state":"https://pith.science/pith/GRKH4CGP5VC6YE3TL5DYWXK5UM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRKH4CGP5VC6YE3TL5DYWXK5UM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GRKH4CGP5VC6YE3TL5DYWXK5UM","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":"51b19eb0bdc83cbb726c402045b4a2721cf260b0e9fa1401c369398657321d38","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-05-15T23:23:31Z","title_canon_sha256":"0176d73341fa9b9066ca371d8cb89b5b7a8243dc45c1ab22a94d35025c69eab4"},"schema_version":"1.0","source":{"id":"2505.10749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.10749","created_at":"2026-07-05T11:04:04Z"},{"alias_kind":"arxiv_version","alias_value":"2505.10749v1","created_at":"2026-07-05T11:04:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.10749","created_at":"2026-07-05T11:04:04Z"},{"alias_kind":"pith_short_12","alias_value":"GRKH4CGP5VC6","created_at":"2026-07-05T11:04:04Z"},{"alias_kind":"pith_short_16","alias_value":"GRKH4CGP5VC6YE3T","created_at":"2026-07-05T11:04:04Z"},{"alias_kind":"pith_short_8","alias_value":"GRKH4CGP","created_at":"2026-07-05T11:04:04Z"}],"graph_snapshots":[{"event_id":"sha256:bd0677652c4f6b891ce50629f92906ed92be899e52ba8ca673c5d40c03f97473","target":"graph","created_at":"2026-07-05T11:04:04Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.10749/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose an iterative programmatic planning (IPP) framework for solving grid-based tasks by synthesizing interpretable agent policies expressed in code using large language models (LLMs). Instead of relying on traditional search or reinforcement learning, our approach uses code generation as policy synthesis, where the LLM outputs executable programs that map environment states to action sequences. Our proposed architecture incorporates several prompting strategies, including direct code generation, pseudocode-conditioned refinement, and curriculum-based prompting, but also includes an itera","authors_text":"Ashwath Vaithinathan Aravindan, Mayank Kejriwal, Zhisheng Tang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-05-15T23:23:31Z","title":"Code-Driven Planning in Grid Worlds with Large Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.10749","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2b27e27591d9f48a8c29254825a243fb6af760c88b24f343d58805837b5f86c1","target":"record","created_at":"2026-07-05T11:04:04Z","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":"51b19eb0bdc83cbb726c402045b4a2721cf260b0e9fa1401c369398657321d38","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-05-15T23:23:31Z","title_canon_sha256":"0176d73341fa9b9066ca371d8cb89b5b7a8243dc45c1ab22a94d35025c69eab4"},"schema_version":"1.0","source":{"id":"2505.10749","kind":"arxiv","version":1}},"canonical_sha256":"34547e08cfed45ec13735f478b5d5da312dcdb06f4db23d3c0d180e81bbd9a80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34547e08cfed45ec13735f478b5d5da312dcdb06f4db23d3c0d180e81bbd9a80","first_computed_at":"2026-07-05T11:04:04.868486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:04:04.868486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yXv8cmLYjN2EP9vDTDtx9rWNJimLN5VqS93Upau29XMZWHgzGOww9dzcDfT0kreoC9NQ8CKhaWTKNYM2rdT5Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T11:04:04.868959Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.10749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b27e27591d9f48a8c29254825a243fb6af760c88b24f343d58805837b5f86c1","sha256:bd0677652c4f6b891ce50629f92906ed92be899e52ba8ca673c5d40c03f97473"],"state_sha256":"d2862423ec30a542452346f4379f8a8be7c9b947760d96c342524d8ce87c2867"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3idEIdEHyKS2jJwATLKHkghRRFcRlyUj61lqzmz03ZzesC2FEyqhv8TlQk5k/eBvRPEIKocEJF0xAulJlaRNDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T12:57:06.183333Z","bundle_sha256":"4fe59517aca4e4a05c9be66860444af1cd9d8b31b17f96150a92dbd9475aeae3"}}