{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:XS4B5YK3GLNEZTMF7C5HQGCI52","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":"5bc3ada032766f08e971f02c75130746087b761ec01f317004b8b7f78083ea80","cross_cats_sorted":["cond-mat.stat-mech","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-05T18:40:49Z","title_canon_sha256":"218c248cdaac1705bb994e7ee5b226f81f79409856a1db43a2289a54ccbf35cd"},"schema_version":"1.0","source":{"id":"1111.1339","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1339","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1339v2","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1339","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"pith_short_12","alias_value":"XS4B5YK3GLNE","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"XS4B5YK3GLNEZTMF","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"XS4B5YK3","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:c689cb522c8f476766cc10d2fa5e551be0dc9c2fbd5efc23739b308c40bf3b3d","target":"graph","created_at":"2026-05-18T03:15:57Z","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":"A bootstrap percolation process on a graph $G$ is an \"infection\" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round each uninfected node which has at least $r$ infected neighbours becomes infected and remains so forever. The parameter $r\\geq 2$ is fixed. Such processes have been used as models for the spread of ideas or trends within a network of individuals.\n  We analyse bootstrap percolation process in the case where the underlying graph is an inhomogeneous random graph, which exhibits a power-law degree distribution, and initially th","authors_text":"Hamed Amini, Nikolaos Fountoulakis","cross_cats":["cond-mat.stat-mech","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-05T18:40:49Z","title":"Bootstrap percolation in power-law random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1339","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:e8491381bd2dbc6ece5fee2423795462cd4c017da3252a955cd7eb102a92968b","target":"record","created_at":"2026-05-18T03:15:57Z","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":"5bc3ada032766f08e971f02c75130746087b761ec01f317004b8b7f78083ea80","cross_cats_sorted":["cond-mat.stat-mech","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-05T18:40:49Z","title_canon_sha256":"218c248cdaac1705bb994e7ee5b226f81f79409856a1db43a2289a54ccbf35cd"},"schema_version":"1.0","source":{"id":"1111.1339","kind":"arxiv","version":2}},"canonical_sha256":"bcb81ee15b32da4ccd85f8ba781848eea96f70fae1977261e3b8afbc76e693dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcb81ee15b32da4ccd85f8ba781848eea96f70fae1977261e3b8afbc76e693dc","first_computed_at":"2026-05-18T03:15:57.878048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:57.878048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5dSQ4MxNLdWDMdBFjgrAaEF4OTi+3t5EksW7xgiqBPKE3hZrXl3NmwqRkyg1bvGbTwdQ8lHwyYszZ7UX90IlCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:57.878611Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1339","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8491381bd2dbc6ece5fee2423795462cd4c017da3252a955cd7eb102a92968b","sha256:c689cb522c8f476766cc10d2fa5e551be0dc9c2fbd5efc23739b308c40bf3b3d"],"state_sha256":"875bf295c38868337331df4150eabb945d374e33e194413686f172827ff3b913"}