{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:LTDO6QDPMNTY25Z7PKVDFL34KN","short_pith_number":"pith:LTDO6QDP","canonical_record":{"source":{"id":"1007.0862","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-07-06T11:11:57Z","cross_cats_sorted":[],"title_canon_sha256":"8794ac45a0ef81733ebb7211a5b3a35f8706252dbe846b900d43be5d67b9474c","abstract_canon_sha256":"2b14d2c09a5aced52055bbed5d1dc8dc122993ccdcc9c742ce9283692238a81f"},"schema_version":"1.0"},"canonical_sha256":"5cc6ef406f63678d773f7aaa32af7c534ed072f7dcd4c8f7393d560ecef8b58b","source":{"kind":"arxiv","id":"1007.0862","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.0862","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"arxiv_version","alias_value":"1007.0862v2","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0862","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"pith_short_12","alias_value":"LTDO6QDPMNTY","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LTDO6QDPMNTY25Z7","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LTDO6QDP","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:LTDO6QDPMNTY25Z7PKVDFL34KN","target":"record","payload":{"canonical_record":{"source":{"id":"1007.0862","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-07-06T11:11:57Z","cross_cats_sorted":[],"title_canon_sha256":"8794ac45a0ef81733ebb7211a5b3a35f8706252dbe846b900d43be5d67b9474c","abstract_canon_sha256":"2b14d2c09a5aced52055bbed5d1dc8dc122993ccdcc9c742ce9283692238a81f"},"schema_version":"1.0"},"canonical_sha256":"5cc6ef406f63678d773f7aaa32af7c534ed072f7dcd4c8f7393d560ecef8b58b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:14.846170Z","signature_b64":"ZMW8uGWn0CPVXDt5sHBll2INWHNUCoQ77jqH/TtOIMuypJWo+wJAL1Wbvug8tLcDLp7cE84V3dCf0pkMtjj5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cc6ef406f63678d773f7aaa32af7c534ed072f7dcd4c8f7393d560ecef8b58b","last_reissued_at":"2026-05-18T03:39:14.845727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:14.845727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.0862","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-18T03:39:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDeiyL9h19VN8qhMgOH0P3OQ28eBYCvF+bVqxYjOjqNP9Qq0ERrJr/r6Zhur7dVuzPdi9EThNtUysx8N+gdmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:54.805256Z"},"content_sha256":"ae749a674aaaf67d51f34edbef0cb3415835b9fc578e0b3dc67206639de4ff9e","schema_version":"1.0","event_id":"sha256:ae749a674aaaf67d51f34edbef0cb3415835b9fc578e0b3dc67206639de4ff9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:LTDO6QDPMNTY25Z7PKVDFL34KN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Supercriticality of Annealed Approximations of Boolean Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Daniel Valesin, Thomas Mountford","submitted_at":"2010-07-06T11:11:57Z","abstract_excerpt":"We consider a model recently proposed by Chatterjee and Durrett [CD2011] as an \"annealed approximation\" of boolean networks, which are a class of cellular automata on a random graph, as defined by S. Kauffman [K69]. The starting point is a random directed graph on $n$ vertices; each vertex has $r$ input vertices pointing to it. For the model of [CD2011], a discrete time threshold contact process is then considered on this graph: at each instant, each vertex has probability $q$ of choosing to receive input; if it does, and if at least one of its input vertices were in state 1 at the previous in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0862","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-18T03:39:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4oMWsjGkv8KLz+s3zmmIraq3NR8e1j4J4ss5unHawn6V3xa7kH22VfVT90Ck2Qxeh01Euc2BL0wK5eTAEuECBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:21:54.805902Z"},"content_sha256":"cb4ce2ef03fa5f2747b66426bc11c726b5b5fe879cd03da52a6466c1fb1117a8","schema_version":"1.0","event_id":"sha256:cb4ce2ef03fa5f2747b66426bc11c726b5b5fe879cd03da52a6466c1fb1117a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LTDO6QDPMNTY25Z7PKVDFL34KN/bundle.json","state_url":"https://pith.science/pith/LTDO6QDPMNTY25Z7PKVDFL34KN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LTDO6QDPMNTY25Z7PKVDFL34KN/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-30T09:21:54Z","links":{"resolver":"https://pith.science/pith/LTDO6QDPMNTY25Z7PKVDFL34KN","bundle":"https://pith.science/pith/LTDO6QDPMNTY25Z7PKVDFL34KN/bundle.json","state":"https://pith.science/pith/LTDO6QDPMNTY25Z7PKVDFL34KN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LTDO6QDPMNTY25Z7PKVDFL34KN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LTDO6QDPMNTY25Z7PKVDFL34KN","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":"2b14d2c09a5aced52055bbed5d1dc8dc122993ccdcc9c742ce9283692238a81f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-07-06T11:11:57Z","title_canon_sha256":"8794ac45a0ef81733ebb7211a5b3a35f8706252dbe846b900d43be5d67b9474c"},"schema_version":"1.0","source":{"id":"1007.0862","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.0862","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"arxiv_version","alias_value":"1007.0862v2","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.0862","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"pith_short_12","alias_value":"LTDO6QDPMNTY","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LTDO6QDPMNTY25Z7","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LTDO6QDP","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:cb4ce2ef03fa5f2747b66426bc11c726b5b5fe879cd03da52a6466c1fb1117a8","target":"graph","created_at":"2026-05-18T03:39:14Z","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":"We consider a model recently proposed by Chatterjee and Durrett [CD2011] as an \"annealed approximation\" of boolean networks, which are a class of cellular automata on a random graph, as defined by S. Kauffman [K69]. The starting point is a random directed graph on $n$ vertices; each vertex has $r$ input vertices pointing to it. For the model of [CD2011], a discrete time threshold contact process is then considered on this graph: at each instant, each vertex has probability $q$ of choosing to receive input; if it does, and if at least one of its input vertices were in state 1 at the previous in","authors_text":"Daniel Valesin, Thomas Mountford","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-07-06T11:11:57Z","title":"Supercriticality of Annealed Approximations of Boolean Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.0862","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:ae749a674aaaf67d51f34edbef0cb3415835b9fc578e0b3dc67206639de4ff9e","target":"record","created_at":"2026-05-18T03:39:14Z","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":"2b14d2c09a5aced52055bbed5d1dc8dc122993ccdcc9c742ce9283692238a81f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-07-06T11:11:57Z","title_canon_sha256":"8794ac45a0ef81733ebb7211a5b3a35f8706252dbe846b900d43be5d67b9474c"},"schema_version":"1.0","source":{"id":"1007.0862","kind":"arxiv","version":2}},"canonical_sha256":"5cc6ef406f63678d773f7aaa32af7c534ed072f7dcd4c8f7393d560ecef8b58b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cc6ef406f63678d773f7aaa32af7c534ed072f7dcd4c8f7393d560ecef8b58b","first_computed_at":"2026-05-18T03:39:14.845727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:14.845727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZMW8uGWn0CPVXDt5sHBll2INWHNUCoQ77jqH/TtOIMuypJWo+wJAL1Wbvug8tLcDLp7cE84V3dCf0pkMtjj5Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:14.846170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.0862","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae749a674aaaf67d51f34edbef0cb3415835b9fc578e0b3dc67206639de4ff9e","sha256:cb4ce2ef03fa5f2747b66426bc11c726b5b5fe879cd03da52a6466c1fb1117a8"],"state_sha256":"3abb917c57433e9c17b241336afbd020613727c04cc05eee7c9522b2cdf55d13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IKeRx6Dl8rdsHJcmjyb5aXoWlwDkf+h8dMU/HTW7YuX50VbhMnYiSjxkGx02knEt5uglnkp3ymDGKYrYViu8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:21:54.809198Z","bundle_sha256":"c8c9982d605e365cd8aff4a2a7d93ef7c9233897f741587bfa3ce6d89e2d6300"}}