{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KLQOJOPJ24LX2OV7V7NQJAT36M","short_pith_number":"pith:KLQOJOPJ","schema_version":"1.0","canonical_sha256":"52e0e4b9e9d7177d3abfafdb04827bf3079083783a74bccded5ae6e093630c4b","source":{"kind":"arxiv","id":"1711.03243","version":3},"attestation_state":"computed","paper":{"title":"Selecting Representative Examples for Program Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Armando Solar-Lezama, Leslie Pack Kaelbling, Yewen Pu, Zachery Miranda","submitted_at":"2017-11-09T03:38:15Z","abstract_excerpt":"Program synthesis is a class of regression problems where one seeks a solution, in the form of a source-code program, mapping the inputs to their corresponding outputs exactly. Due to its precise and combinatorial nature, program synthesis is commonly formulated as a constraint satisfaction problem, where input-output examples are encoded as constraints and solved with a constraint solver. A key challenge of this formulation is scalability: while constraint solvers work well with a few well-chosen examples, a large set of examples can incur significant overhead in both time and memory. We desc"},"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":"1711.03243","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-09T03:38:15Z","cross_cats_sorted":[],"title_canon_sha256":"f341a3a8cd9ff97274d3e43bb42d389ae71ab6c0f53028c097bee08c14344a98","abstract_canon_sha256":"851b37bbf09a105d1f9febe972fb4218cb2705ba862fef5731f2a965c02e2be0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:00.702547Z","signature_b64":"iLi26VYn6RmBbm5e2RpE5v5ExCgooCHUFFVzGQcoClhDhwlSlQF+f8gOwzQOWZx3M/8Osj7robWUZLVdBuZ4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52e0e4b9e9d7177d3abfafdb04827bf3079083783a74bccded5ae6e093630c4b","last_reissued_at":"2026-05-18T00:14:00.701927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:00.701927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Selecting Representative Examples for Program Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Armando Solar-Lezama, Leslie Pack Kaelbling, Yewen Pu, Zachery Miranda","submitted_at":"2017-11-09T03:38:15Z","abstract_excerpt":"Program synthesis is a class of regression problems where one seeks a solution, in the form of a source-code program, mapping the inputs to their corresponding outputs exactly. Due to its precise and combinatorial nature, program synthesis is commonly formulated as a constraint satisfaction problem, where input-output examples are encoded as constraints and solved with a constraint solver. A key challenge of this formulation is scalability: while constraint solvers work well with a few well-chosen examples, a large set of examples can incur significant overhead in both time and memory. We desc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03243","kind":"arxiv","version":3},"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":"1711.03243","created_at":"2026-05-18T00:14:00.702018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03243v3","created_at":"2026-05-18T00:14:00.702018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03243","created_at":"2026-05-18T00:14:00.702018+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLQOJOPJ24LX","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLQOJOPJ24LX2OV7","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLQOJOPJ","created_at":"2026-05-18T12:31:24.725408+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/KLQOJOPJ24LX2OV7V7NQJAT36M","json":"https://pith.science/pith/KLQOJOPJ24LX2OV7V7NQJAT36M.json","graph_json":"https://pith.science/api/pith-number/KLQOJOPJ24LX2OV7V7NQJAT36M/graph.json","events_json":"https://pith.science/api/pith-number/KLQOJOPJ24LX2OV7V7NQJAT36M/events.json","paper":"https://pith.science/paper/KLQOJOPJ"},"agent_actions":{"view_html":"https://pith.science/pith/KLQOJOPJ24LX2OV7V7NQJAT36M","download_json":"https://pith.science/pith/KLQOJOPJ24LX2OV7V7NQJAT36M.json","view_paper":"https://pith.science/paper/KLQOJOPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03243&json=true","fetch_graph":"https://pith.science/api/pith-number/KLQOJOPJ24LX2OV7V7NQJAT36M/graph.json","fetch_events":"https://pith.science/api/pith-number/KLQOJOPJ24LX2OV7V7NQJAT36M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLQOJOPJ24LX2OV7V7NQJAT36M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLQOJOPJ24LX2OV7V7NQJAT36M/action/storage_attestation","attest_author":"https://pith.science/pith/KLQOJOPJ24LX2OV7V7NQJAT36M/action/author_attestation","sign_citation":"https://pith.science/pith/KLQOJOPJ24LX2OV7V7NQJAT36M/action/citation_signature","submit_replication":"https://pith.science/pith/KLQOJOPJ24LX2OV7V7NQJAT36M/action/replication_record"}},"created_at":"2026-05-18T00:14:00.702018+00:00","updated_at":"2026-05-18T00:14:00.702018+00:00"}