{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2DIXXFUNUSVNXU2LK6LYA22U3Y","short_pith_number":"pith:2DIXXFUN","schema_version":"1.0","canonical_sha256":"d0d17b968da4aadbd34b5797806b54de0b50efc9365b9060c1d7cd9e5f2927bb","source":{"kind":"arxiv","id":"2010.01678","version":2},"attestation_state":"computed","paper":{"title":"Optimal Neural Program Synthesis from Multimodal Specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CL","authors_text":"Greg Durrett, Isil Dillig, Qiaochu Chen, Xi Ye","submitted_at":"2020-10-04T20:51:21Z","abstract_excerpt":"Multimodal program synthesis, which leverages different types of user input to synthesize a desired program, is an attractive way to scale program synthesis to challenging settings; however, it requires integrating noisy signals from the user, like natural language, with hard constraints on the program's behavior. This paper proposes an optimal neural synthesis approach where the goal is to find a program that satisfies user-provided constraints while also maximizing the program's score with respect to a neural model. Specifically, we focus on multimodal synthesis tasks in which the user inten"},"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":"2010.01678","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-10-04T20:51:21Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"01662c801beab44d6a060c79f96cc4db254809f66afac0ea1770d22ea66c01ad","abstract_canon_sha256":"38e70ad5f2aff62e6d34fc2277597fa5640fadab2c03372cc2f4e269c8a8f392"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:14:32.683397Z","signature_b64":"k0o4F0+oP1jFeYDfkWP76gLwpLDUiRk5so9YCyn550EGiWeXgU/63yxrCVruGLx6o/QBx/QYUBS0EFP3IKunBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0d17b968da4aadbd34b5797806b54de0b50efc9365b9060c1d7cd9e5f2927bb","last_reissued_at":"2026-07-05T03:14:32.682972Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:14:32.682972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Neural Program Synthesis from Multimodal Specifications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.CL","authors_text":"Greg Durrett, Isil Dillig, Qiaochu Chen, Xi Ye","submitted_at":"2020-10-04T20:51:21Z","abstract_excerpt":"Multimodal program synthesis, which leverages different types of user input to synthesize a desired program, is an attractive way to scale program synthesis to challenging settings; however, it requires integrating noisy signals from the user, like natural language, with hard constraints on the program's behavior. This paper proposes an optimal neural synthesis approach where the goal is to find a program that satisfies user-provided constraints while also maximizing the program's score with respect to a neural model. Specifically, we focus on multimodal synthesis tasks in which the user inten"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.01678","kind":"arxiv","version":2},"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/2010.01678/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":"2010.01678","created_at":"2026-07-05T03:14:32.683036+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.01678v2","created_at":"2026-07-05T03:14:32.683036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.01678","created_at":"2026-07-05T03:14:32.683036+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DIXXFUNUSVN","created_at":"2026-07-05T03:14:32.683036+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DIXXFUNUSVNXU2L","created_at":"2026-07-05T03:14:32.683036+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DIXXFUN","created_at":"2026-07-05T03:14:32.683036+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/2DIXXFUNUSVNXU2LK6LYA22U3Y","json":"https://pith.science/pith/2DIXXFUNUSVNXU2LK6LYA22U3Y.json","graph_json":"https://pith.science/api/pith-number/2DIXXFUNUSVNXU2LK6LYA22U3Y/graph.json","events_json":"https://pith.science/api/pith-number/2DIXXFUNUSVNXU2LK6LYA22U3Y/events.json","paper":"https://pith.science/paper/2DIXXFUN"},"agent_actions":{"view_html":"https://pith.science/pith/2DIXXFUNUSVNXU2LK6LYA22U3Y","download_json":"https://pith.science/pith/2DIXXFUNUSVNXU2LK6LYA22U3Y.json","view_paper":"https://pith.science/paper/2DIXXFUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.01678&json=true","fetch_graph":"https://pith.science/api/pith-number/2DIXXFUNUSVNXU2LK6LYA22U3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/2DIXXFUNUSVNXU2LK6LYA22U3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DIXXFUNUSVNXU2LK6LYA22U3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DIXXFUNUSVNXU2LK6LYA22U3Y/action/storage_attestation","attest_author":"https://pith.science/pith/2DIXXFUNUSVNXU2LK6LYA22U3Y/action/author_attestation","sign_citation":"https://pith.science/pith/2DIXXFUNUSVNXU2LK6LYA22U3Y/action/citation_signature","submit_replication":"https://pith.science/pith/2DIXXFUNUSVNXU2LK6LYA22U3Y/action/replication_record"}},"created_at":"2026-07-05T03:14:32.683036+00:00","updated_at":"2026-07-05T03:14:32.683036+00:00"}