{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ORCXGLKO4Z25QWDFI7J5KVT7J2","short_pith_number":"pith:ORCXGLKO","canonical_record":{"source":{"id":"1501.01586","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-12-08T17:54:28Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"281513cc7771bbca6f9267680589bdbfa66419a792990ee0f09a68100cba697f","abstract_canon_sha256":"81eb925278ab14edcd5dd4d6f6ccaecffc6bda1c2a78eb0a7b92c480e421594d"},"schema_version":"1.0"},"canonical_sha256":"7445732d4ee675d8586547d3d5567f4e8cc02e46b21b53f22ad34884dc5ddf4a","source":{"kind":"arxiv","id":"1501.01586","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01586","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01586v2","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01586","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"pith_short_12","alias_value":"ORCXGLKO4Z25","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"ORCXGLKO4Z25QWDF","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"ORCXGLKO","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ORCXGLKO4Z25QWDFI7J5KVT7J2","target":"record","payload":{"canonical_record":{"source":{"id":"1501.01586","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-12-08T17:54:28Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"281513cc7771bbca6f9267680589bdbfa66419a792990ee0f09a68100cba697f","abstract_canon_sha256":"81eb925278ab14edcd5dd4d6f6ccaecffc6bda1c2a78eb0a7b92c480e421594d"},"schema_version":"1.0"},"canonical_sha256":"7445732d4ee675d8586547d3d5567f4e8cc02e46b21b53f22ad34884dc5ddf4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:27.794033Z","signature_b64":"qEu9H0WUmMU2u2Y6fKHI7hQri/vTHGXFoWe24pIT0LPHmqhqxVYFqqlCR6fNZNpuWXzPMJm6rSbmMgKgJZqTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7445732d4ee675d8586547d3d5567f4e8cc02e46b21b53f22ad34884dc5ddf4a","last_reissued_at":"2026-05-18T02:19:27.793540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:27.793540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.01586","source_version":2,"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-18T02:19:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QbOAOjRHUOoU9CIzWf5TRuA1VEu0D4oNh1f0ptWf24LuHZo/23wmun6G++HBPMVLrbozg5ZMLIzFOENDhAtMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T04:48:54.589162Z"},"content_sha256":"e75540f973622c525113fa6b26edcb84a79c19a345660006012eff6764ad22c1","schema_version":"1.0","event_id":"sha256:e75540f973622c525113fa6b26edcb84a79c19a345660006012eff6764ad22c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ORCXGLKO4Z25QWDFI7J5KVT7J2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple cubic random-site percolation thresholds for neighborhoods containing fourth-nearest neighbors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"cond-mat.stat-mech","authors_text":"K. Malarz","submitted_at":"2014-12-08T17:54:28Z","abstract_excerpt":"In the paper random-site percolation thresholds for simple cubic lattice with sites' neighborhoods containing next-next-next-nearest neighbors (4NN) are evaluated with Monte Carlo simulations. A recently proposed algorithm with low sampling for percolation thresholds estimation [Bastas et al., arXiv:1411.5834] is implemented for the studies of the top-bottom wrapping probability. The obtained percolation thresholds are $p_C(\\text{4NN})=0.31160(12)$, $p_C(\\text{4NN+NN})=0.15040(12)$, $p_C(\\text{4NN+2NN})=0.15950(12)$, $p_C(\\text{4NN+3NN})=0.20490(12)$, $p_C(\\text{4NN+2NN+NN})=0.11440(12)$, $p_C"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01586","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"},"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-18T02:19:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHG+Pd6JJyp5jj4DiknKWqwlxXEg1zxeQqA2PTO6oYlnXBOj9Ejn3N8TQFX9qyNz0dYEN1cz7oDdaps7KStKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T04:48:54.589532Z"},"content_sha256":"a7590d55963dd663255e496cf58dd4ba61d96b7d870e1a3eb34b74c866ed0719","schema_version":"1.0","event_id":"sha256:a7590d55963dd663255e496cf58dd4ba61d96b7d870e1a3eb34b74c866ed0719"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ORCXGLKO4Z25QWDFI7J5KVT7J2/bundle.json","state_url":"https://pith.science/pith/ORCXGLKO4Z25QWDFI7J5KVT7J2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ORCXGLKO4Z25QWDFI7J5KVT7J2/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-07-03T04:48:54Z","links":{"resolver":"https://pith.science/pith/ORCXGLKO4Z25QWDFI7J5KVT7J2","bundle":"https://pith.science/pith/ORCXGLKO4Z25QWDFI7J5KVT7J2/bundle.json","state":"https://pith.science/pith/ORCXGLKO4Z25QWDFI7J5KVT7J2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ORCXGLKO4Z25QWDFI7J5KVT7J2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ORCXGLKO4Z25QWDFI7J5KVT7J2","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":"81eb925278ab14edcd5dd4d6f6ccaecffc6bda1c2a78eb0a7b92c480e421594d","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-12-08T17:54:28Z","title_canon_sha256":"281513cc7771bbca6f9267680589bdbfa66419a792990ee0f09a68100cba697f"},"schema_version":"1.0","source":{"id":"1501.01586","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01586","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01586v2","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01586","created_at":"2026-05-18T02:19:27Z"},{"alias_kind":"pith_short_12","alias_value":"ORCXGLKO4Z25","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"ORCXGLKO4Z25QWDF","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"ORCXGLKO","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:a7590d55963dd663255e496cf58dd4ba61d96b7d870e1a3eb34b74c866ed0719","target":"graph","created_at":"2026-05-18T02:19:27Z","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 the paper random-site percolation thresholds for simple cubic lattice with sites' neighborhoods containing next-next-next-nearest neighbors (4NN) are evaluated with Monte Carlo simulations. A recently proposed algorithm with low sampling for percolation thresholds estimation [Bastas et al., arXiv:1411.5834] is implemented for the studies of the top-bottom wrapping probability. The obtained percolation thresholds are $p_C(\\text{4NN})=0.31160(12)$, $p_C(\\text{4NN+NN})=0.15040(12)$, $p_C(\\text{4NN+2NN})=0.15950(12)$, $p_C(\\text{4NN+3NN})=0.20490(12)$, $p_C(\\text{4NN+2NN+NN})=0.11440(12)$, $p_C","authors_text":"K. Malarz","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-12-08T17:54:28Z","title":"Simple cubic random-site percolation thresholds for neighborhoods containing fourth-nearest neighbors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01586","kind":"arxiv","version":2},"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:e75540f973622c525113fa6b26edcb84a79c19a345660006012eff6764ad22c1","target":"record","created_at":"2026-05-18T02:19:27Z","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":"81eb925278ab14edcd5dd4d6f6ccaecffc6bda1c2a78eb0a7b92c480e421594d","cross_cats_sorted":["math-ph","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2014-12-08T17:54:28Z","title_canon_sha256":"281513cc7771bbca6f9267680589bdbfa66419a792990ee0f09a68100cba697f"},"schema_version":"1.0","source":{"id":"1501.01586","kind":"arxiv","version":2}},"canonical_sha256":"7445732d4ee675d8586547d3d5567f4e8cc02e46b21b53f22ad34884dc5ddf4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7445732d4ee675d8586547d3d5567f4e8cc02e46b21b53f22ad34884dc5ddf4a","first_computed_at":"2026-05-18T02:19:27.793540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:27.793540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qEu9H0WUmMU2u2Y6fKHI7hQri/vTHGXFoWe24pIT0LPHmqhqxVYFqqlCR6fNZNpuWXzPMJm6rSbmMgKgJZqTBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:27.794033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01586","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e75540f973622c525113fa6b26edcb84a79c19a345660006012eff6764ad22c1","sha256:a7590d55963dd663255e496cf58dd4ba61d96b7d870e1a3eb34b74c866ed0719"],"state_sha256":"7a5d8cf4ba7b9cbd0a45526f8a1f4ec6177d37d27af9a583cf96d1f41d3446ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcJ2vpgr1ET1QT3+F9jYyanIziB450kAY1qVuAIPHzPGjS+kiwSzCYbiNt0U3nrqBAIO7ObvRKwCDbfsF4kXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T04:48:54.591535Z","bundle_sha256":"bc8109e87bd4f22f74318508cc8c87ba1a808e5b506f8ff44b5c501729cb89f1"}}