{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QBVICSAO2TNJH2FMIQSUOZTJKJ","short_pith_number":"pith:QBVICSAO","schema_version":"1.0","canonical_sha256":"806a81480ed4da93e8ac4425476669525ac7c97883aee8d8d9258a0e3c73f47b","source":{"kind":"arxiv","id":"2408.15822","version":1},"attestation_state":"computed","paper":{"title":"Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keith J. C. Johnson, Loris D'Antoni, Rahul Krishnan, Thomas Reps","submitted_at":"2024-08-28T14:34:34Z","abstract_excerpt":"In top-down enumeration for program synthesis, abstraction-based pruning uses an abstract domain to approximate the set of possible values that a partial program, when completed, can output on a given input. If the set does not contain the desired output, the partial program and all its possible completions can be pruned. In its general form, abstraction-based pruning requires manually designed, domain-specific abstract domains and semantics, and thus has only been used in domain-specific synthesizers.\n  This paper provides sufficient conditions under which a form of abstraction-based pruning "},"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":"2408.15822","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2024-08-28T14:34:34Z","cross_cats_sorted":[],"title_canon_sha256":"b99e020cf70ef714c60f52423f9e904285c82c2f8be9519879a3d5c8b0e779d4","abstract_canon_sha256":"b37e57ec84827951aae9f41a6ffdf40f46bada3b35d320c4fe7dc4c5b3de94ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:00:18.196442Z","signature_b64":"okAImjcS/FVE5/au2ORlI5LjdWileM25b/26iU+vf6uUvRa9WCkTVBpcXt3ANfLtFs7Z/wAYug11ktbOATGJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"806a81480ed4da93e8ac4425476669525ac7c97883aee8d8d9258a0e3c73f47b","last_reissued_at":"2026-07-05T09:00:18.195919Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:00:18.195919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automating Pruning in Top-Down Enumeration for Program Synthesis Problems with Monotonic Semantics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keith J. C. Johnson, Loris D'Antoni, Rahul Krishnan, Thomas Reps","submitted_at":"2024-08-28T14:34:34Z","abstract_excerpt":"In top-down enumeration for program synthesis, abstraction-based pruning uses an abstract domain to approximate the set of possible values that a partial program, when completed, can output on a given input. If the set does not contain the desired output, the partial program and all its possible completions can be pruned. In its general form, abstraction-based pruning requires manually designed, domain-specific abstract domains and semantics, and thus has only been used in domain-specific synthesizers.\n  This paper provides sufficient conditions under which a form of abstraction-based pruning "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.15822","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.15822/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":"2408.15822","created_at":"2026-07-05T09:00:18.195984+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.15822v1","created_at":"2026-07-05T09:00:18.195984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.15822","created_at":"2026-07-05T09:00:18.195984+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBVICSAO2TNJ","created_at":"2026-07-05T09:00:18.195984+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBVICSAO2TNJH2FM","created_at":"2026-07-05T09:00:18.195984+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBVICSAO","created_at":"2026-07-05T09:00:18.195984+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/QBVICSAO2TNJH2FMIQSUOZTJKJ","json":"https://pith.science/pith/QBVICSAO2TNJH2FMIQSUOZTJKJ.json","graph_json":"https://pith.science/api/pith-number/QBVICSAO2TNJH2FMIQSUOZTJKJ/graph.json","events_json":"https://pith.science/api/pith-number/QBVICSAO2TNJH2FMIQSUOZTJKJ/events.json","paper":"https://pith.science/paper/QBVICSAO"},"agent_actions":{"view_html":"https://pith.science/pith/QBVICSAO2TNJH2FMIQSUOZTJKJ","download_json":"https://pith.science/pith/QBVICSAO2TNJH2FMIQSUOZTJKJ.json","view_paper":"https://pith.science/paper/QBVICSAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.15822&json=true","fetch_graph":"https://pith.science/api/pith-number/QBVICSAO2TNJH2FMIQSUOZTJKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/QBVICSAO2TNJH2FMIQSUOZTJKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBVICSAO2TNJH2FMIQSUOZTJKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBVICSAO2TNJH2FMIQSUOZTJKJ/action/storage_attestation","attest_author":"https://pith.science/pith/QBVICSAO2TNJH2FMIQSUOZTJKJ/action/author_attestation","sign_citation":"https://pith.science/pith/QBVICSAO2TNJH2FMIQSUOZTJKJ/action/citation_signature","submit_replication":"https://pith.science/pith/QBVICSAO2TNJH2FMIQSUOZTJKJ/action/replication_record"}},"created_at":"2026-07-05T09:00:18.195984+00:00","updated_at":"2026-07-05T09:00:18.195984+00:00"}