{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3OCDHNBRBETQU5JZRAYV2QDREN","short_pith_number":"pith:3OCDHNBR","canonical_record":{"source":{"id":"1308.0761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-08-04T00:30:09Z","cross_cats_sorted":["cs.CR","cs.DC","cs.DS"],"title_canon_sha256":"cd5bcbde15e2af83e4d163194b23809ea70aec5193578b37d5df686fce3ad98d","abstract_canon_sha256":"c92ddc26f424b7de9af25d0b4839a1ee3d10af681990c5f480e4139bd8e522c3"},"schema_version":"1.0"},"canonical_sha256":"db8433b43109270a753988315d407123739217f6802df12d276a17bd745fd1f0","source":{"kind":"arxiv","id":"1308.0761","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0761","created_at":"2026-05-18T03:16:48Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0761v1","created_at":"2026-05-18T03:16:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0761","created_at":"2026-05-18T03:16:48Z"},{"alias_kind":"pith_short_12","alias_value":"3OCDHNBRBETQ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3OCDHNBRBETQU5JZ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3OCDHNBR","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3OCDHNBRBETQU5JZRAYV2QDREN","target":"record","payload":{"canonical_record":{"source":{"id":"1308.0761","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-08-04T00:30:09Z","cross_cats_sorted":["cs.CR","cs.DC","cs.DS"],"title_canon_sha256":"cd5bcbde15e2af83e4d163194b23809ea70aec5193578b37d5df686fce3ad98d","abstract_canon_sha256":"c92ddc26f424b7de9af25d0b4839a1ee3d10af681990c5f480e4139bd8e522c3"},"schema_version":"1.0"},"canonical_sha256":"db8433b43109270a753988315d407123739217f6802df12d276a17bd745fd1f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:48.269268Z","signature_b64":"gkdgUha0WhtytnHuPiW+rgOHhlIS8gAkS5LU+65IoRvo2NHJDCKw6zLfuGp1XmWtw6WxNZdsSSEscg+wWCC6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db8433b43109270a753988315d407123739217f6802df12d276a17bd745fd1f0","last_reissued_at":"2026-05-18T03:16:48.268577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:48.268577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.0761","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-18T03:16:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSP/FedHDxuPQ4H1DJxnqQMeZ0rsT1fmosYRvgGdR1OWz1a/PXdyRp0/0zZjo2fGp6X4fC2li6MCYEm3d5zcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:24:40.101908Z"},"content_sha256":"7f8feb382ae5567ba4f6ba82fd3d6b8890ede3dc3fdde0e9709f2eb8b0fa99f7","schema_version":"1.0","event_id":"sha256:7f8feb382ae5567ba4f6ba82fd3d6b8890ede3dc3fdde0e9709f2eb8b0fa99f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3OCDHNBRBETQU5JZRAYV2QDREN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DC","cs.DS"],"primary_cat":"cs.AI","authors_text":"Alexander Semenov, Oleg Zaikin","submitted_at":"2013-08-04T00:30:09Z","abstract_excerpt":"This paper proposes a method to estimate the total time required to solve SAT in distributed environments via partitioning approach. It is based on the observation that for some simple forms of problem partitioning one can use the Monte Carlo approach to estimate the time required to solve an original problem. The method proposed is based on an algorithm for searching for partitioning with an optimal solving time estimation. We applied this method to estimate the time required to perform logical cryptanalysis of the widely known stream ciphers A5/1 and Bivium. The paper also describes a volunt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0761","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-18T03:16:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W3PABu8jOjblymylTNwEIHCMSVep6raX35yNLOfAkSY1T0nPzyjs1xMc/BPjYB+CslljdDZXQi9RHLxX4ZlFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:24:40.102581Z"},"content_sha256":"23fa70e552576c53c3e8974dcd8d721ccca5a0c7b2e7ced81e86358e2cddee14","schema_version":"1.0","event_id":"sha256:23fa70e552576c53c3e8974dcd8d721ccca5a0c7b2e7ced81e86358e2cddee14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3OCDHNBRBETQU5JZRAYV2QDREN/bundle.json","state_url":"https://pith.science/pith/3OCDHNBRBETQU5JZRAYV2QDREN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3OCDHNBRBETQU5JZRAYV2QDREN/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-27T12:24:40Z","links":{"resolver":"https://pith.science/pith/3OCDHNBRBETQU5JZRAYV2QDREN","bundle":"https://pith.science/pith/3OCDHNBRBETQU5JZRAYV2QDREN/bundle.json","state":"https://pith.science/pith/3OCDHNBRBETQU5JZRAYV2QDREN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3OCDHNBRBETQU5JZRAYV2QDREN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3OCDHNBRBETQU5JZRAYV2QDREN","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":"c92ddc26f424b7de9af25d0b4839a1ee3d10af681990c5f480e4139bd8e522c3","cross_cats_sorted":["cs.CR","cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-08-04T00:30:09Z","title_canon_sha256":"cd5bcbde15e2af83e4d163194b23809ea70aec5193578b37d5df686fce3ad98d"},"schema_version":"1.0","source":{"id":"1308.0761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.0761","created_at":"2026-05-18T03:16:48Z"},{"alias_kind":"arxiv_version","alias_value":"1308.0761v1","created_at":"2026-05-18T03:16:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0761","created_at":"2026-05-18T03:16:48Z"},{"alias_kind":"pith_short_12","alias_value":"3OCDHNBRBETQ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3OCDHNBRBETQU5JZ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3OCDHNBR","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:23fa70e552576c53c3e8974dcd8d721ccca5a0c7b2e7ced81e86358e2cddee14","target":"graph","created_at":"2026-05-18T03:16:48Z","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":"This paper proposes a method to estimate the total time required to solve SAT in distributed environments via partitioning approach. It is based on the observation that for some simple forms of problem partitioning one can use the Monte Carlo approach to estimate the time required to solve an original problem. The method proposed is based on an algorithm for searching for partitioning with an optimal solving time estimation. We applied this method to estimate the time required to perform logical cryptanalysis of the widely known stream ciphers A5/1 and Bivium. The paper also describes a volunt","authors_text":"Alexander Semenov, Oleg Zaikin","cross_cats":["cs.CR","cs.DC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-08-04T00:30:09Z","title":"On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0761","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:7f8feb382ae5567ba4f6ba82fd3d6b8890ede3dc3fdde0e9709f2eb8b0fa99f7","target":"record","created_at":"2026-05-18T03:16:48Z","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":"c92ddc26f424b7de9af25d0b4839a1ee3d10af681990c5f480e4139bd8e522c3","cross_cats_sorted":["cs.CR","cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-08-04T00:30:09Z","title_canon_sha256":"cd5bcbde15e2af83e4d163194b23809ea70aec5193578b37d5df686fce3ad98d"},"schema_version":"1.0","source":{"id":"1308.0761","kind":"arxiv","version":1}},"canonical_sha256":"db8433b43109270a753988315d407123739217f6802df12d276a17bd745fd1f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db8433b43109270a753988315d407123739217f6802df12d276a17bd745fd1f0","first_computed_at":"2026-05-18T03:16:48.268577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:16:48.268577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gkdgUha0WhtytnHuPiW+rgOHhlIS8gAkS5LU+65IoRvo2NHJDCKw6zLfuGp1XmWtw6WxNZdsSSEscg+wWCC6Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:16:48.269268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.0761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f8feb382ae5567ba4f6ba82fd3d6b8890ede3dc3fdde0e9709f2eb8b0fa99f7","sha256:23fa70e552576c53c3e8974dcd8d721ccca5a0c7b2e7ced81e86358e2cddee14"],"state_sha256":"0db10244b6f5551bd6ecdafffed886111ed2337afb0963bb24b805cb964a7977"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wfTMzh7sqlWERgKb8lMUENv7RJjJ8iADEVASNJT/13FftgHqeVddtLAX+IvCPvCX3Ikjlp+Rba0G2wAIxFDoDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:24:40.106468Z","bundle_sha256":"f960536461fe1cbbd253b8149787cc2aa46f2665333f6bf26ccdf576f411bda1"}}