{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QJVMM2JE6D3ZW2MQVSSVG5L4MO","short_pith_number":"pith:QJVMM2JE","schema_version":"1.0","canonical_sha256":"826ac66924f0f79b6990aca553757c638cffe745685fd039dda5054812916909","source":{"kind":"arxiv","id":"2006.10924","version":1},"attestation_state":"computed","paper":{"title":"Neural Program Synthesis with a Differentiable Fixer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Charles Sutton, Matej Balog, Petros Maniatis, Rishabh Singh","submitted_at":"2020-06-19T01:49:46Z","abstract_excerpt":"We present a new program synthesis approach that combines an encoder-decoder based synthesis architecture with a differentiable program fixer. Our approach is inspired from the fact that human developers seldom get their program correct on the first attempt, and perform iterative testing-based program fixing to get to the desired program functionality. Similarly, our approach first learns a distribution over programs conditioned on an encoding of a set of input-output examples, and then iteratively performs fix operations using the differentiable fixer. The fixer takes as input the original ex"},"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":"2006.10924","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-06-19T01:49:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2d09bfb64bdcf1e8ed35d7a2e6623b7452e0c85bb8b1e349e12da5bed7583f25","abstract_canon_sha256":"badb60a42dfb2b08f9277f1db421fe52267d2604f179f1585125e9a813199dea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:26.827910Z","signature_b64":"fqe/0G2a8rd3I4uRefygYslRzxK+aA88Z/5fBGy3kpLv4vETwHRqMpZtNHMawORi2kkqtBsgLqZyee4Z6ZKRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"826ac66924f0f79b6990aca553757c638cffe745685fd039dda5054812916909","last_reissued_at":"2026-07-05T01:11:26.827451Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:26.827451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Program Synthesis with a Differentiable Fixer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Charles Sutton, Matej Balog, Petros Maniatis, Rishabh Singh","submitted_at":"2020-06-19T01:49:46Z","abstract_excerpt":"We present a new program synthesis approach that combines an encoder-decoder based synthesis architecture with a differentiable program fixer. Our approach is inspired from the fact that human developers seldom get their program correct on the first attempt, and perform iterative testing-based program fixing to get to the desired program functionality. Similarly, our approach first learns a distribution over programs conditioned on an encoding of a set of input-output examples, and then iteratively performs fix operations using the differentiable fixer. The fixer takes as input the original ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.10924","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/2006.10924/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":"2006.10924","created_at":"2026-07-05T01:11:26.827503+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.10924v1","created_at":"2026-07-05T01:11:26.827503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.10924","created_at":"2026-07-05T01:11:26.827503+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJVMM2JE6D3Z","created_at":"2026-07-05T01:11:26.827503+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJVMM2JE6D3ZW2MQ","created_at":"2026-07-05T01:11:26.827503+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJVMM2JE","created_at":"2026-07-05T01:11:26.827503+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05188","citing_title":"Latent Programming Horizons in Coding Agents","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QJVMM2JE6D3ZW2MQVSSVG5L4MO","json":"https://pith.science/pith/QJVMM2JE6D3ZW2MQVSSVG5L4MO.json","graph_json":"https://pith.science/api/pith-number/QJVMM2JE6D3ZW2MQVSSVG5L4MO/graph.json","events_json":"https://pith.science/api/pith-number/QJVMM2JE6D3ZW2MQVSSVG5L4MO/events.json","paper":"https://pith.science/paper/QJVMM2JE"},"agent_actions":{"view_html":"https://pith.science/pith/QJVMM2JE6D3ZW2MQVSSVG5L4MO","download_json":"https://pith.science/pith/QJVMM2JE6D3ZW2MQVSSVG5L4MO.json","view_paper":"https://pith.science/paper/QJVMM2JE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.10924&json=true","fetch_graph":"https://pith.science/api/pith-number/QJVMM2JE6D3ZW2MQVSSVG5L4MO/graph.json","fetch_events":"https://pith.science/api/pith-number/QJVMM2JE6D3ZW2MQVSSVG5L4MO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJVMM2JE6D3ZW2MQVSSVG5L4MO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJVMM2JE6D3ZW2MQVSSVG5L4MO/action/storage_attestation","attest_author":"https://pith.science/pith/QJVMM2JE6D3ZW2MQVSSVG5L4MO/action/author_attestation","sign_citation":"https://pith.science/pith/QJVMM2JE6D3ZW2MQVSSVG5L4MO/action/citation_signature","submit_replication":"https://pith.science/pith/QJVMM2JE6D3ZW2MQVSSVG5L4MO/action/replication_record"}},"created_at":"2026-07-05T01:11:26.827503+00:00","updated_at":"2026-07-05T01:11:26.827503+00:00"}