{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:HA7RGN4QQJ2IX4R2UXLBHDKMOX","short_pith_number":"pith:HA7RGN4Q","schema_version":"1.0","canonical_sha256":"383f13379082748bf23aa5d6138d4c75f847dfcad54ecc66db5f1a2f928314d6","source":{"kind":"arxiv","id":"2112.02969","version":1},"attestation_state":"computed","paper":{"title":"Jigsaw: Large Language Models meet Program Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.SE","authors_text":"Arun Iyer, Nagarajan Natarajan, Naman Jain, Rahul Sharma, Skanda Vaidyanath, Sriram Rajamani, Suresh Parthasarathy","submitted_at":"2021-12-06T12:30:22Z","abstract_excerpt":"Large pre-trained language models such as GPT-3, Codex, and Google's language model are now capable of generating code from natural language specifications of programmer intent. We view these developments with a mixture of optimism and caution. On the optimistic side, such large language models have the potential to improve productivity by providing an automated AI pair programmer for every programmer in the world. On the cautionary side, since these large language models do not understand program semantics, they offer no guarantees about quality of the suggested code. In this paper, we presen"},"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":"2112.02969","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2021-12-06T12:30:22Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"a5ecdccb7edace7ae94f0fcf06d5b8140be58c2a0aa011086c90e97364906668","abstract_canon_sha256":"445a686fc6ca411a483493561ddbe92aa77489eaf4f829080dd43c22b40c7da6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:38:00.016959Z","signature_b64":"7oH6a2E+pSqzY14FYh3qAncA+nBhRyIVpBJN9UYGbvQ9NiROWXhjqtFhgbn0OiktHYpaEoDKTNEdLc9iH669Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"383f13379082748bf23aa5d6138d4c75f847dfcad54ecc66db5f1a2f928314d6","last_reissued_at":"2026-07-05T03:38:00.016473Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:38:00.016473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Jigsaw: Large Language Models meet Program Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.SE","authors_text":"Arun Iyer, Nagarajan Natarajan, Naman Jain, Rahul Sharma, Skanda Vaidyanath, Sriram Rajamani, Suresh Parthasarathy","submitted_at":"2021-12-06T12:30:22Z","abstract_excerpt":"Large pre-trained language models such as GPT-3, Codex, and Google's language model are now capable of generating code from natural language specifications of programmer intent. We view these developments with a mixture of optimism and caution. On the optimistic side, such large language models have the potential to improve productivity by providing an automated AI pair programmer for every programmer in the world. On the cautionary side, since these large language models do not understand program semantics, they offer no guarantees about quality of the suggested code. In this paper, we presen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.02969","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/2112.02969/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2112.02969","created_at":"2026-07-05T03:38:00.016529+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.02969v1","created_at":"2026-07-05T03:38:00.016529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.02969","created_at":"2026-07-05T03:38:00.016529+00:00"},{"alias_kind":"pith_short_12","alias_value":"HA7RGN4QQJ2I","created_at":"2026-07-05T03:38:00.016529+00:00"},{"alias_kind":"pith_short_16","alias_value":"HA7RGN4QQJ2IX4R2","created_at":"2026-07-05T03:38:00.016529+00:00"},{"alias_kind":"pith_short_8","alias_value":"HA7RGN4Q","created_at":"2026-07-05T03:38:00.016529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01061","citing_title":"Agentic generation of verifiable rules for deterministic, self-expanding reaction classification","ref_index":263,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13092","citing_title":"PlanCompiler: A Deterministic Compilation Architecture for Structured Multi-Step LLM Pipelines","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HA7RGN4QQJ2IX4R2UXLBHDKMOX","json":"https://pith.science/pith/HA7RGN4QQJ2IX4R2UXLBHDKMOX.json","graph_json":"https://pith.science/api/pith-number/HA7RGN4QQJ2IX4R2UXLBHDKMOX/graph.json","events_json":"https://pith.science/api/pith-number/HA7RGN4QQJ2IX4R2UXLBHDKMOX/events.json","paper":"https://pith.science/paper/HA7RGN4Q"},"agent_actions":{"view_html":"https://pith.science/pith/HA7RGN4QQJ2IX4R2UXLBHDKMOX","download_json":"https://pith.science/pith/HA7RGN4QQJ2IX4R2UXLBHDKMOX.json","view_paper":"https://pith.science/paper/HA7RGN4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.02969&json=true","fetch_graph":"https://pith.science/api/pith-number/HA7RGN4QQJ2IX4R2UXLBHDKMOX/graph.json","fetch_events":"https://pith.science/api/pith-number/HA7RGN4QQJ2IX4R2UXLBHDKMOX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HA7RGN4QQJ2IX4R2UXLBHDKMOX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HA7RGN4QQJ2IX4R2UXLBHDKMOX/action/storage_attestation","attest_author":"https://pith.science/pith/HA7RGN4QQJ2IX4R2UXLBHDKMOX/action/author_attestation","sign_citation":"https://pith.science/pith/HA7RGN4QQJ2IX4R2UXLBHDKMOX/action/citation_signature","submit_replication":"https://pith.science/pith/HA7RGN4QQJ2IX4R2UXLBHDKMOX/action/replication_record"}},"created_at":"2026-07-05T03:38:00.016529+00:00","updated_at":"2026-07-05T03:38:00.016529+00:00"}