{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MMG34ZOSSXMGWVH7ZX7Z6KVASA","short_pith_number":"pith:MMG34ZOS","schema_version":"1.0","canonical_sha256":"630dbe65d295d86b54ffcdff9f2aa09022d6fcd9bb22fbf88fe6e771f5395392","source":{"kind":"arxiv","id":"1702.06334","version":2},"attestation_state":"computed","paper":{"title":"Synthesizing Imperative Programs from Examples Guided by Static Analysis","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.PL","authors_text":"Hakjoo Oh, Sunbeom So","submitted_at":"2017-02-21T11:29:28Z","abstract_excerpt":"We present a novel algorithm that synthesizes imperative programs for introductory programming courses. Given a set of input-output examples and a partial program, our algorithm generates a complete program that is consistent with every example. Our key idea is to combine enumerative program synthesis and static analysis, which aggressively prunes out a large search space while guaranteeing to find, if any, a correct solution. We have implemented our algorithm in a tool, called SIMPL, and evaluated it on 30 problems used in introductory programming courses. The results show that SIMPL is able "},"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":"1702.06334","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.PL","submitted_at":"2017-02-21T11:29:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c43a05bc92a48856028493d7942d39f0af330c0db55278cf254bfbb165cb40bd","abstract_canon_sha256":"355bebff962a09175ac59fc884544a1ffe04c4a8e1273127c90400d498dfe84a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:29.662271Z","signature_b64":"6jsfCT/BD/HTTqvuOS+/mHL5AO317RL1BEkxobQSX3I5wtjQysku9ERamUfOApDOJkpE7icJEYn9reJdda5kDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"630dbe65d295d86b54ffcdff9f2aa09022d6fcd9bb22fbf88fe6e771f5395392","last_reissued_at":"2026-05-18T00:42:29.661819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:29.661819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthesizing Imperative Programs from Examples Guided by Static Analysis","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.PL","authors_text":"Hakjoo Oh, Sunbeom So","submitted_at":"2017-02-21T11:29:28Z","abstract_excerpt":"We present a novel algorithm that synthesizes imperative programs for introductory programming courses. Given a set of input-output examples and a partial program, our algorithm generates a complete program that is consistent with every example. Our key idea is to combine enumerative program synthesis and static analysis, which aggressively prunes out a large search space while guaranteeing to find, if any, a correct solution. We have implemented our algorithm in a tool, called SIMPL, and evaluated it on 30 problems used in introductory programming courses. The results show that SIMPL is able "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06334","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":""},"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":"1702.06334","created_at":"2026-05-18T00:42:29.661887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06334v2","created_at":"2026-05-18T00:42:29.661887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06334","created_at":"2026-05-18T00:42:29.661887+00:00"},{"alias_kind":"pith_short_12","alias_value":"MMG34ZOSSXMG","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MMG34ZOSSXMGWVH7","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MMG34ZOS","created_at":"2026-05-18T12:31:31.346846+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/MMG34ZOSSXMGWVH7ZX7Z6KVASA","json":"https://pith.science/pith/MMG34ZOSSXMGWVH7ZX7Z6KVASA.json","graph_json":"https://pith.science/api/pith-number/MMG34ZOSSXMGWVH7ZX7Z6KVASA/graph.json","events_json":"https://pith.science/api/pith-number/MMG34ZOSSXMGWVH7ZX7Z6KVASA/events.json","paper":"https://pith.science/paper/MMG34ZOS"},"agent_actions":{"view_html":"https://pith.science/pith/MMG34ZOSSXMGWVH7ZX7Z6KVASA","download_json":"https://pith.science/pith/MMG34ZOSSXMGWVH7ZX7Z6KVASA.json","view_paper":"https://pith.science/paper/MMG34ZOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06334&json=true","fetch_graph":"https://pith.science/api/pith-number/MMG34ZOSSXMGWVH7ZX7Z6KVASA/graph.json","fetch_events":"https://pith.science/api/pith-number/MMG34ZOSSXMGWVH7ZX7Z6KVASA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MMG34ZOSSXMGWVH7ZX7Z6KVASA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MMG34ZOSSXMGWVH7ZX7Z6KVASA/action/storage_attestation","attest_author":"https://pith.science/pith/MMG34ZOSSXMGWVH7ZX7Z6KVASA/action/author_attestation","sign_citation":"https://pith.science/pith/MMG34ZOSSXMGWVH7ZX7Z6KVASA/action/citation_signature","submit_replication":"https://pith.science/pith/MMG34ZOSSXMGWVH7ZX7Z6KVASA/action/replication_record"}},"created_at":"2026-05-18T00:42:29.661887+00:00","updated_at":"2026-05-18T00:42:29.661887+00:00"}