{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NYANBI7F4HKRHXPN6CBXOPFJHL","short_pith_number":"pith:NYANBI7F","canonical_record":{"source":{"id":"1106.1370","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LO","submitted_at":"2011-06-07T15:06:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4c910ceb4630ea5bf75abc2a65f548d19ba4cc4717999a4c60b221cd916c3ebe","abstract_canon_sha256":"558a320946f78acf3ef92f8cab5c1b2fd71e9bbd4de95515f00332cb0bc16232"},"schema_version":"1.0"},"canonical_sha256":"6e00d0a3e5e1d513ddedf083773ca93ac52964958328a16ae86456631592b196","source":{"kind":"arxiv","id":"1106.1370","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1370","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1370v1","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1370","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"NYANBI7F4HKR","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NYANBI7F4HKRHXPN","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NYANBI7F","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NYANBI7F4HKRHXPN6CBXOPFJHL","target":"record","payload":{"canonical_record":{"source":{"id":"1106.1370","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LO","submitted_at":"2011-06-07T15:06:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4c910ceb4630ea5bf75abc2a65f548d19ba4cc4717999a4c60b221cd916c3ebe","abstract_canon_sha256":"558a320946f78acf3ef92f8cab5c1b2fd71e9bbd4de95515f00332cb0bc16232"},"schema_version":"1.0"},"canonical_sha256":"6e00d0a3e5e1d513ddedf083773ca93ac52964958328a16ae86456631592b196","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:23.841009Z","signature_b64":"U8SiVKi9elTGOe9qYVJugnki6OE5+lE7JUAzJdBCfH3oAmS6Rn80/agyeInAQYpdc0AgbLmT25h9LpFGrCy+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e00d0a3e5e1d513ddedf083773ca93ac52964958328a16ae86456631592b196","last_reissued_at":"2026-05-18T04:20:23.840285Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:23.840285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.1370","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-05-18T04:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o4XO3KVTLVNTfVEphwynryKQ8ow4m6pViBQ6+i++MSfw/lasCwFgcfRVgN0EFC04qvZSRFIUT1pXr5QcRhzLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T22:18:03.954264Z"},"content_sha256":"d0324386294f8a23f85fe15b145ca5555d6a5dee9873728ca204c62543e7f9ef","schema_version":"1.0","event_id":"sha256:d0324386294f8a23f85fe15b145ca5555d6a5dee9873728ca204c62543e7f9ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NYANBI7F4HKRHXPN6CBXOPFJHL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Dynamically Propositional Logic Structures in SAT","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Jingchao Chen","submitted_at":"2011-06-07T15:06:41Z","abstract_excerpt":"The 32-bit hwb (hwb-n32 for short) problem is from equivalence checking that arises in combining two circuits computing the hidden weighted bit function. Since 2002, it remains still unsolvable in every SAT competition. This paper focuses on solving problems such as hwb-n32. Generally speaking, modern solvers can detect only XOR, AND, OR and ITE gates. Other non-clausal formulas (propositional logic structures) cannot be detected. To solve the hwb-n32 problem, we extract dynamically some special propositional logic structures, and then use a variant of DPLL-based solvers to solve the subproble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1370","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":""},"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-05-18T04:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GHXfzPKY+ouWCe0tVxzjwY4fKlASQzBsohmnWNCcJGR6CGEl8RtRS6G5IjfW5+rNxYpwuP/AvdR0NXaqwGopAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T22:18:03.954628Z"},"content_sha256":"2b84018c30175f5b8c79000d85880910f77706069b2905440004ac9f99fa442a","schema_version":"1.0","event_id":"sha256:2b84018c30175f5b8c79000d85880910f77706069b2905440004ac9f99fa442a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYANBI7F4HKRHXPN6CBXOPFJHL/bundle.json","state_url":"https://pith.science/pith/NYANBI7F4HKRHXPN6CBXOPFJHL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYANBI7F4HKRHXPN6CBXOPFJHL/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-06-23T22:18:03Z","links":{"resolver":"https://pith.science/pith/NYANBI7F4HKRHXPN6CBXOPFJHL","bundle":"https://pith.science/pith/NYANBI7F4HKRHXPN6CBXOPFJHL/bundle.json","state":"https://pith.science/pith/NYANBI7F4HKRHXPN6CBXOPFJHL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYANBI7F4HKRHXPN6CBXOPFJHL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NYANBI7F4HKRHXPN6CBXOPFJHL","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":"558a320946f78acf3ef92f8cab5c1b2fd71e9bbd4de95515f00332cb0bc16232","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LO","submitted_at":"2011-06-07T15:06:41Z","title_canon_sha256":"4c910ceb4630ea5bf75abc2a65f548d19ba4cc4717999a4c60b221cd916c3ebe"},"schema_version":"1.0","source":{"id":"1106.1370","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1370","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1370v1","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1370","created_at":"2026-05-18T04:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"NYANBI7F4HKR","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NYANBI7F4HKRHXPN","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NYANBI7F","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:2b84018c30175f5b8c79000d85880910f77706069b2905440004ac9f99fa442a","target":"graph","created_at":"2026-05-18T04:20:23Z","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"},"paper":{"abstract_excerpt":"The 32-bit hwb (hwb-n32 for short) problem is from equivalence checking that arises in combining two circuits computing the hidden weighted bit function. Since 2002, it remains still unsolvable in every SAT competition. This paper focuses on solving problems such as hwb-n32. Generally speaking, modern solvers can detect only XOR, AND, OR and ITE gates. Other non-clausal formulas (propositional logic structures) cannot be detected. To solve the hwb-n32 problem, we extract dynamically some special propositional logic structures, and then use a variant of DPLL-based solvers to solve the subproble","authors_text":"Jingchao Chen","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LO","submitted_at":"2011-06-07T15:06:41Z","title":"Exploiting Dynamically Propositional Logic Structures in SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1370","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:d0324386294f8a23f85fe15b145ca5555d6a5dee9873728ca204c62543e7f9ef","target":"record","created_at":"2026-05-18T04:20:23Z","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":"558a320946f78acf3ef92f8cab5c1b2fd71e9bbd4de95515f00332cb0bc16232","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LO","submitted_at":"2011-06-07T15:06:41Z","title_canon_sha256":"4c910ceb4630ea5bf75abc2a65f548d19ba4cc4717999a4c60b221cd916c3ebe"},"schema_version":"1.0","source":{"id":"1106.1370","kind":"arxiv","version":1}},"canonical_sha256":"6e00d0a3e5e1d513ddedf083773ca93ac52964958328a16ae86456631592b196","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e00d0a3e5e1d513ddedf083773ca93ac52964958328a16ae86456631592b196","first_computed_at":"2026-05-18T04:20:23.840285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:23.840285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U8SiVKi9elTGOe9qYVJugnki6OE5+lE7JUAzJdBCfH3oAmS6Rn80/agyeInAQYpdc0AgbLmT25h9LpFGrCy+AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:23.841009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.1370","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0324386294f8a23f85fe15b145ca5555d6a5dee9873728ca204c62543e7f9ef","sha256:2b84018c30175f5b8c79000d85880910f77706069b2905440004ac9f99fa442a"],"state_sha256":"34068c30a1b7ef00453341b5c20e23532a03acb1b26cc185a9dc22a49c3c5e57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Let8FPL5ZeQMGzGFZHYeClkPI+A+99UMJci+WLwAJyz5355yGjxperTY5c8OfIAOa7ix8Sd15/LyIPcgm13bAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T22:18:03.956697Z","bundle_sha256":"9018220479687221c3fd55b81b4a83f865fc568b394a053dde6443b72d95774b"}}