{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AFGIUVM6SYTRZKMGFSAEKWLVAT","short_pith_number":"pith:AFGIUVM6","schema_version":"1.0","canonical_sha256":"014c8a559e96271ca9862c8045597504f8d37c0d1626a6f3c8185c7d45616a8c","source":{"kind":"arxiv","id":"2301.03094","version":2},"attestation_state":"computed","paper":{"title":"A Divide-Align-Conquer Strategy for Program Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Claus-Christian Carbon, Jonas Witt, Sebastijan Duman\\v{c}i\\'c, Tias Guns","submitted_at":"2023-01-08T19:10:55Z","abstract_excerpt":"A major bottleneck in search-based program synthesis is the exponentially growing search space which makes learning large programs intractable. Humans mitigate this problem by leveraging the compositional nature of the real world: In structured domains, a logical specification can often be decomposed into smaller, complementary solution programs. We show that compositional segmentation can be applied in the programming by examples setting to divide the search for large programs across multiple smaller program synthesis problems. For each example, we search for a decomposition into smaller unit"},"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":"2301.03094","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2023-01-08T19:10:55Z","cross_cats_sorted":[],"title_canon_sha256":"20478a51f0c396459b4d61f13f7bfbc37b27e647155f412cb9850ea2a5033262","abstract_canon_sha256":"9b0fa8f1d1c48b27bf901c4f4e7dc6a639d29a81ba1ac2d98aa880f352162478"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:37.970021Z","signature_b64":"Zb/HzkwGvwtC+Hd9mF3s0nysG+MNbL8h/anoUt9MyyimvC2VRzygUdOht7/glv/iORi2y94Op+12+N1iulC3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"014c8a559e96271ca9862c8045597504f8d37c0d1626a6f3c8185c7d45616a8c","last_reissued_at":"2026-07-05T09:53:37.969438Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:37.969438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Divide-Align-Conquer Strategy for Program Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Claus-Christian Carbon, Jonas Witt, Sebastijan Duman\\v{c}i\\'c, Tias Guns","submitted_at":"2023-01-08T19:10:55Z","abstract_excerpt":"A major bottleneck in search-based program synthesis is the exponentially growing search space which makes learning large programs intractable. Humans mitigate this problem by leveraging the compositional nature of the real world: In structured domains, a logical specification can often be decomposed into smaller, complementary solution programs. We show that compositional segmentation can be applied in the programming by examples setting to divide the search for large programs across multiple smaller program synthesis problems. For each example, we search for a decomposition into smaller unit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.03094","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.03094/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":"2301.03094","created_at":"2026-07-05T09:53:37.969509+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.03094v2","created_at":"2026-07-05T09:53:37.969509+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.03094","created_at":"2026-07-05T09:53:37.969509+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFGIUVM6SYTR","created_at":"2026-07-05T09:53:37.969509+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFGIUVM6SYTRZKMG","created_at":"2026-07-05T09:53:37.969509+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFGIUVM6","created_at":"2026-07-05T09:53:37.969509+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03461","citing_title":"Solver-Aware Decompositions for Programming-by-Example: When Dividing Requires Knowing how to Conquer","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AFGIUVM6SYTRZKMGFSAEKWLVAT","json":"https://pith.science/pith/AFGIUVM6SYTRZKMGFSAEKWLVAT.json","graph_json":"https://pith.science/api/pith-number/AFGIUVM6SYTRZKMGFSAEKWLVAT/graph.json","events_json":"https://pith.science/api/pith-number/AFGIUVM6SYTRZKMGFSAEKWLVAT/events.json","paper":"https://pith.science/paper/AFGIUVM6"},"agent_actions":{"view_html":"https://pith.science/pith/AFGIUVM6SYTRZKMGFSAEKWLVAT","download_json":"https://pith.science/pith/AFGIUVM6SYTRZKMGFSAEKWLVAT.json","view_paper":"https://pith.science/paper/AFGIUVM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.03094&json=true","fetch_graph":"https://pith.science/api/pith-number/AFGIUVM6SYTRZKMGFSAEKWLVAT/graph.json","fetch_events":"https://pith.science/api/pith-number/AFGIUVM6SYTRZKMGFSAEKWLVAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFGIUVM6SYTRZKMGFSAEKWLVAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFGIUVM6SYTRZKMGFSAEKWLVAT/action/storage_attestation","attest_author":"https://pith.science/pith/AFGIUVM6SYTRZKMGFSAEKWLVAT/action/author_attestation","sign_citation":"https://pith.science/pith/AFGIUVM6SYTRZKMGFSAEKWLVAT/action/citation_signature","submit_replication":"https://pith.science/pith/AFGIUVM6SYTRZKMGFSAEKWLVAT/action/replication_record"}},"created_at":"2026-07-05T09:53:37.969509+00:00","updated_at":"2026-07-05T09:53:37.969509+00:00"}