{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6WJ6ZF43POWG2R4SPL4VPR7EM5","short_pith_number":"pith:6WJ6ZF43","canonical_record":{"source":{"id":"1507.00862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-07-03T10:18:01Z","cross_cats_sorted":[],"title_canon_sha256":"9f62bd9330d97fd960ea0a04f62a1960f84ae28cdd8906a145f6186ca1e621af","abstract_canon_sha256":"e54463d8e1a877e0ef44bd8c63b6eb6f880cceb8354c7e5f5bb00d8f2f4e8d13"},"schema_version":"1.0"},"canonical_sha256":"f593ec979b7bac6d47927af957c7e467780afe49b472031602d8abb1c714d10a","source":{"kind":"arxiv","id":"1507.00862","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00862","created_at":"2026-05-18T01:29:31Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00862v1","created_at":"2026-05-18T01:29:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00862","created_at":"2026-05-18T01:29:31Z"},{"alias_kind":"pith_short_12","alias_value":"6WJ6ZF43POWG","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6WJ6ZF43POWG2R4S","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6WJ6ZF43","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6WJ6ZF43POWG2R4SPL4VPR7EM5","target":"record","payload":{"canonical_record":{"source":{"id":"1507.00862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-07-03T10:18:01Z","cross_cats_sorted":[],"title_canon_sha256":"9f62bd9330d97fd960ea0a04f62a1960f84ae28cdd8906a145f6186ca1e621af","abstract_canon_sha256":"e54463d8e1a877e0ef44bd8c63b6eb6f880cceb8354c7e5f5bb00d8f2f4e8d13"},"schema_version":"1.0"},"canonical_sha256":"f593ec979b7bac6d47927af957c7e467780afe49b472031602d8abb1c714d10a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:31.480073Z","signature_b64":"z2BYrkOR7CCSvujMANnlWw6XGg5vXUtIMVVNn1syJkhO86sKX5mrff6DIDYua7nz30kKB/Rxpur+kCoyLg8gDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f593ec979b7bac6d47927af957c7e467780afe49b472031602d8abb1c714d10a","last_reissued_at":"2026-05-18T01:29:31.479395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:31.479395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.00862","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-18T01:29:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FN12eJMokX68wM1bvHA7ZmdgUzMJHzfhWl7NzYVS/xVDMVR3JCx5QWlOk/TVXN2RKLZ1p4kSi5YUTfE5HYh1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:11:45.884702Z"},"content_sha256":"7d90fae7adc4a0fc017c24b543762caa563f9f802c741ab0517a04a79f02af14","schema_version":"1.0","event_id":"sha256:7d90fae7adc4a0fc017c24b543762caa563f9f802c741ab0517a04a79f02af14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6WJ6ZF43POWG2R4SPL4VPR7EM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alexander Semenov, Oleg Zaikin","submitted_at":"2015-07-03T10:18:01Z","abstract_excerpt":"In this paper we propose the approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT). Such partitionings can be used for solving corresponding SAT instances in parallel. For the same SAT instance one can construct different partitionings, each of them is a set of simplified versions of the original SAT instance. The effectiveness of an arbitrary partitioning is determined by the total time of solving of all SAT instances from it. We suggest the approach, based on the Monte Carlo method, for estimating time of processing of an arbitrary partitioning."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00862","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-18T01:29:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ORgF3nCSGrBu14MqAsrvrM1IhgFzhG7MSdU9XO7xtZ2yvV9RA9mjuSCIThGw73pZZu0YxPo1mcfDjnI8J/UHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:11:45.885341Z"},"content_sha256":"547c64feeb551134cd68731b4ce4c33f1740eca7dc0f536f5142339da8c1c1a5","schema_version":"1.0","event_id":"sha256:547c64feeb551134cd68731b4ce4c33f1740eca7dc0f536f5142339da8c1c1a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6WJ6ZF43POWG2R4SPL4VPR7EM5/bundle.json","state_url":"https://pith.science/pith/6WJ6ZF43POWG2R4SPL4VPR7EM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6WJ6ZF43POWG2R4SPL4VPR7EM5/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-27T22:11:45Z","links":{"resolver":"https://pith.science/pith/6WJ6ZF43POWG2R4SPL4VPR7EM5","bundle":"https://pith.science/pith/6WJ6ZF43POWG2R4SPL4VPR7EM5/bundle.json","state":"https://pith.science/pith/6WJ6ZF43POWG2R4SPL4VPR7EM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6WJ6ZF43POWG2R4SPL4VPR7EM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6WJ6ZF43POWG2R4SPL4VPR7EM5","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":"e54463d8e1a877e0ef44bd8c63b6eb6f880cceb8354c7e5f5bb00d8f2f4e8d13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-07-03T10:18:01Z","title_canon_sha256":"9f62bd9330d97fd960ea0a04f62a1960f84ae28cdd8906a145f6186ca1e621af"},"schema_version":"1.0","source":{"id":"1507.00862","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00862","created_at":"2026-05-18T01:29:31Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00862v1","created_at":"2026-05-18T01:29:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00862","created_at":"2026-05-18T01:29:31Z"},{"alias_kind":"pith_short_12","alias_value":"6WJ6ZF43POWG","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6WJ6ZF43POWG2R4S","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6WJ6ZF43","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:547c64feeb551134cd68731b4ce4c33f1740eca7dc0f536f5142339da8c1c1a5","target":"graph","created_at":"2026-05-18T01:29: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"},"paper":{"abstract_excerpt":"In this paper we propose the approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT). Such partitionings can be used for solving corresponding SAT instances in parallel. For the same SAT instance one can construct different partitionings, each of them is a set of simplified versions of the original SAT instance. The effectiveness of an arbitrary partitioning is determined by the total time of solving of all SAT instances from it. We suggest the approach, based on the Monte Carlo method, for estimating time of processing of an arbitrary partitioning.","authors_text":"Alexander Semenov, Oleg Zaikin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-07-03T10:18:01Z","title":"Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00862","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:7d90fae7adc4a0fc017c24b543762caa563f9f802c741ab0517a04a79f02af14","target":"record","created_at":"2026-05-18T01:29: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":"e54463d8e1a877e0ef44bd8c63b6eb6f880cceb8354c7e5f5bb00d8f2f4e8d13","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-07-03T10:18:01Z","title_canon_sha256":"9f62bd9330d97fd960ea0a04f62a1960f84ae28cdd8906a145f6186ca1e621af"},"schema_version":"1.0","source":{"id":"1507.00862","kind":"arxiv","version":1}},"canonical_sha256":"f593ec979b7bac6d47927af957c7e467780afe49b472031602d8abb1c714d10a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f593ec979b7bac6d47927af957c7e467780afe49b472031602d8abb1c714d10a","first_computed_at":"2026-05-18T01:29:31.479395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:31.479395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z2BYrkOR7CCSvujMANnlWw6XGg5vXUtIMVVNn1syJkhO86sKX5mrff6DIDYua7nz30kKB/Rxpur+kCoyLg8gDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:31.480073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00862","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d90fae7adc4a0fc017c24b543762caa563f9f802c741ab0517a04a79f02af14","sha256:547c64feeb551134cd68731b4ce4c33f1740eca7dc0f536f5142339da8c1c1a5"],"state_sha256":"c190800c0aa3ef02ae68b04f8b63bebfd87f7540eb074a06b65149a4cc331cab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ob+4pM0mDXw9f+31cJ2gazEpNJsXuKYtNPriIhHEEWTjzdqGpM9POQoHYaqfzBFiCPj/L7/E5zvaBU1BIDeBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:11:45.888536Z","bundle_sha256":"06eac3713a3d73a939599cae743d6f3f1c0be655b500984c8ea4436d61f66a72"}}