{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DRFTOC3V3QXY3BCOX6AW4572JC","short_pith_number":"pith:DRFTOC3V","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"},"canonical_sha256":"1c4b370b75dc2f8d844ebf816e77fa488a990bcdb6c1f2a911e7e2ae4a4866e9","source":{"kind":"arxiv","id":"1605.07002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07002","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07002v1","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07002","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"pith_short_12","alias_value":"DRFTOC3V3QXY","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DRFTOC3V3QXY3BCO","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DRFTOC3V","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DRFTOC3V3QXY3BCOX6AW4572JC","target":"record","payload":{"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"},"canonical_sha256":"1c4b370b75dc2f8d844ebf816e77fa488a990bcdb6c1f2a911e7e2ae4a4866e9","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"},"source_kind":"arxiv","source_id":"1605.07002","source_version":1,"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:14:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZJbVJu/Wu8kBoMaD1ezvAtlU3UjKpftQPhiIUIAH8IjbB8DyiZhz2cBalxVedlgfuqE3KFkWWI4r0ChMsjjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:49:39.960999Z"},"content_sha256":"a8837e0182d12c6de3fd0199011345865011799918e0d2ec7c8b2708dba30af8","schema_version":"1.0","event_id":"sha256:a8837e0182d12c6de3fd0199011345865011799918e0d2ec7c8b2708dba30af8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DRFTOC3V3QXY3BCOX6AW4572JC","target":"graph","payload":{"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"},"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:14:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zrhoijkcxufpJrZTWmhSc5VbMh3BsrxaMzX5scZ8WkkcISjNlA7tJVzvUUJ+fhibNGUiXeZJKTAtiI+sb2TTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:49:39.961627Z"},"content_sha256":"7e3637607181467a8aebce5c0eac8368758ec0dce421ea6abedc63b30a9b32d9","schema_version":"1.0","event_id":"sha256:7e3637607181467a8aebce5c0eac8368758ec0dce421ea6abedc63b30a9b32d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DRFTOC3V3QXY3BCOX6AW4572JC/bundle.json","state_url":"https://pith.science/pith/DRFTOC3V3QXY3BCOX6AW4572JC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DRFTOC3V3QXY3BCOX6AW4572JC/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-31T01:49:39Z","links":{"resolver":"https://pith.science/pith/DRFTOC3V3QXY3BCOX6AW4572JC","bundle":"https://pith.science/pith/DRFTOC3V3QXY3BCOX6AW4572JC/bundle.json","state":"https://pith.science/pith/DRFTOC3V3QXY3BCOX6AW4572JC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DRFTOC3V3QXY3BCOX6AW4572JC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DRFTOC3V3QXY3BCOX6AW4572JC","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":"34ef9f5e33bc9b2cf8de7947f10345b4c46bef8de8ed08f39d6bc72185340714","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-23T13:00:13Z","title_canon_sha256":"28d25cf206461ed8945fb8eefaf995f53657adbe1823f5cbaccd7523cc91dec5"},"schema_version":"1.0","source":{"id":"1605.07002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07002","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07002v1","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07002","created_at":"2026-05-18T01:14:10Z"},{"alias_kind":"pith_short_12","alias_value":"DRFTOC3V3QXY","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DRFTOC3V3QXY3BCO","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DRFTOC3V","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:7e3637607181467a8aebce5c0eac8368758ec0dce421ea6abedc63b30a9b32d9","target":"graph","created_at":"2026-05-18T01:14:10Z","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":"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","authors_text":"Marinus Gottschau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-23T13:00:13Z","title":"Bootstrap Percolation on Degenerate Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07002","kind":"arxiv","version":1},"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:a8837e0182d12c6de3fd0199011345865011799918e0d2ec7c8b2708dba30af8","target":"record","created_at":"2026-05-18T01:14:10Z","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":"34ef9f5e33bc9b2cf8de7947f10345b4c46bef8de8ed08f39d6bc72185340714","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-23T13:00:13Z","title_canon_sha256":"28d25cf206461ed8945fb8eefaf995f53657adbe1823f5cbaccd7523cc91dec5"},"schema_version":"1.0","source":{"id":"1605.07002","kind":"arxiv","version":1}},"canonical_sha256":"1c4b370b75dc2f8d844ebf816e77fa488a990bcdb6c1f2a911e7e2ae4a4866e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c4b370b75dc2f8d844ebf816e77fa488a990bcdb6c1f2a911e7e2ae4a4866e9","first_computed_at":"2026-05-18T01:14:10.613648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:10.613648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NGfL7nOjqOzVyMg3QOFzDb1BxdJWUiQWRVSfZinbY/pgp+myJ6tcrQiaVV+goWs6va8CDq811Cl7uhB6bo4UDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:10.614259Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8837e0182d12c6de3fd0199011345865011799918e0d2ec7c8b2708dba30af8","sha256:7e3637607181467a8aebce5c0eac8368758ec0dce421ea6abedc63b30a9b32d9"],"state_sha256":"c5082f4bbcb06cd1500f9270ba09cfd632f788c01189fedcd32724fe6f5993d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86fti2NeeRD5NCj/5CvwHWBup06LHQDWi4xNkVH/OMaFtY1LjRB/Di+BGucXgMq+U97S0aH7knP8My7dPMbODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:49:39.966249Z","bundle_sha256":"74bd9ffe790670834a04d81d6739dad534c2f0398eb37d99c283fa616d45c56f"}}