{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:R4ZHX5CU2N47KR4CLNXR5HOW6B","short_pith_number":"pith:R4ZHX5CU","canonical_record":{"source":{"id":"2205.13745","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-05-27T03:20:42Z","cross_cats_sorted":[],"title_canon_sha256":"075ef523dd087e4beeecccbef048e54ba4d32f745e89ec0fb545389a9abeddc2","abstract_canon_sha256":"928201d7fb33059e8b47aabf55a9d014f43348fbc88d6fc672f031c1f3f91b49"},"schema_version":"1.0"},"canonical_sha256":"8f327bf454d379f547825b6f1e9dd6f074c6cd4e9f5e03ec1583ebe08e893ba1","source":{"kind":"arxiv","id":"2205.13745","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.13745","created_at":"2026-07-05T05:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"2205.13745v2","created_at":"2026-07-05T05:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.13745","created_at":"2026-07-05T05:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"R4ZHX5CU2N47","created_at":"2026-07-05T05:34:31Z"},{"alias_kind":"pith_short_16","alias_value":"R4ZHX5CU2N47KR4C","created_at":"2026-07-05T05:34:31Z"},{"alias_kind":"pith_short_8","alias_value":"R4ZHX5CU","created_at":"2026-07-05T05:34:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:R4ZHX5CU2N47KR4CLNXR5HOW6B","target":"record","payload":{"canonical_record":{"source":{"id":"2205.13745","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-05-27T03:20:42Z","cross_cats_sorted":[],"title_canon_sha256":"075ef523dd087e4beeecccbef048e54ba4d32f745e89ec0fb545389a9abeddc2","abstract_canon_sha256":"928201d7fb33059e8b47aabf55a9d014f43348fbc88d6fc672f031c1f3f91b49"},"schema_version":"1.0"},"canonical_sha256":"8f327bf454d379f547825b6f1e9dd6f074c6cd4e9f5e03ec1583ebe08e893ba1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:34:31.227134Z","signature_b64":"UlfNiHMy4viKpe0QlHPq8N2CDkdG88Aa8XnE/X2S20/A2WdEyiduOODf3E2UhodSl7UyvFbfXEB1rx3lnKLdBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f327bf454d379f547825b6f1e9dd6f074c6cd4e9f5e03ec1583ebe08e893ba1","last_reissued_at":"2026-07-05T05:34:31.226567Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:34:31.226567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.13745","source_version":2,"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-05T05:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EyNemHy18FQTclPVkt3W5dpun5tFD4uih620bIyXOz508AdvqmF80BCxP6QwWtPfeLNabDxNyu8BhrAcW7L9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:10:39.451777Z"},"content_sha256":"d0965a66aff47339c6e43cf33df615f709214d367ee121c2c84f771cad243b6a","schema_version":"1.0","event_id":"sha256:d0965a66aff47339c6e43cf33df615f709214d367ee121c2c84f771cad243b6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:R4ZHX5CU2N47KR4CLNXR5HOW6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DeepSAT: An EDA-Driven Learning Framework for SAT","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Min Li, Qiang Xu, Qiuxia Lai, Sadaf Khan, Shaowei Cai, Zhengyuan Shi","submitted_at":"2022-05-27T03:20:42Z","abstract_excerpt":"We present DeepSAT, a novel end-to-end learning framework for the Boolean satisfiability (SAT) problem. Unlike existing solutions trained on random SAT instances with relatively weak supervision, we propose applying the knowledge of the well-developed electronic design automation (EDA) field for SAT solving. Specifically, we first resort to logic synthesis algorithms to pre-process SAT instances into optimized and-inverter graphs (AIGs). By doing so, the distribution diversity among various SAT instances can be dramatically reduced, which facilitates improving the generalization capability of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.13745","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/2205.13745/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-05T05:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YkU63geNKhdfDQeKNBcpgkQei3h6sfaO4l4jL1lDs+DYSsbbV5S1IjKwRr0vzGWl1yyDlsPimV/kT2WxkEMuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:10:39.452170Z"},"content_sha256":"85884d87cb1596d90ef8817661ce36139ae911b58871ff299ae3cae9a5d634a1","schema_version":"1.0","event_id":"sha256:85884d87cb1596d90ef8817661ce36139ae911b58871ff299ae3cae9a5d634a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B/bundle.json","state_url":"https://pith.science/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B/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-07-07T07:10:39Z","links":{"resolver":"https://pith.science/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B","bundle":"https://pith.science/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B/bundle.json","state":"https://pith.science/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R4ZHX5CU2N47KR4CLNXR5HOW6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:R4ZHX5CU2N47KR4CLNXR5HOW6B","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":"928201d7fb33059e8b47aabf55a9d014f43348fbc88d6fc672f031c1f3f91b49","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-05-27T03:20:42Z","title_canon_sha256":"075ef523dd087e4beeecccbef048e54ba4d32f745e89ec0fb545389a9abeddc2"},"schema_version":"1.0","source":{"id":"2205.13745","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.13745","created_at":"2026-07-05T05:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"2205.13745v2","created_at":"2026-07-05T05:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.13745","created_at":"2026-07-05T05:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"R4ZHX5CU2N47","created_at":"2026-07-05T05:34:31Z"},{"alias_kind":"pith_short_16","alias_value":"R4ZHX5CU2N47KR4C","created_at":"2026-07-05T05:34:31Z"},{"alias_kind":"pith_short_8","alias_value":"R4ZHX5CU","created_at":"2026-07-05T05:34:31Z"}],"graph_snapshots":[{"event_id":"sha256:85884d87cb1596d90ef8817661ce36139ae911b58871ff299ae3cae9a5d634a1","target":"graph","created_at":"2026-07-05T05:34:31Z","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/2205.13745/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present DeepSAT, a novel end-to-end learning framework for the Boolean satisfiability (SAT) problem. Unlike existing solutions trained on random SAT instances with relatively weak supervision, we propose applying the knowledge of the well-developed electronic design automation (EDA) field for SAT solving. Specifically, we first resort to logic synthesis algorithms to pre-process SAT instances into optimized and-inverter graphs (AIGs). By doing so, the distribution diversity among various SAT instances can be dramatically reduced, which facilitates improving the generalization capability of ","authors_text":"Min Li, Qiang Xu, Qiuxia Lai, Sadaf Khan, Shaowei Cai, Zhengyuan Shi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-05-27T03:20:42Z","title":"DeepSAT: An EDA-Driven Learning Framework for SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.13745","kind":"arxiv","version":2},"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:d0965a66aff47339c6e43cf33df615f709214d367ee121c2c84f771cad243b6a","target":"record","created_at":"2026-07-05T05:34:31Z","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":"928201d7fb33059e8b47aabf55a9d014f43348fbc88d6fc672f031c1f3f91b49","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-05-27T03:20:42Z","title_canon_sha256":"075ef523dd087e4beeecccbef048e54ba4d32f745e89ec0fb545389a9abeddc2"},"schema_version":"1.0","source":{"id":"2205.13745","kind":"arxiv","version":2}},"canonical_sha256":"8f327bf454d379f547825b6f1e9dd6f074c6cd4e9f5e03ec1583ebe08e893ba1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f327bf454d379f547825b6f1e9dd6f074c6cd4e9f5e03ec1583ebe08e893ba1","first_computed_at":"2026-07-05T05:34:31.226567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:34:31.226567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UlfNiHMy4viKpe0QlHPq8N2CDkdG88Aa8XnE/X2S20/A2WdEyiduOODf3E2UhodSl7UyvFbfXEB1rx3lnKLdBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:34:31.227134Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.13745","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0965a66aff47339c6e43cf33df615f709214d367ee121c2c84f771cad243b6a","sha256:85884d87cb1596d90ef8817661ce36139ae911b58871ff299ae3cae9a5d634a1"],"state_sha256":"840e480666cdc23e297d896a7dd1f86c15cf899258dfa6b3e734b164b6aa071f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WW2KI2t2gfl4u66WiEXAOF3pdpijmWyr/aGQVtfSgJrAsXgVz1VCy+z0sIYPbsLP2LICyI1VX/vQN7v2TVGtDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:10:39.454499Z","bundle_sha256":"39a51f6f885eaa592885ea51ecc43662f958456dc95bb409016f7426cabf08eb"}}