{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A5RNO7USKCUSDSYGNAOVIORB35","short_pith_number":"pith:A5RNO7US","schema_version":"1.0","canonical_sha256":"0762d77e9250a921cb06681d543a21df52829d339fde3bf278b96425820334b7","source":{"kind":"arxiv","id":"1802.07608","version":1},"attestation_state":"computed","paper":{"title":"Learning to Synthesize","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Bo Wang, Guirong Fu, Linfei Zang, Yingfei Xiong","submitted_at":"2018-02-21T15:14:31Z","abstract_excerpt":"In many scenarios we need to find the most likely program under a local context, where the local context can be an incomplete program, a partial specification, natural language description, etc. We call such problem program estimation. In this paper we propose an abstract framework, learning to synthesis, or L2S in short, to address this problem. L2S combines four tools to achieve this: syntax is used to define the search space and search steps, constraints are used to prune off invalid candidates at each search step, machine-learned models are used to estimate conditional probabilities for th"},"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":"1802.07608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-02-21T15:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"468c295fd896f81650e78a98011ba6142f543973c359b05c9953b5f05216ef32","abstract_canon_sha256":"c22d42164a525621515938f0663e34f86356997b79eea5315b491c2485a1bbf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:49.812604Z","signature_b64":"/TfxXGx+/KyYO1aCHW4qf4y6UASXA/PDioBVGKo75YHAIx8PCmIx5sch075Y931KfQdYq8fWvNyOZRkiIKLqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0762d77e9250a921cb06681d543a21df52829d339fde3bf278b96425820334b7","last_reissued_at":"2026-05-18T00:22:49.812099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:49.812099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Synthesize","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Bo Wang, Guirong Fu, Linfei Zang, Yingfei Xiong","submitted_at":"2018-02-21T15:14:31Z","abstract_excerpt":"In many scenarios we need to find the most likely program under a local context, where the local context can be an incomplete program, a partial specification, natural language description, etc. We call such problem program estimation. In this paper we propose an abstract framework, learning to synthesis, or L2S in short, to address this problem. L2S combines four tools to achieve this: syntax is used to define the search space and search steps, constraints are used to prune off invalid candidates at each search step, machine-learned models are used to estimate conditional probabilities for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07608","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":""},"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":"1802.07608","created_at":"2026-05-18T00:22:49.812174+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07608v1","created_at":"2026-05-18T00:22:49.812174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07608","created_at":"2026-05-18T00:22:49.812174+00:00"},{"alias_kind":"pith_short_12","alias_value":"A5RNO7USKCUS","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A5RNO7USKCUSDSYG","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A5RNO7US","created_at":"2026-05-18T12:32:13.499390+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/A5RNO7USKCUSDSYGNAOVIORB35","json":"https://pith.science/pith/A5RNO7USKCUSDSYGNAOVIORB35.json","graph_json":"https://pith.science/api/pith-number/A5RNO7USKCUSDSYGNAOVIORB35/graph.json","events_json":"https://pith.science/api/pith-number/A5RNO7USKCUSDSYGNAOVIORB35/events.json","paper":"https://pith.science/paper/A5RNO7US"},"agent_actions":{"view_html":"https://pith.science/pith/A5RNO7USKCUSDSYGNAOVIORB35","download_json":"https://pith.science/pith/A5RNO7USKCUSDSYGNAOVIORB35.json","view_paper":"https://pith.science/paper/A5RNO7US","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07608&json=true","fetch_graph":"https://pith.science/api/pith-number/A5RNO7USKCUSDSYGNAOVIORB35/graph.json","fetch_events":"https://pith.science/api/pith-number/A5RNO7USKCUSDSYGNAOVIORB35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A5RNO7USKCUSDSYGNAOVIORB35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A5RNO7USKCUSDSYGNAOVIORB35/action/storage_attestation","attest_author":"https://pith.science/pith/A5RNO7USKCUSDSYGNAOVIORB35/action/author_attestation","sign_citation":"https://pith.science/pith/A5RNO7USKCUSDSYGNAOVIORB35/action/citation_signature","submit_replication":"https://pith.science/pith/A5RNO7USKCUSDSYGNAOVIORB35/action/replication_record"}},"created_at":"2026-05-18T00:22:49.812174+00:00","updated_at":"2026-05-18T00:22:49.812174+00:00"}