{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QBAJBQ4GZQNAIDZIKMUWFHUY2E","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":"3b7709feff8fdfe0845293cdf291b4c75c732eeb2d9519548dc475d06829ddc4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-06T11:53:21Z","title_canon_sha256":"857c78b6b31f6b33137663fd61577122c34bc1f7d06aee35dd7f4ab00b411589"},"schema_version":"1.0","source":{"id":"1905.01942","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01942","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01942v1","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01942","created_at":"2026-05-17T23:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"QBAJBQ4GZQNA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QBAJBQ4GZQNAIDZI","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QBAJBQ4G","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:611d109b7b98dee15ad27c668dddaa2bbe2d325809c4ad8848fa116f60f77f46","target":"graph","created_at":"2026-05-17T23:46:56Z","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":"For any integer $r\\geqslant0$, the $r$-neighbor bootstrap percolation on a graph is an activation process of the vertices. The process starts with some initially activated vertices and then, in each round, any inactive vertex with at least $r$ active neighbors becomes activated. A set of initially activated vertices leading to the activation of all vertices is said to be a percolating set. Denote the minimum size of a percolating set in the $r$-neighbor bootstrap percolation process on a graph $G$ by $m(G, r)$. In this paper, we present upper and lower bounds on $m(K_n^d, r)$, where $K_n^d$ is","authors_text":"A. Mohammadian, B. Tayfeh-Rezaie, M.R. Bidgoli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-06T11:53:21Z","title":"Percolating sets in bootstrap percolation on the Hamming graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01942","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:f2fdfd316fd00fc3c449cda9e76e47abc20ddebc155924b4d3443e7bd09f249d","target":"record","created_at":"2026-05-17T23:46:56Z","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":"3b7709feff8fdfe0845293cdf291b4c75c732eeb2d9519548dc475d06829ddc4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-06T11:53:21Z","title_canon_sha256":"857c78b6b31f6b33137663fd61577122c34bc1f7d06aee35dd7f4ab00b411589"},"schema_version":"1.0","source":{"id":"1905.01942","kind":"arxiv","version":1}},"canonical_sha256":"804090c386cc1a040f285329629e98d138566c9fbf12323586bfec518eaeaf1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"804090c386cc1a040f285329629e98d138566c9fbf12323586bfec518eaeaf1a","first_computed_at":"2026-05-17T23:46:56.956552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:56.956552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J1uFwGI6IP3cZV2/Djb8WEFigW+rHaG4qNeG+kWAAAEKvtJBlvSSLG1FMvGemcHwyugyf9CL3HA/nMiwBuw9Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:56.957277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01942","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2fdfd316fd00fc3c449cda9e76e47abc20ddebc155924b4d3443e7bd09f249d","sha256:611d109b7b98dee15ad27c668dddaa2bbe2d325809c4ad8848fa116f60f77f46"],"state_sha256":"91cc0e86fa26f2a8c824c2b48280baac4a2c9c86f5bd2a83a705ef2f53103582"}