{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:Q6DV2TJMWGSW4OB7RQIVEK7X46","short_pith_number":"pith:Q6DV2TJM","schema_version":"1.0","canonical_sha256":"87875d4d2cb1a56e383f8c11522bf7e7ac4280a4cfdae746a623188410a7cf31","source":{"kind":"arxiv","id":"2203.10452","version":1},"attestation_state":"computed","paper":{"title":"CrossBeam: Learning to Search in Bottom-Up Program Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Charles Sutton, Hanjun Dai, Kensen Shi, Kevin Ellis","submitted_at":"2022-03-20T04:41:05Z","abstract_excerpt":"Many approaches to program synthesis perform a search within an enormous space of programs to find one that satisfies a given specification. Prior works have used neural models to guide combinatorial search algorithms, but such approaches still explore a huge portion of the search space and quickly become intractable as the size of the desired program increases. To tame the search space blowup, we propose training a neural model to learn a hands-on search policy for bottom-up synthesis, instead of relying on a combinatorial search algorithm. Our approach, called CrossBeam, uses the neural mode"},"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":"2203.10452","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-20T04:41:05Z","cross_cats_sorted":["cs.PL","stat.ML"],"title_canon_sha256":"5e108ec22ac83b4d51fca6e28accf20165b2fe2becadb9ebe52435efaa36d7bf","abstract_canon_sha256":"8d00a2467d1307f3667b8e859ab57dfd924ccf542d50baad7f42e359545e314c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:06:18.288785Z","signature_b64":"+X0nv9oBpby6fO0rU/rDSVW2ghrUMr8MNTO6Mo9zNO9ilgAhg29yvlAISFCdpSHpBqG3Sh1GUdTGu8elVyojBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87875d4d2cb1a56e383f8c11522bf7e7ac4280a4cfdae746a623188410a7cf31","last_reissued_at":"2026-07-05T07:06:18.288302Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:06:18.288302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CrossBeam: Learning to Search in Bottom-Up Program Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Charles Sutton, Hanjun Dai, Kensen Shi, Kevin Ellis","submitted_at":"2022-03-20T04:41:05Z","abstract_excerpt":"Many approaches to program synthesis perform a search within an enormous space of programs to find one that satisfies a given specification. Prior works have used neural models to guide combinatorial search algorithms, but such approaches still explore a huge portion of the search space and quickly become intractable as the size of the desired program increases. To tame the search space blowup, we propose training a neural model to learn a hands-on search policy for bottom-up synthesis, instead of relying on a combinatorial search algorithm. Our approach, called CrossBeam, uses the neural mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.10452","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/2203.10452/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":"2203.10452","created_at":"2026-07-05T07:06:18.288374+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.10452v1","created_at":"2026-07-05T07:06:18.288374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.10452","created_at":"2026-07-05T07:06:18.288374+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q6DV2TJMWGSW","created_at":"2026-07-05T07:06:18.288374+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q6DV2TJMWGSW4OB7","created_at":"2026-07-05T07:06:18.288374+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q6DV2TJM","created_at":"2026-07-05T07:06:18.288374+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.19705","citing_title":"Guided Tensor Lifting","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46","json":"https://pith.science/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46.json","graph_json":"https://pith.science/api/pith-number/Q6DV2TJMWGSW4OB7RQIVEK7X46/graph.json","events_json":"https://pith.science/api/pith-number/Q6DV2TJMWGSW4OB7RQIVEK7X46/events.json","paper":"https://pith.science/paper/Q6DV2TJM"},"agent_actions":{"view_html":"https://pith.science/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46","download_json":"https://pith.science/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46.json","view_paper":"https://pith.science/paper/Q6DV2TJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.10452&json=true","fetch_graph":"https://pith.science/api/pith-number/Q6DV2TJMWGSW4OB7RQIVEK7X46/graph.json","fetch_events":"https://pith.science/api/pith-number/Q6DV2TJMWGSW4OB7RQIVEK7X46/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46/action/storage_attestation","attest_author":"https://pith.science/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46/action/author_attestation","sign_citation":"https://pith.science/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46/action/citation_signature","submit_replication":"https://pith.science/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46/action/replication_record"}},"created_at":"2026-07-05T07:06:18.288374+00:00","updated_at":"2026-07-05T07:06:18.288374+00:00"}