{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PH45YKFXJ5WWG4B6EXLGJZOPW7","short_pith_number":"pith:PH45YKFX","schema_version":"1.0","canonical_sha256":"79f9dc28b74f6d63703e25d664e5cfb7d0b2c96d166551f8b67ef49543fa5c14","source":{"kind":"arxiv","id":"1808.05009","version":2},"attestation_state":"computed","paper":{"title":"Fast algorithm for generating random bit strings and multispin coding for directed percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Hiroshi Watanabe, Naoki Kawashima, Satoshi Morita, Synge Todo","submitted_at":"2018-08-15T09:13:46Z","abstract_excerpt":"We present efficient algorithms to generate a bit string in which each bit is set with arbitrary probability. By adopting a hybrid algorithm, i.e., a finite-bit density approximation with correction techniques, we achieve 3.8 times faster random bit generation than the simple algorithm for the 32-bit case and 6.8 times faster for the 64-bit case. Employing the developed algorithm, we apply the multispin coding technique to one-dimensional bond-directed percolation. The simulations are accelerated by up to a factor of 14 compared with an optimized scalar implementation. The random bit string ge"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1808.05009","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2018-08-15T09:13:46Z","cross_cats_sorted":["physics.comp-ph"],"title_canon_sha256":"203091f8b01522c613ca74f488e3cb6867ee0689b8e11b384970ee67464f2582","abstract_canon_sha256":"9bbe2e637cd404e6649055466f093368f07060c25e45f8f3ce719d54bae29de0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:39.357932Z","signature_b64":"F2FI/EaZ79uybi4wIxviFbi+0ZehiDdiu6tm62/yt6kmd5KuFSOqg8dIWAHwwLrJRPte7O6eM84eE3LYr2bADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79f9dc28b74f6d63703e25d664e5cfb7d0b2c96d166551f8b67ef49543fa5c14","last_reissued_at":"2026-05-17T23:54:39.357542Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:39.357542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast algorithm for generating random bit strings and multispin coding for directed percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.comp-ph"],"primary_cat":"cond-mat.stat-mech","authors_text":"Hiroshi Watanabe, Naoki Kawashima, Satoshi Morita, Synge Todo","submitted_at":"2018-08-15T09:13:46Z","abstract_excerpt":"We present efficient algorithms to generate a bit string in which each bit is set with arbitrary probability. By adopting a hybrid algorithm, i.e., a finite-bit density approximation with correction techniques, we achieve 3.8 times faster random bit generation than the simple algorithm for the 32-bit case and 6.8 times faster for the 64-bit case. Employing the developed algorithm, we apply the multispin coding technique to one-dimensional bond-directed percolation. The simulations are accelerated by up to a factor of 14 compared with an optimized scalar implementation. The random bit string ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05009","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.05009","created_at":"2026-05-17T23:54:39.357601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05009v2","created_at":"2026-05-17T23:54:39.357601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05009","created_at":"2026-05-17T23:54:39.357601+00:00"},{"alias_kind":"pith_short_12","alias_value":"PH45YKFXJ5WW","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PH45YKFXJ5WWG4B6","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PH45YKFX","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PH45YKFXJ5WWG4B6EXLGJZOPW7","json":"https://pith.science/pith/PH45YKFXJ5WWG4B6EXLGJZOPW7.json","graph_json":"https://pith.science/api/pith-number/PH45YKFXJ5WWG4B6EXLGJZOPW7/graph.json","events_json":"https://pith.science/api/pith-number/PH45YKFXJ5WWG4B6EXLGJZOPW7/events.json","paper":"https://pith.science/paper/PH45YKFX"},"agent_actions":{"view_html":"https://pith.science/pith/PH45YKFXJ5WWG4B6EXLGJZOPW7","download_json":"https://pith.science/pith/PH45YKFXJ5WWG4B6EXLGJZOPW7.json","view_paper":"https://pith.science/paper/PH45YKFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05009&json=true","fetch_graph":"https://pith.science/api/pith-number/PH45YKFXJ5WWG4B6EXLGJZOPW7/graph.json","fetch_events":"https://pith.science/api/pith-number/PH45YKFXJ5WWG4B6EXLGJZOPW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PH45YKFXJ5WWG4B6EXLGJZOPW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PH45YKFXJ5WWG4B6EXLGJZOPW7/action/storage_attestation","attest_author":"https://pith.science/pith/PH45YKFXJ5WWG4B6EXLGJZOPW7/action/author_attestation","sign_citation":"https://pith.science/pith/PH45YKFXJ5WWG4B6EXLGJZOPW7/action/citation_signature","submit_replication":"https://pith.science/pith/PH45YKFXJ5WWG4B6EXLGJZOPW7/action/replication_record"}},"created_at":"2026-05-17T23:54:39.357601+00:00","updated_at":"2026-05-17T23:54:39.357601+00:00"}