{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:Q6DV2TJMWGSW4OB7RQIVEK7X46","short_pith_number":"pith:Q6DV2TJM","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"},"canonical_sha256":"87875d4d2cb1a56e383f8c11522bf7e7ac4280a4cfdae746a623188410a7cf31","source":{"kind":"arxiv","id":"2203.10452","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.10452","created_at":"2026-07-05T07:06:18Z"},{"alias_kind":"arxiv_version","alias_value":"2203.10452v1","created_at":"2026-07-05T07:06:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.10452","created_at":"2026-07-05T07:06:18Z"},{"alias_kind":"pith_short_12","alias_value":"Q6DV2TJMWGSW","created_at":"2026-07-05T07:06:18Z"},{"alias_kind":"pith_short_16","alias_value":"Q6DV2TJMWGSW4OB7","created_at":"2026-07-05T07:06:18Z"},{"alias_kind":"pith_short_8","alias_value":"Q6DV2TJM","created_at":"2026-07-05T07:06:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:Q6DV2TJMWGSW4OB7RQIVEK7X46","target":"record","payload":{"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"},"canonical_sha256":"87875d4d2cb1a56e383f8c11522bf7e7ac4280a4cfdae746a623188410a7cf31","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"},"source_kind":"arxiv","source_id":"2203.10452","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:06:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K6nHBPUwX8D0TTi+wyeXDrNTQeJlk4Th7Q2nLQa1uKnJPmcNhXi5pVLjHYlsSgxKYKnJD3F8aK//IN2+P4foCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T09:27:42.310623Z"},"content_sha256":"6cecadef7f917fad39d7722190cc506aa742650a61d6e329f54d1acbc0e77da4","schema_version":"1.0","event_id":"sha256:6cecadef7f917fad39d7722190cc506aa742650a61d6e329f54d1acbc0e77da4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:Q6DV2TJMWGSW4OB7RQIVEK7X46","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:06:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xlrof2Xi1N+B6BhAvySjSbQXnZcAAuTh7R+9hxMhwMxdmbR638UDqhYgU6lzcoHEK4FndklXq0ZwEGcHI7oaBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T09:27:42.311475Z"},"content_sha256":"9f19daf22452f0d4aead9cc9b39dcee1393ee1900d84ed5964544e6360039066","schema_version":"1.0","event_id":"sha256:9f19daf22452f0d4aead9cc9b39dcee1393ee1900d84ed5964544e6360039066"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46/bundle.json","state_url":"https://pith.science/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T09:27:42Z","links":{"resolver":"https://pith.science/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46","bundle":"https://pith.science/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46/bundle.json","state":"https://pith.science/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q6DV2TJMWGSW4OB7RQIVEK7X46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:Q6DV2TJMWGSW4OB7RQIVEK7X46","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8d00a2467d1307f3667b8e859ab57dfd924ccf542d50baad7f42e359545e314c","cross_cats_sorted":["cs.PL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-20T04:41:05Z","title_canon_sha256":"5e108ec22ac83b4d51fca6e28accf20165b2fe2becadb9ebe52435efaa36d7bf"},"schema_version":"1.0","source":{"id":"2203.10452","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.10452","created_at":"2026-07-05T07:06:18Z"},{"alias_kind":"arxiv_version","alias_value":"2203.10452v1","created_at":"2026-07-05T07:06:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.10452","created_at":"2026-07-05T07:06:18Z"},{"alias_kind":"pith_short_12","alias_value":"Q6DV2TJMWGSW","created_at":"2026-07-05T07:06:18Z"},{"alias_kind":"pith_short_16","alias_value":"Q6DV2TJMWGSW4OB7","created_at":"2026-07-05T07:06:18Z"},{"alias_kind":"pith_short_8","alias_value":"Q6DV2TJM","created_at":"2026-07-05T07:06:18Z"}],"graph_snapshots":[{"event_id":"sha256:9f19daf22452f0d4aead9cc9b39dcee1393ee1900d84ed5964544e6360039066","target":"graph","created_at":"2026-07-05T07:06:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.10452/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Charles Sutton, Hanjun Dai, Kensen Shi, Kevin Ellis","cross_cats":["cs.PL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-20T04:41:05Z","title":"CrossBeam: Learning to Search in Bottom-Up Program Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.10452","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6cecadef7f917fad39d7722190cc506aa742650a61d6e329f54d1acbc0e77da4","target":"record","created_at":"2026-07-05T07:06:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8d00a2467d1307f3667b8e859ab57dfd924ccf542d50baad7f42e359545e314c","cross_cats_sorted":["cs.PL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-20T04:41:05Z","title_canon_sha256":"5e108ec22ac83b4d51fca6e28accf20165b2fe2becadb9ebe52435efaa36d7bf"},"schema_version":"1.0","source":{"id":"2203.10452","kind":"arxiv","version":1}},"canonical_sha256":"87875d4d2cb1a56e383f8c11522bf7e7ac4280a4cfdae746a623188410a7cf31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87875d4d2cb1a56e383f8c11522bf7e7ac4280a4cfdae746a623188410a7cf31","first_computed_at":"2026-07-05T07:06:18.288302Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:06:18.288302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+X0nv9oBpby6fO0rU/rDSVW2ghrUMr8MNTO6Mo9zNO9ilgAhg29yvlAISFCdpSHpBqG3Sh1GUdTGu8elVyojBw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:06:18.288785Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.10452","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cecadef7f917fad39d7722190cc506aa742650a61d6e329f54d1acbc0e77da4","sha256:9f19daf22452f0d4aead9cc9b39dcee1393ee1900d84ed5964544e6360039066"],"state_sha256":"b4a22c6178af4faa596f03a47f81fffcc8bc96ca45e8021ef95cc597abd6ae09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2KqbZcR16raJ+cVe7QR01ygtC2ZipkfMjE+lvTksRzz4uP2ncfaU0IGaKUwtOTac0MlVZfgkNyUfPS8ZAgIDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T09:27:42.318373Z","bundle_sha256":"c08001d6d8209158c4922da21ead5b5820a4b03d6f213f28e917bdd4b7b48103"}}