{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JJJV4JKKYDEUWYRQONCWAZTMQK","short_pith_number":"pith:JJJV4JKK","schema_version":"1.0","canonical_sha256":"4a535e254ac0c94b6230734560666c82bce90f4bd1dadaf697085c67641775c1","source":{"kind":"arxiv","id":"1502.01490","version":2},"attestation_state":"computed","paper":{"title":"Bootstrap percolation on a graph with random and local connections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Tatyana Turova, Thomas Vallier","submitted_at":"2015-02-05T10:30:33Z","abstract_excerpt":"Let $G_{n,p}^1$ be a superposition of the random graph $G_{n,p}$ and a one-dimensional lattice: the $n$ vertices are set to be on a ring with fixed edges between the consecutive vertices, and with random independent edges given with probability $p$ between any pair of vertices. Bootstrap percolation on a random graph is a process of spread of \"activation\" on a given realisation of the graph with a given number of initially active nodes. At each step those vertices which have not been active but have at least $r \\geq 2$ active neighbours become active as well. We study the size of the final act"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1502.01490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-02-05T10:30:33Z","cross_cats_sorted":[],"title_canon_sha256":"7932219f1ab8f17e44ecfbe4e1efa022fdf6a2bf6f51990e22b9b3438b8c0c41","abstract_canon_sha256":"04d63283f758ececdfb13f47fbd63f284da297c88664f3d7406b45e64365a475"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:24.696067Z","signature_b64":"YFTd/jzCm7s4UQC7udoot7sXVJLCDijAy98ENXtTTIe10pl8EBEmGsu4JhbjA9viFNTAbmTlBIftl+UELCm9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a535e254ac0c94b6230734560666c82bce90f4bd1dadaf697085c67641775c1","last_reissued_at":"2026-05-18T01:34:24.695545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:24.695545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bootstrap percolation on a graph with random and local connections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Tatyana Turova, Thomas Vallier","submitted_at":"2015-02-05T10:30:33Z","abstract_excerpt":"Let $G_{n,p}^1$ be a superposition of the random graph $G_{n,p}$ and a one-dimensional lattice: the $n$ vertices are set to be on a ring with fixed edges between the consecutive vertices, and with random independent edges given with probability $p$ between any pair of vertices. Bootstrap percolation on a random graph is a process of spread of \"activation\" on a given realisation of the graph with a given number of initially active nodes. At each step those vertices which have not been active but have at least $r \\geq 2$ active neighbours become active as well. We study the size of the final act"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01490","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.01490","created_at":"2026-05-18T01:34:24.695629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.01490v2","created_at":"2026-05-18T01:34:24.695629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01490","created_at":"2026-05-18T01:34:24.695629+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJJV4JKKYDEU","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJJV4JKKYDEUWYRQ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJJV4JKK","created_at":"2026-05-18T12:29:27.538025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JJJV4JKKYDEUWYRQONCWAZTMQK","json":"https://pith.science/pith/JJJV4JKKYDEUWYRQONCWAZTMQK.json","graph_json":"https://pith.science/api/pith-number/JJJV4JKKYDEUWYRQONCWAZTMQK/graph.json","events_json":"https://pith.science/api/pith-number/JJJV4JKKYDEUWYRQONCWAZTMQK/events.json","paper":"https://pith.science/paper/JJJV4JKK"},"agent_actions":{"view_html":"https://pith.science/pith/JJJV4JKKYDEUWYRQONCWAZTMQK","download_json":"https://pith.science/pith/JJJV4JKKYDEUWYRQONCWAZTMQK.json","view_paper":"https://pith.science/paper/JJJV4JKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.01490&json=true","fetch_graph":"https://pith.science/api/pith-number/JJJV4JKKYDEUWYRQONCWAZTMQK/graph.json","fetch_events":"https://pith.science/api/pith-number/JJJV4JKKYDEUWYRQONCWAZTMQK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJJV4JKKYDEUWYRQONCWAZTMQK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJJV4JKKYDEUWYRQONCWAZTMQK/action/storage_attestation","attest_author":"https://pith.science/pith/JJJV4JKKYDEUWYRQONCWAZTMQK/action/author_attestation","sign_citation":"https://pith.science/pith/JJJV4JKKYDEUWYRQONCWAZTMQK/action/citation_signature","submit_replication":"https://pith.science/pith/JJJV4JKKYDEUWYRQONCWAZTMQK/action/replication_record"}},"created_at":"2026-05-18T01:34:24.695629+00:00","updated_at":"2026-05-18T01:34:24.695629+00:00"}