{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RC6KLKBWIWMWCSU4XPYA3JXAEJ","short_pith_number":"pith:RC6KLKBW","canonical_record":{"source":{"id":"1505.03204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-13T00:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"746d4933c837c577b4f935385f0051e480ea6ae4f1837bbc072044eebabe4017","abstract_canon_sha256":"76376a353d2a67a616d52da5d92c6622dcac829716b40a28afa1decc37585f0a"},"schema_version":"1.0"},"canonical_sha256":"88bca5a8364599614a9cbbf00da6e02260eb1543ed2a5039c1ef29e65d394b17","source":{"kind":"arxiv","id":"1505.03204","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03204","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03204v1","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03204","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"RC6KLKBWIWMW","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RC6KLKBWIWMWCSU4","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RC6KLKBW","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RC6KLKBWIWMWCSU4XPYA3JXAEJ","target":"record","payload":{"canonical_record":{"source":{"id":"1505.03204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-13T00:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"746d4933c837c577b4f935385f0051e480ea6ae4f1837bbc072044eebabe4017","abstract_canon_sha256":"76376a353d2a67a616d52da5d92c6622dcac829716b40a28afa1decc37585f0a"},"schema_version":"1.0"},"canonical_sha256":"88bca5a8364599614a9cbbf00da6e02260eb1543ed2a5039c1ef29e65d394b17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:12:10.143360Z","signature_b64":"LVKvenZim3YbLHOAHaoFRbaotqPq5xgrTu6o2KmmnLeELpzm+5xmR0WQ07uFJwbnAx7QunBNiVNUEBhYa+BnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88bca5a8364599614a9cbbf00da6e02260eb1543ed2a5039c1ef29e65d394b17","last_reissued_at":"2026-05-18T02:12:10.142633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:12:10.142633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.03204","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-18T02:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bGYw508DrXzacrHYzw1dIZ0SNcaxVL1yGUJ3RGYWiGloaiTZb42uHCXq2/FOl7ltCLRnizZFrn1EMI4AvcphBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:26:56.226593Z"},"content_sha256":"68738cedf72b08f5683f58c1e44007c18c8e8f3b9817d6d28d5c38fa0abecbea","schema_version":"1.0","event_id":"sha256:68738cedf72b08f5683f58c1e44007c18c8e8f3b9817d6d28d5c38fa0abecbea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RC6KLKBWIWMWCSU4XPYA3JXAEJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bootstrap percolation on products of cycles and complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David Sivakoff, Janko Gravner","submitted_at":"2015-05-13T00:36:20Z","abstract_excerpt":"Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning occurs if every point eventually becomes occupied. The main question concerns the critical probability, that is, the minimal initial density that makes spanning likely. The graphs we consider are products of cycles of $m$ points and complete graphs of $n$ points. The major part of the paper focuses on the case when two factors are complete graphs and one fac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03204","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-18T02:12:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BXITedLGaOzTFQrh2pcg9E3snw3TY4GRzEXGQdEoHtayansqXv0bpPnWMztLmrqOl2wP2cG3+f4OLOO5eNlRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:26:56.226942Z"},"content_sha256":"e553f39ac9572eb4e497fd1c2898ebdeb05667aba5401cbf3a48ba78bd8d2d84","schema_version":"1.0","event_id":"sha256:e553f39ac9572eb4e497fd1c2898ebdeb05667aba5401cbf3a48ba78bd8d2d84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RC6KLKBWIWMWCSU4XPYA3JXAEJ/bundle.json","state_url":"https://pith.science/pith/RC6KLKBWIWMWCSU4XPYA3JXAEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RC6KLKBWIWMWCSU4XPYA3JXAEJ/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-21T21:26:56Z","links":{"resolver":"https://pith.science/pith/RC6KLKBWIWMWCSU4XPYA3JXAEJ","bundle":"https://pith.science/pith/RC6KLKBWIWMWCSU4XPYA3JXAEJ/bundle.json","state":"https://pith.science/pith/RC6KLKBWIWMWCSU4XPYA3JXAEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RC6KLKBWIWMWCSU4XPYA3JXAEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RC6KLKBWIWMWCSU4XPYA3JXAEJ","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":"76376a353d2a67a616d52da5d92c6622dcac829716b40a28afa1decc37585f0a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-13T00:36:20Z","title_canon_sha256":"746d4933c837c577b4f935385f0051e480ea6ae4f1837bbc072044eebabe4017"},"schema_version":"1.0","source":{"id":"1505.03204","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.03204","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.03204v1","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.03204","created_at":"2026-05-18T02:12:10Z"},{"alias_kind":"pith_short_12","alias_value":"RC6KLKBWIWMW","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RC6KLKBWIWMWCSU4","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RC6KLKBW","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:e553f39ac9572eb4e497fd1c2898ebdeb05667aba5401cbf3a48ba78bd8d2d84","target":"graph","created_at":"2026-05-18T02:12: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":"Bootstrap percolation on a graph iteratively enlarges a set of occupied sites by adjoining points with at least $\\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product measure, and we say that spanning occurs if every point eventually becomes occupied. The main question concerns the critical probability, that is, the minimal initial density that makes spanning likely. The graphs we consider are products of cycles of $m$ points and complete graphs of $n$ points. The major part of the paper focuses on the case when two factors are complete graphs and one fac","authors_text":"David Sivakoff, Janko Gravner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-13T00:36:20Z","title":"Bootstrap percolation on products of cycles and complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.03204","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:68738cedf72b08f5683f58c1e44007c18c8e8f3b9817d6d28d5c38fa0abecbea","target":"record","created_at":"2026-05-18T02:12: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":"76376a353d2a67a616d52da5d92c6622dcac829716b40a28afa1decc37585f0a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-13T00:36:20Z","title_canon_sha256":"746d4933c837c577b4f935385f0051e480ea6ae4f1837bbc072044eebabe4017"},"schema_version":"1.0","source":{"id":"1505.03204","kind":"arxiv","version":1}},"canonical_sha256":"88bca5a8364599614a9cbbf00da6e02260eb1543ed2a5039c1ef29e65d394b17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88bca5a8364599614a9cbbf00da6e02260eb1543ed2a5039c1ef29e65d394b17","first_computed_at":"2026-05-18T02:12:10.142633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:12:10.142633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LVKvenZim3YbLHOAHaoFRbaotqPq5xgrTu6o2KmmnLeELpzm+5xmR0WQ07uFJwbnAx7QunBNiVNUEBhYa+BnAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:12:10.143360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.03204","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68738cedf72b08f5683f58c1e44007c18c8e8f3b9817d6d28d5c38fa0abecbea","sha256:e553f39ac9572eb4e497fd1c2898ebdeb05667aba5401cbf3a48ba78bd8d2d84"],"state_sha256":"38d8d102ddfbcba9a5c28332960a98559bba73511b14d2d6b4b0cfd081082a03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T8/WNp2hUddAbtdVDnI8rorFMnUwNsglBd4tZJmIajxJBbUPHCbK6ejGGRhbEWkihmQ0HK/BsdLRHGQJ4nHvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:26:56.228892Z","bundle_sha256":"3b5d2d5ede333ec85256f3177dcd6c67f5e18f6c95d498962bcf43f28ea3d9e7"}}