{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GWJONSOPG6MZMV3YLKJQ7I7SXE","short_pith_number":"pith:GWJONSOP","canonical_record":{"source":{"id":"1703.10741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-31T03:22:16Z","cross_cats_sorted":[],"title_canon_sha256":"d7214500210c075d9b5f58aed0941738034ae5732b6f4cffeed07d15b4b6b12d","abstract_canon_sha256":"e4d49698303be43a683a44dff57397f66ac097c554ce9b79e9cdafa79b4bcb79"},"schema_version":"1.0"},"canonical_sha256":"3592e6c9cf37999657785a930fa3f2b925f315013dd6d8820c4d12e575bc3450","source":{"kind":"arxiv","id":"1703.10741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10741","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10741v1","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10741","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"pith_short_12","alias_value":"GWJONSOPG6MZ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GWJONSOPG6MZMV3Y","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GWJONSOP","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GWJONSOPG6MZMV3YLKJQ7I7SXE","target":"record","payload":{"canonical_record":{"source":{"id":"1703.10741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-31T03:22:16Z","cross_cats_sorted":[],"title_canon_sha256":"d7214500210c075d9b5f58aed0941738034ae5732b6f4cffeed07d15b4b6b12d","abstract_canon_sha256":"e4d49698303be43a683a44dff57397f66ac097c554ce9b79e9cdafa79b4bcb79"},"schema_version":"1.0"},"canonical_sha256":"3592e6c9cf37999657785a930fa3f2b925f315013dd6d8820c4d12e575bc3450","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:32.792384Z","signature_b64":"416TFrGhYSgeUvCM22nXcObDMnkVJx6Vj2MARIGV+Zm2iHiNo5XCItu2x+vy2cc5yP8941bHRQHE6DCGD2dcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3592e6c9cf37999657785a930fa3f2b925f315013dd6d8820c4d12e575bc3450","last_reissued_at":"2026-05-18T00:47:32.791836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:32.791836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.10741","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-18T00:47:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fc0tthYpwQnzYJ5gyKFcSVCiwsHacboRiyWm8oHwVu9bnFRSdCKQLTrZ/FktYaVjfRpHNY89HV+z4s30+bfmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:55:10.285006Z"},"content_sha256":"036c60160cda66df1302c410e72c500bbaae70985b78419021957296557178ca","schema_version":"1.0","event_id":"sha256:036c60160cda66df1302c410e72c500bbaae70985b78419021957296557178ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GWJONSOPG6MZMV3YLKJQ7I7SXE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum degree conditions for small percolating sets in bootstrap percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Karen Gunderson","submitted_at":"2017-03-31T03:22:16Z","abstract_excerpt":"The $r$-neighbour bootstrap process is an update rule for the states of vertices in which `uninfected' vertices with at least $r$ `infected' neighbours become infected and a set of initially infected vertices is said to \\emph{percolate} if eventually all vertices are infected. For every $r \\geq 3$, a sharp condition is given for the minimum degree of a sufficiently large graph that guarantees the existence of a percolating set of size $r$. In the case $r=3$, for $n$ large enough, any graph on $n$ vertices with minimum degree $\\lfloor n/2 \\rfloor +1$ has a percolating set of size $3$ and for $r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10741","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-18T00:47:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p5U8cEk5hyC5SSR7IbntLPG1O4MuUGqX1yldk2KBBBCMehUTzr4a/jRtyBRC+quJG6sMF6CsdS+MGlrSRHkmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:55:10.285375Z"},"content_sha256":"1e8f84508a1fdb6a530abf2cfb40b1074d9ad5a4f3f09f864bee26c9972c5357","schema_version":"1.0","event_id":"sha256:1e8f84508a1fdb6a530abf2cfb40b1074d9ad5a4f3f09f864bee26c9972c5357"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWJONSOPG6MZMV3YLKJQ7I7SXE/bundle.json","state_url":"https://pith.science/pith/GWJONSOPG6MZMV3YLKJQ7I7SXE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWJONSOPG6MZMV3YLKJQ7I7SXE/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-31T05:55:10Z","links":{"resolver":"https://pith.science/pith/GWJONSOPG6MZMV3YLKJQ7I7SXE","bundle":"https://pith.science/pith/GWJONSOPG6MZMV3YLKJQ7I7SXE/bundle.json","state":"https://pith.science/pith/GWJONSOPG6MZMV3YLKJQ7I7SXE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWJONSOPG6MZMV3YLKJQ7I7SXE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GWJONSOPG6MZMV3YLKJQ7I7SXE","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":"e4d49698303be43a683a44dff57397f66ac097c554ce9b79e9cdafa79b4bcb79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-31T03:22:16Z","title_canon_sha256":"d7214500210c075d9b5f58aed0941738034ae5732b6f4cffeed07d15b4b6b12d"},"schema_version":"1.0","source":{"id":"1703.10741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10741","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10741v1","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10741","created_at":"2026-05-18T00:47:32Z"},{"alias_kind":"pith_short_12","alias_value":"GWJONSOPG6MZ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GWJONSOPG6MZMV3Y","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GWJONSOP","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:1e8f84508a1fdb6a530abf2cfb40b1074d9ad5a4f3f09f864bee26c9972c5357","target":"graph","created_at":"2026-05-18T00:47:32Z","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":"The $r$-neighbour bootstrap process is an update rule for the states of vertices in which `uninfected' vertices with at least $r$ `infected' neighbours become infected and a set of initially infected vertices is said to \\emph{percolate} if eventually all vertices are infected. For every $r \\geq 3$, a sharp condition is given for the minimum degree of a sufficiently large graph that guarantees the existence of a percolating set of size $r$. In the case $r=3$, for $n$ large enough, any graph on $n$ vertices with minimum degree $\\lfloor n/2 \\rfloor +1$ has a percolating set of size $3$ and for $r","authors_text":"Karen Gunderson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-31T03:22:16Z","title":"Minimum degree conditions for small percolating sets in bootstrap percolation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10741","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:036c60160cda66df1302c410e72c500bbaae70985b78419021957296557178ca","target":"record","created_at":"2026-05-18T00:47:32Z","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":"e4d49698303be43a683a44dff57397f66ac097c554ce9b79e9cdafa79b4bcb79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-31T03:22:16Z","title_canon_sha256":"d7214500210c075d9b5f58aed0941738034ae5732b6f4cffeed07d15b4b6b12d"},"schema_version":"1.0","source":{"id":"1703.10741","kind":"arxiv","version":1}},"canonical_sha256":"3592e6c9cf37999657785a930fa3f2b925f315013dd6d8820c4d12e575bc3450","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3592e6c9cf37999657785a930fa3f2b925f315013dd6d8820c4d12e575bc3450","first_computed_at":"2026-05-18T00:47:32.791836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:32.791836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"416TFrGhYSgeUvCM22nXcObDMnkVJx6Vj2MARIGV+Zm2iHiNo5XCItu2x+vy2cc5yP8941bHRQHE6DCGD2dcBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:32.792384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.10741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:036c60160cda66df1302c410e72c500bbaae70985b78419021957296557178ca","sha256:1e8f84508a1fdb6a530abf2cfb40b1074d9ad5a4f3f09f864bee26c9972c5357"],"state_sha256":"5fa72169a1fe2a99ebec7521ef4bb27037cb908337d35da09dd58a856e6d93b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dwRxOrnqxeU0PG5NP7EDXCiWCCbnQbuSQjSjEg0OQbHmEvX5Yunss+/3v6YqNcCqCMjbWcn5pOd/UULS9zKzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:55:10.287348Z","bundle_sha256":"cdf2ae53f3eb9c5c9d51f695deb05ee1b363520cbf0f77e4b908451c219df85f"}}