{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EDWYXR2NF6U36ZUH4AJ5MAH67T","short_pith_number":"pith:EDWYXR2N","canonical_record":{"source":{"id":"1710.11204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-30T19:13:28Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"9a32b4463a878501fa164a881d832b8240f2fb5671447e8848c482fc4e21ca6b","abstract_canon_sha256":"882eb0100f80ba50d3eafd70bae0fd4e783e275c3ff8ebe1c312d25aaa566985"},"schema_version":"1.0"},"canonical_sha256":"20ed8bc74d2fa9bf6687e013d600fefcc4c9824921a9fb11e2409e333f368ad5","source":{"kind":"arxiv","id":"1710.11204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11204","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11204v1","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11204","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"pith_short_12","alias_value":"EDWYXR2NF6U3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EDWYXR2NF6U36ZUH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EDWYXR2N","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EDWYXR2NF6U36ZUH4AJ5MAH67T","target":"record","payload":{"canonical_record":{"source":{"id":"1710.11204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-30T19:13:28Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"9a32b4463a878501fa164a881d832b8240f2fb5671447e8848c482fc4e21ca6b","abstract_canon_sha256":"882eb0100f80ba50d3eafd70bae0fd4e783e275c3ff8ebe1c312d25aaa566985"},"schema_version":"1.0"},"canonical_sha256":"20ed8bc74d2fa9bf6687e013d600fefcc4c9824921a9fb11e2409e333f368ad5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:44.586658Z","signature_b64":"BPaMyaTCIz0xiEC6wjNZ5eHEn8MuoMp6pvcR6i2OkHjIqRYKDqLjX0qJREFIGRQ5NBCvr13d/D4l2WOdKkDoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20ed8bc74d2fa9bf6687e013d600fefcc4c9824921a9fb11e2409e333f368ad5","last_reissued_at":"2026-05-18T00:31:44.585945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:44.585945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.11204","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-18T00:31:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YKve/mJUHT4xfwQoY/N6O5bX2X9M34si3q3XLBq/ffP65cwSZ4+fRwkxgKfiEiQrDCrzwtqCMVEBY7OXg97qCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:30:37.654874Z"},"content_sha256":"6a08e25776ec1ff2e30dbeb93a982a22bb15b353cc6ac622ac13d5dda189c53c","schema_version":"1.0","event_id":"sha256:6a08e25776ec1ff2e30dbeb93a982a22bb15b353cc6ac622ac13d5dda189c53c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EDWYXR2NF6U36ZUH4AJ5MAH67T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improve SAT-solving with Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Haoze Wu","submitted_at":"2017-10-30T19:13:28Z","abstract_excerpt":"In this project, we aimed to improve the runtime of Minisat, a Conflict-Driven Clause Learning (CDCL) solver that solves the Propositional Boolean Satisfiability (SAT) problem. We first used a logistic regression model to predict the satisfiability of propositional boolean formulae after fixing the values of a certain fraction of the variables in each formula. We then applied the logistic model and added a preprocessing period to Minisat to determine the preferable initial value (either true or false) of each boolean variable using a Monte-Carlo approach. Concretely, for each Monte-Carlo trial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11204","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-18T00:31:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R56k699xLCXIrIUPV9eDqWnn9NAHyp6DcuFm96hRMU0CuzXhydcxHYy1zJnnPnsFfVoeHMPSgYiEvaZ/BfDOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:30:37.655479Z"},"content_sha256":"26cdb2959be2f6483b5e622df049148ec6bb3deed9d1edaae76f4ea27d547049","schema_version":"1.0","event_id":"sha256:26cdb2959be2f6483b5e622df049148ec6bb3deed9d1edaae76f4ea27d547049"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EDWYXR2NF6U36ZUH4AJ5MAH67T/bundle.json","state_url":"https://pith.science/pith/EDWYXR2NF6U36ZUH4AJ5MAH67T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EDWYXR2NF6U36ZUH4AJ5MAH67T/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-05-28T09:30:37Z","links":{"resolver":"https://pith.science/pith/EDWYXR2NF6U36ZUH4AJ5MAH67T","bundle":"https://pith.science/pith/EDWYXR2NF6U36ZUH4AJ5MAH67T/bundle.json","state":"https://pith.science/pith/EDWYXR2NF6U36ZUH4AJ5MAH67T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EDWYXR2NF6U36ZUH4AJ5MAH67T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EDWYXR2NF6U36ZUH4AJ5MAH67T","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":"882eb0100f80ba50d3eafd70bae0fd4e783e275c3ff8ebe1c312d25aaa566985","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-30T19:13:28Z","title_canon_sha256":"9a32b4463a878501fa164a881d832b8240f2fb5671447e8848c482fc4e21ca6b"},"schema_version":"1.0","source":{"id":"1710.11204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11204","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11204v1","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11204","created_at":"2026-05-18T00:31:44Z"},{"alias_kind":"pith_short_12","alias_value":"EDWYXR2NF6U3","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EDWYXR2NF6U36ZUH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EDWYXR2N","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:26cdb2959be2f6483b5e622df049148ec6bb3deed9d1edaae76f4ea27d547049","target":"graph","created_at":"2026-05-18T00:31:44Z","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":"In this project, we aimed to improve the runtime of Minisat, a Conflict-Driven Clause Learning (CDCL) solver that solves the Propositional Boolean Satisfiability (SAT) problem. We first used a logistic regression model to predict the satisfiability of propositional boolean formulae after fixing the values of a certain fraction of the variables in each formula. We then applied the logistic model and added a preprocessing period to Minisat to determine the preferable initial value (either true or false) of each boolean variable using a Monte-Carlo approach. Concretely, for each Monte-Carlo trial","authors_text":"Haoze Wu","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-30T19:13:28Z","title":"Improve SAT-solving with Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11204","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:6a08e25776ec1ff2e30dbeb93a982a22bb15b353cc6ac622ac13d5dda189c53c","target":"record","created_at":"2026-05-18T00:31:44Z","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":"882eb0100f80ba50d3eafd70bae0fd4e783e275c3ff8ebe1c312d25aaa566985","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-30T19:13:28Z","title_canon_sha256":"9a32b4463a878501fa164a881d832b8240f2fb5671447e8848c482fc4e21ca6b"},"schema_version":"1.0","source":{"id":"1710.11204","kind":"arxiv","version":1}},"canonical_sha256":"20ed8bc74d2fa9bf6687e013d600fefcc4c9824921a9fb11e2409e333f368ad5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20ed8bc74d2fa9bf6687e013d600fefcc4c9824921a9fb11e2409e333f368ad5","first_computed_at":"2026-05-18T00:31:44.585945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:44.585945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BPaMyaTCIz0xiEC6wjNZ5eHEn8MuoMp6pvcR6i2OkHjIqRYKDqLjX0qJREFIGRQ5NBCvr13d/D4l2WOdKkDoCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:44.586658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.11204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a08e25776ec1ff2e30dbeb93a982a22bb15b353cc6ac622ac13d5dda189c53c","sha256:26cdb2959be2f6483b5e622df049148ec6bb3deed9d1edaae76f4ea27d547049"],"state_sha256":"157f087bc485bf452807912f3635fbe868b7e134b4a3e41c0ca483188b3f2ef0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0CPNEGPJ6daQwpxvpNkxo927umoB6GMwPXkCMnP1exZWByfR9QGBmxRclrdxfyzvWWHx9MwMEW33VFlEcNqoBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:30:37.658781Z","bundle_sha256":"6c20c08d701aa8bc9a3c07946076f6a2122a690d7a99fd42da7893ef887a7c59"}}