{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4LMBTGADTHIRM67PFFPVGHYZ5H","short_pith_number":"pith:4LMBTGAD","schema_version":"1.0","canonical_sha256":"e2d819980399d1167bef295f531f19e9e96f5515492a0a138d55aecfd7960125","source":{"kind":"arxiv","id":"1505.05868","version":1},"attestation_state":"computed","paper":{"title":"Synthesis through Unification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Arjun Radhakrishna, Pavol Cerny, Rajeev Alur","submitted_at":"2015-05-21T19:58:46Z","abstract_excerpt":"Given a specification and a set of candidate programs (program space), the program synthesis problem is to find a candidate program that satisfies the specification. We present the synthesis through unification (STUN) approach, which is an extension of the counter-example guided inductive synthesis (CEGIS) approach. In CEGIS, the synthesizer maintains a subset S of inputs and a candidate program Prog that is correct for S. The synthesizer repeatedly checks if there exists a counter-example input c such that the execution of Prog is incorrect on c. If so, the synthesizer enlarges S to include c"},"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":"1505.05868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-05-21T19:58:46Z","cross_cats_sorted":[],"title_canon_sha256":"04074c9fb96cdb00ea65488b04d19c15e40d25f98a3575d4acd764dbebed5ce4","abstract_canon_sha256":"e1b034a5d39081cb23100b0727e3e930181eff4c2e60d873defc58084937c24c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:53.232601Z","signature_b64":"c1WYzsMAAlNXr1i5tRK6+CGOKJP42SyggC9lFfUXSSaqZVGvw9fnw/fKZict7gObT/0eOrLJZmZjj3nslsByBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2d819980399d1167bef295f531f19e9e96f5515492a0a138d55aecfd7960125","last_reissued_at":"2026-05-18T02:03:53.231943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:53.231943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthesis through Unification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Arjun Radhakrishna, Pavol Cerny, Rajeev Alur","submitted_at":"2015-05-21T19:58:46Z","abstract_excerpt":"Given a specification and a set of candidate programs (program space), the program synthesis problem is to find a candidate program that satisfies the specification. We present the synthesis through unification (STUN) approach, which is an extension of the counter-example guided inductive synthesis (CEGIS) approach. In CEGIS, the synthesizer maintains a subset S of inputs and a candidate program Prog that is correct for S. The synthesizer repeatedly checks if there exists a counter-example input c such that the execution of Prog is incorrect on c. If so, the synthesizer enlarges S to include c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05868","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":"1505.05868","created_at":"2026-05-18T02:03:53.232040+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.05868v1","created_at":"2026-05-18T02:03:53.232040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05868","created_at":"2026-05-18T02:03:53.232040+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LMBTGADTHIR","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LMBTGADTHIRM67P","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LMBTGAD","created_at":"2026-05-18T12:29:05.191682+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/4LMBTGADTHIRM67PFFPVGHYZ5H","json":"https://pith.science/pith/4LMBTGADTHIRM67PFFPVGHYZ5H.json","graph_json":"https://pith.science/api/pith-number/4LMBTGADTHIRM67PFFPVGHYZ5H/graph.json","events_json":"https://pith.science/api/pith-number/4LMBTGADTHIRM67PFFPVGHYZ5H/events.json","paper":"https://pith.science/paper/4LMBTGAD"},"agent_actions":{"view_html":"https://pith.science/pith/4LMBTGADTHIRM67PFFPVGHYZ5H","download_json":"https://pith.science/pith/4LMBTGADTHIRM67PFFPVGHYZ5H.json","view_paper":"https://pith.science/paper/4LMBTGAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.05868&json=true","fetch_graph":"https://pith.science/api/pith-number/4LMBTGADTHIRM67PFFPVGHYZ5H/graph.json","fetch_events":"https://pith.science/api/pith-number/4LMBTGADTHIRM67PFFPVGHYZ5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LMBTGADTHIRM67PFFPVGHYZ5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LMBTGADTHIRM67PFFPVGHYZ5H/action/storage_attestation","attest_author":"https://pith.science/pith/4LMBTGADTHIRM67PFFPVGHYZ5H/action/author_attestation","sign_citation":"https://pith.science/pith/4LMBTGADTHIRM67PFFPVGHYZ5H/action/citation_signature","submit_replication":"https://pith.science/pith/4LMBTGADTHIRM67PFFPVGHYZ5H/action/replication_record"}},"created_at":"2026-05-18T02:03:53.232040+00:00","updated_at":"2026-05-18T02:03:53.232040+00:00"}