{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:635BMNMYYB3NJMOWAQW6TZDVSU","short_pith_number":"pith:635BMNMY","canonical_record":{"source":{"id":"1102.3310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2011-02-16T11:40:33Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","nlin.CD"],"title_canon_sha256":"10070d1ec569bb41386dc297e6ddc060ac524bda7d1ca366029cd7f604f4655c","abstract_canon_sha256":"004e888f57fd8e9b26b409e5f46022860a6b6e268f6c255127175816f49ed535"},"schema_version":"1.0"},"canonical_sha256":"f6fa163598c076d4b1d6042de9e475953a9ec1a3dc716e20054dd0d2ebd251a1","source":{"kind":"arxiv","id":"1102.3310","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3310","created_at":"2026-05-18T04:17:04Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3310v2","created_at":"2026-05-18T04:17:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3310","created_at":"2026-05-18T04:17:04Z"},{"alias_kind":"pith_short_12","alias_value":"635BMNMYYB3N","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"635BMNMYYB3NJMOW","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"635BMNMY","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:635BMNMYYB3NJMOWAQW6TZDVSU","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2011-02-16T11:40:33Z","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","nlin.CD"],"title_canon_sha256":"10070d1ec569bb41386dc297e6ddc060ac524bda7d1ca366029cd7f604f4655c","abstract_canon_sha256":"004e888f57fd8e9b26b409e5f46022860a6b6e268f6c255127175816f49ed535"},"schema_version":"1.0"},"canonical_sha256":"f6fa163598c076d4b1d6042de9e475953a9ec1a3dc716e20054dd0d2ebd251a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:04.362950Z","signature_b64":"3mjloHNmsiNN7qILJLMxx+np8z9G3+NiVjERMCjIUx0tU2INgr6qCxBjV+tahYvEeUvDuWSBvdl4FionTerjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6fa163598c076d4b1d6042de9e475953a9ec1a3dc716e20054dd0d2ebd251a1","last_reissued_at":"2026-05-18T04:17:04.362424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:04.362424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3310","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-18T04:17:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RzuxPMiNUhB6/SzO0ZuwEZwQBv0j+V9FexEJsGBitJJlOM1xjt5aKlWy8bLnL8RF6/p5cExJfVYjz4BZgz/ZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:18:20.614585Z"},"content_sha256":"20379a24284dbe666c1043c3a1010ccda92079cd7b7aff0169dc55957b366b2a","schema_version":"1.0","event_id":"sha256:20379a24284dbe666c1043c3a1010ccda92079cd7b7aff0169dc55957b366b2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:635BMNMYYB3NJMOWAQW6TZDVSU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Complexity of Random Boolean Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.CC","nlin.CD"],"primary_cat":"cond-mat.dis-nn","authors_text":"Cristopher Moore, Jon Machta, Simon DeDeo, Stephan Mertens","submitted_at":"2011-02-16T11:40:33Z","abstract_excerpt":"Random instances of feedforward Boolean circuits are studied both analytically and numerically. Evaluating these circuits is known to be a P-complete problem and thus, in the worst case, believed to be impossible to perform, even given a massively parallel computer, in time much less than the depth of the circuit. Nonetheless, it is found that for some ensembles of random circuits, saturation to a fixed truth value occurs rapidly so that evaluation of the circuit can be accomplished in much less parallel time than the depth of the circuit. For other ensembles saturation does not occur and circ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3310","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-18T04:17:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FthtmS5x4PDPnqOb9ApIU1HfxE9WqE+TkDweczqelMhzCYzUCErYGMlTIoh/V+vQcmMW5f05MTsnAWiQy8BFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:18:20.614941Z"},"content_sha256":"de88ed9e0dd2565fe0ca991272504a5167c19cf9fed037799333464d61923d99","schema_version":"1.0","event_id":"sha256:de88ed9e0dd2565fe0ca991272504a5167c19cf9fed037799333464d61923d99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/635BMNMYYB3NJMOWAQW6TZDVSU/bundle.json","state_url":"https://pith.science/pith/635BMNMYYB3NJMOWAQW6TZDVSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/635BMNMYYB3NJMOWAQW6TZDVSU/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-06-03T16:18:20Z","links":{"resolver":"https://pith.science/pith/635BMNMYYB3NJMOWAQW6TZDVSU","bundle":"https://pith.science/pith/635BMNMYYB3NJMOWAQW6TZDVSU/bundle.json","state":"https://pith.science/pith/635BMNMYYB3NJMOWAQW6TZDVSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/635BMNMYYB3NJMOWAQW6TZDVSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:635BMNMYYB3NJMOWAQW6TZDVSU","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":"004e888f57fd8e9b26b409e5f46022860a6b6e268f6c255127175816f49ed535","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","nlin.CD"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2011-02-16T11:40:33Z","title_canon_sha256":"10070d1ec569bb41386dc297e6ddc060ac524bda7d1ca366029cd7f604f4655c"},"schema_version":"1.0","source":{"id":"1102.3310","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3310","created_at":"2026-05-18T04:17:04Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3310v2","created_at":"2026-05-18T04:17:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3310","created_at":"2026-05-18T04:17:04Z"},{"alias_kind":"pith_short_12","alias_value":"635BMNMYYB3N","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"635BMNMYYB3NJMOW","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"635BMNMY","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:de88ed9e0dd2565fe0ca991272504a5167c19cf9fed037799333464d61923d99","target":"graph","created_at":"2026-05-18T04:17:04Z","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":"Random instances of feedforward Boolean circuits are studied both analytically and numerically. Evaluating these circuits is known to be a P-complete problem and thus, in the worst case, believed to be impossible to perform, even given a massively parallel computer, in time much less than the depth of the circuit. Nonetheless, it is found that for some ensembles of random circuits, saturation to a fixed truth value occurs rapidly so that evaluation of the circuit can be accomplished in much less parallel time than the depth of the circuit. For other ensembles saturation does not occur and circ","authors_text":"Cristopher Moore, Jon Machta, Simon DeDeo, Stephan Mertens","cross_cats":["cond-mat.stat-mech","cs.CC","nlin.CD"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2011-02-16T11:40:33Z","title":"Parallel Complexity of Random Boolean Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3310","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:20379a24284dbe666c1043c3a1010ccda92079cd7b7aff0169dc55957b366b2a","target":"record","created_at":"2026-05-18T04:17:04Z","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":"004e888f57fd8e9b26b409e5f46022860a6b6e268f6c255127175816f49ed535","cross_cats_sorted":["cond-mat.stat-mech","cs.CC","nlin.CD"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2011-02-16T11:40:33Z","title_canon_sha256":"10070d1ec569bb41386dc297e6ddc060ac524bda7d1ca366029cd7f604f4655c"},"schema_version":"1.0","source":{"id":"1102.3310","kind":"arxiv","version":2}},"canonical_sha256":"f6fa163598c076d4b1d6042de9e475953a9ec1a3dc716e20054dd0d2ebd251a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6fa163598c076d4b1d6042de9e475953a9ec1a3dc716e20054dd0d2ebd251a1","first_computed_at":"2026-05-18T04:17:04.362424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:17:04.362424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3mjloHNmsiNN7qILJLMxx+np8z9G3+NiVjERMCjIUx0tU2INgr6qCxBjV+tahYvEeUvDuWSBvdl4FionTerjDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:17:04.362950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3310","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20379a24284dbe666c1043c3a1010ccda92079cd7b7aff0169dc55957b366b2a","sha256:de88ed9e0dd2565fe0ca991272504a5167c19cf9fed037799333464d61923d99"],"state_sha256":"162f7a47ba0f6f5d63917d7986149551a1a7601fcebeb566eb072a62fe87240d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mnhS/PuUW8CWeX/8J96WX8Z3/V9rHnbW56b2vAvd4GIx7rIjolmJjk5Z6FxavKqXd8tIczTUnUB7TnxIa8TXDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:18:20.617108Z","bundle_sha256":"b8cbcd2d3515786d1ed166be50691a4a3ea261bb11cca8d7b29cc4abdbb1e0c0"}}