{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JTYS6YZ23NI2ST4LBQMRU3L4LK","short_pith_number":"pith:JTYS6YZ2","canonical_record":{"source":{"id":"1402.2815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-11T18:06:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0edb7e08cbae3cfbc51787231f60d9b71f5f97edd253e51224bf7b5acb7b7999","abstract_canon_sha256":"44a09391bd661b3444a0f3e18ce3caeb0abfb1e66ed2cc2a3ab63d9c75ecf980"},"schema_version":"1.0"},"canonical_sha256":"4cf12f633adb51a94f8b0c191a6d7c5a868a8a1cb4817f4fca633122d5399b0c","source":{"kind":"arxiv","id":"1402.2815","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2815","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2815v2","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2815","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"JTYS6YZ23NI2","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JTYS6YZ23NI2ST4L","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JTYS6YZ2","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JTYS6YZ23NI2ST4LBQMRU3L4LK","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-11T18:06:29Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0edb7e08cbae3cfbc51787231f60d9b71f5f97edd253e51224bf7b5acb7b7999","abstract_canon_sha256":"44a09391bd661b3444a0f3e18ce3caeb0abfb1e66ed2cc2a3ab63d9c75ecf980"},"schema_version":"1.0"},"canonical_sha256":"4cf12f633adb51a94f8b0c191a6d7c5a868a8a1cb4817f4fca633122d5399b0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:44.875830Z","signature_b64":"PlXgLXWWxd7AwnS7uyT1DmrgbY/X1ep2Ibbg86aT1TxaPj/PB8zNPTbJs8j86LN8uXIoIPcLmwFNcewxXRROAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cf12f633adb51a94f8b0c191a6d7c5a868a8a1cb4817f4fca633122d5399b0c","last_reissued_at":"2026-05-18T01:37:44.875135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:44.875135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2815","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-18T01:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CsZynlxdVsPLzjJh7R53ZmkKs0XIrKoBaXf7hG4WIg8938fgS/pejhlhZmroXBvEUD0rT8RIb+TAlClSC3OqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:16:09.152715Z"},"content_sha256":"e2e19c30c1d2ef3babe2ea0b019cc5186921d177a9a0c66e69d3f0a797fe536f","schema_version":"1.0","event_id":"sha256:e2e19c30c1d2ef3babe2ea0b019cc5186921d177a9a0c66e69d3f0a797fe536f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JTYS6YZ23NI2ST4LBQMRU3L4LK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bootstrap percolation in inhomogeneous random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Hamed Amini, Konstantinos Panagiotou, Nikolaos Fountoulakis","submitted_at":"2014-02-11T18:06:29Z","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 every uninfected node which has at least r infected neighbours becomes infected and remains so forever. The parameter r > 1 is fixed.\n  We consider this process in the case where the underlying graph is an inhomogeneous random graph whose kernel is of rank 1. Assuming that initially every vertex is infected independently with probability p > 0, we provide a law of large numbers for the number of vertices that will have been "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2815","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-18T01:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJvuApHL1lFBlrp72jdIXuur7PqLpwmnJ2ovFObFUFDMKWqO8LpLOFlkZ08fcmXESEZi0yq+yfjsTbWxJkaYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:16:09.153060Z"},"content_sha256":"ef653e24ed54cd58ea6df1b59bedc9f6e3f17c04b77ab4cc4c5aeb9f6bfad247","schema_version":"1.0","event_id":"sha256:ef653e24ed54cd58ea6df1b59bedc9f6e3f17c04b77ab4cc4c5aeb9f6bfad247"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTYS6YZ23NI2ST4LBQMRU3L4LK/bundle.json","state_url":"https://pith.science/pith/JTYS6YZ23NI2ST4LBQMRU3L4LK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTYS6YZ23NI2ST4LBQMRU3L4LK/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-24T15:16:09Z","links":{"resolver":"https://pith.science/pith/JTYS6YZ23NI2ST4LBQMRU3L4LK","bundle":"https://pith.science/pith/JTYS6YZ23NI2ST4LBQMRU3L4LK/bundle.json","state":"https://pith.science/pith/JTYS6YZ23NI2ST4LBQMRU3L4LK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTYS6YZ23NI2ST4LBQMRU3L4LK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JTYS6YZ23NI2ST4LBQMRU3L4LK","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":"44a09391bd661b3444a0f3e18ce3caeb0abfb1e66ed2cc2a3ab63d9c75ecf980","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-11T18:06:29Z","title_canon_sha256":"0edb7e08cbae3cfbc51787231f60d9b71f5f97edd253e51224bf7b5acb7b7999"},"schema_version":"1.0","source":{"id":"1402.2815","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2815","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2815v2","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2815","created_at":"2026-05-18T01:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"JTYS6YZ23NI2","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JTYS6YZ23NI2ST4L","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JTYS6YZ2","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:ef653e24ed54cd58ea6df1b59bedc9f6e3f17c04b77ab4cc4c5aeb9f6bfad247","target":"graph","created_at":"2026-05-18T01:37:44Z","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 every uninfected node which has at least r infected neighbours becomes infected and remains so forever. The parameter r > 1 is fixed.\n  We consider this process in the case where the underlying graph is an inhomogeneous random graph whose kernel is of rank 1. Assuming that initially every vertex is infected independently with probability p > 0, we provide a law of large numbers for the number of vertices that will have been ","authors_text":"Hamed Amini, Konstantinos Panagiotou, Nikolaos Fountoulakis","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-11T18:06:29Z","title":"Bootstrap percolation in inhomogeneous random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2815","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:e2e19c30c1d2ef3babe2ea0b019cc5186921d177a9a0c66e69d3f0a797fe536f","target":"record","created_at":"2026-05-18T01:37:44Z","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":"44a09391bd661b3444a0f3e18ce3caeb0abfb1e66ed2cc2a3ab63d9c75ecf980","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-02-11T18:06:29Z","title_canon_sha256":"0edb7e08cbae3cfbc51787231f60d9b71f5f97edd253e51224bf7b5acb7b7999"},"schema_version":"1.0","source":{"id":"1402.2815","kind":"arxiv","version":2}},"canonical_sha256":"4cf12f633adb51a94f8b0c191a6d7c5a868a8a1cb4817f4fca633122d5399b0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cf12f633adb51a94f8b0c191a6d7c5a868a8a1cb4817f4fca633122d5399b0c","first_computed_at":"2026-05-18T01:37:44.875135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:44.875135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PlXgLXWWxd7AwnS7uyT1DmrgbY/X1ep2Ibbg86aT1TxaPj/PB8zNPTbJs8j86LN8uXIoIPcLmwFNcewxXRROAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:44.875830Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2815","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2e19c30c1d2ef3babe2ea0b019cc5186921d177a9a0c66e69d3f0a797fe536f","sha256:ef653e24ed54cd58ea6df1b59bedc9f6e3f17c04b77ab4cc4c5aeb9f6bfad247"],"state_sha256":"326da71427cf9fb5201db23db696606390cc09ec66d203b0be4b279593c0024d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b4ftBxLxZm5rBmTZB7oymIrobB2O+ZrBNlXW06coxjrORCb7ZCEVSgTCJ0c9tIeCVcZG/qyWTMdXIoafVIOyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T15:16:09.155013Z","bundle_sha256":"cf1b807670903c33ca7457c4512d307bb0f1dfbb6cdb39bd51e62ea1704052e4"}}