{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DRFTOC3V3QXY3BCOX6AW4572JC","short_pith_number":"pith:DRFTOC3V","schema_version":"1.0","canonical_sha256":"1c4b370b75dc2f8d844ebf816e77fa488a990bcdb6c1f2a911e7e2ae4a4866e9","source":{"kind":"arxiv","id":"1605.07002","version":1},"attestation_state":"computed","paper":{"title":"Bootstrap Percolation on Degenerate Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marinus Gottschau","submitted_at":"2016-05-23T13:00:13Z","abstract_excerpt":"In this paper we focus on $r$-neighbor bootstrap percolation, which is a process on a graph where initially a set $A_0$ of vertices gets infected. Now subsequently, an uninfected vertex becomes infected if it is adjacent to at least $r$ infected vertices. Call $A_f$ the set of vertices that is infected after the process stops. More formally set $A_t:=A_{t-1}\\cup \\{v\\in V: |N(v)\\cap A_{t-1}|\\geq r\\}$, where $N(v)$ is the neighborhood of $v$. Then $A_f=\\bigcup_{t>0} A_t$. We deal with finite graphs only and denote by $n$ the number of vertices. We are mainly interested in the size of the final s"},"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":"1605.07002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-23T13:00:13Z","cross_cats_sorted":[],"title_canon_sha256":"28d25cf206461ed8945fb8eefaf995f53657adbe1823f5cbaccd7523cc91dec5","abstract_canon_sha256":"34ef9f5e33bc9b2cf8de7947f10345b4c46bef8de8ed08f39d6bc72185340714"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:10.614259Z","signature_b64":"NGfL7nOjqOzVyMg3QOFzDb1BxdJWUiQWRVSfZinbY/pgp+myJ6tcrQiaVV+goWs6va8CDq811Cl7uhB6bo4UDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c4b370b75dc2f8d844ebf816e77fa488a990bcdb6c1f2a911e7e2ae4a4866e9","last_reissued_at":"2026-05-18T01:14:10.613648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:10.613648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bootstrap Percolation on Degenerate Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marinus Gottschau","submitted_at":"2016-05-23T13:00:13Z","abstract_excerpt":"In this paper we focus on $r$-neighbor bootstrap percolation, which is a process on a graph where initially a set $A_0$ of vertices gets infected. Now subsequently, an uninfected vertex becomes infected if it is adjacent to at least $r$ infected vertices. Call $A_f$ the set of vertices that is infected after the process stops. More formally set $A_t:=A_{t-1}\\cup \\{v\\in V: |N(v)\\cap A_{t-1}|\\geq r\\}$, where $N(v)$ is the neighborhood of $v$. Then $A_f=\\bigcup_{t>0} A_t$. We deal with finite graphs only and denote by $n$ the number of vertices. We are mainly interested in the size of the final s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07002","kind":"arxiv","version":1},"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":"1605.07002","created_at":"2026-05-18T01:14:10.613729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.07002v1","created_at":"2026-05-18T01:14:10.613729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07002","created_at":"2026-05-18T01:14:10.613729+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRFTOC3V3QXY","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRFTOC3V3QXY3BCO","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRFTOC3V","created_at":"2026-05-18T12:30:12.583610+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/DRFTOC3V3QXY3BCOX6AW4572JC","json":"https://pith.science/pith/DRFTOC3V3QXY3BCOX6AW4572JC.json","graph_json":"https://pith.science/api/pith-number/DRFTOC3V3QXY3BCOX6AW4572JC/graph.json","events_json":"https://pith.science/api/pith-number/DRFTOC3V3QXY3BCOX6AW4572JC/events.json","paper":"https://pith.science/paper/DRFTOC3V"},"agent_actions":{"view_html":"https://pith.science/pith/DRFTOC3V3QXY3BCOX6AW4572JC","download_json":"https://pith.science/pith/DRFTOC3V3QXY3BCOX6AW4572JC.json","view_paper":"https://pith.science/paper/DRFTOC3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.07002&json=true","fetch_graph":"https://pith.science/api/pith-number/DRFTOC3V3QXY3BCOX6AW4572JC/graph.json","fetch_events":"https://pith.science/api/pith-number/DRFTOC3V3QXY3BCOX6AW4572JC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRFTOC3V3QXY3BCOX6AW4572JC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRFTOC3V3QXY3BCOX6AW4572JC/action/storage_attestation","attest_author":"https://pith.science/pith/DRFTOC3V3QXY3BCOX6AW4572JC/action/author_attestation","sign_citation":"https://pith.science/pith/DRFTOC3V3QXY3BCOX6AW4572JC/action/citation_signature","submit_replication":"https://pith.science/pith/DRFTOC3V3QXY3BCOX6AW4572JC/action/replication_record"}},"created_at":"2026-05-18T01:14:10.613729+00:00","updated_at":"2026-05-18T01:14:10.613729+00:00"}