{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:RUPRYXGXUJPMJKPCOOBA6CR4DG","short_pith_number":"pith:RUPRYXGX","canonical_record":{"source":{"id":"2205.14782","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2022-05-29T23:20:54Z","cross_cats_sorted":[],"title_canon_sha256":"3551ef319d7a74e40f4470b541f7804ece8679171602df62af7e6a3215d5ea56","abstract_canon_sha256":"88e251216742e025d7a9e860d09ad25d10ae64bdb0296bb988ad459927240a46"},"schema_version":"1.0"},"canonical_sha256":"8d1f1c5cd7a25ec4a9e273820f0a3c19b51bec5ebe60f9c51032e353b450e08d","source":{"kind":"arxiv","id":"2205.14782","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.14782","created_at":"2026-06-26T00:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"2205.14782v3","created_at":"2026-06-26T00:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14782","created_at":"2026-06-26T00:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"RUPRYXGXUJPM","created_at":"2026-06-26T00:15:21Z"},{"alias_kind":"pith_short_16","alias_value":"RUPRYXGXUJPMJKPC","created_at":"2026-06-26T00:15:21Z"},{"alias_kind":"pith_short_8","alias_value":"RUPRYXGX","created_at":"2026-06-26T00:15:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:RUPRYXGXUJPMJKPCOOBA6CR4DG","target":"record","payload":{"canonical_record":{"source":{"id":"2205.14782","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2022-05-29T23:20:54Z","cross_cats_sorted":[],"title_canon_sha256":"3551ef319d7a74e40f4470b541f7804ece8679171602df62af7e6a3215d5ea56","abstract_canon_sha256":"88e251216742e025d7a9e860d09ad25d10ae64bdb0296bb988ad459927240a46"},"schema_version":"1.0"},"canonical_sha256":"8d1f1c5cd7a25ec4a9e273820f0a3c19b51bec5ebe60f9c51032e353b450e08d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T00:15:21.419716Z","signature_b64":"/D4z213k6zOkm8kXEStTSRNG8LBJ8AIs6qv+c5rP2SdJ2GeTzbR9o1MV2K4CdC7wxLyUfvqHxi1PKAqdiN3wAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d1f1c5cd7a25ec4a9e273820f0a3c19b51bec5ebe60f9c51032e353b450e08d","last_reissued_at":"2026-06-26T00:15:21.419130Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T00:15:21.419130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.14782","source_version":3,"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-06-26T00:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPslYnIy66gJgOYcYnl6nynnDpN26ocfs2XZUjYjo/22ye6Hcibgupf4O8RZ+dBiV9xknCSMALalAAL0XVT6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:55:58.953805Z"},"content_sha256":"8d1048400fea4db00767211b77345c1230d82cd3e61d5718a49e96e99378e3f5","schema_version":"1.0","event_id":"sha256:8d1048400fea4db00767211b77345c1230d82cd3e61d5718a49e96e99378e3f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:RUPRYXGXUJPMJKPCOOBA6CR4DG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bootstrap Percolation in Random Graphs of Unbounded Rank","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jimin Lin, Nils Detering","submitted_at":"2022-05-29T23:20:54Z","abstract_excerpt":"Bootstrap percolation in (random) graphs is a contagion dynamic among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$ gets infected as soon as the number of its infected neighbors reaches $k$. This process has been studied extensively in \\textit{rank one} models. These models can generate random graphs with heavy-tailed degree sequences but they are not capable of generating networks with a flexible stochastic block structure. In this paper, we treat a class of random graphs o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14782","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.14782/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-26T00:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1yNhI8MH1TX8qPuraNq6q9UMHmpmq1ipYg8GFBAMpxuNWJWP6anhO+QvWVYz+YInnTs+8/ejQHSzXhgdTYQXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:55:58.954567Z"},"content_sha256":"928aa05549a986bb567228d8a0e3f7f0644256fedc003797151f5f382e3751fe","schema_version":"1.0","event_id":"sha256:928aa05549a986bb567228d8a0e3f7f0644256fedc003797151f5f382e3751fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG/bundle.json","state_url":"https://pith.science/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG/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-07-05T12:55:58Z","links":{"resolver":"https://pith.science/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG","bundle":"https://pith.science/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG/bundle.json","state":"https://pith.science/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:RUPRYXGXUJPMJKPCOOBA6CR4DG","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":"88e251216742e025d7a9e860d09ad25d10ae64bdb0296bb988ad459927240a46","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2022-05-29T23:20:54Z","title_canon_sha256":"3551ef319d7a74e40f4470b541f7804ece8679171602df62af7e6a3215d5ea56"},"schema_version":"1.0","source":{"id":"2205.14782","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.14782","created_at":"2026-06-26T00:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"2205.14782v3","created_at":"2026-06-26T00:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14782","created_at":"2026-06-26T00:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"RUPRYXGXUJPM","created_at":"2026-06-26T00:15:21Z"},{"alias_kind":"pith_short_16","alias_value":"RUPRYXGXUJPMJKPC","created_at":"2026-06-26T00:15:21Z"},{"alias_kind":"pith_short_8","alias_value":"RUPRYXGX","created_at":"2026-06-26T00:15:21Z"}],"graph_snapshots":[{"event_id":"sha256:928aa05549a986bb567228d8a0e3f7f0644256fedc003797151f5f382e3751fe","target":"graph","created_at":"2026-06-26T00:15:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2205.14782/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bootstrap percolation in (random) graphs is a contagion dynamic among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$ gets infected as soon as the number of its infected neighbors reaches $k$. This process has been studied extensively in \\textit{rank one} models. These models can generate random graphs with heavy-tailed degree sequences but they are not capable of generating networks with a flexible stochastic block structure. In this paper, we treat a class of random graphs o","authors_text":"Jimin Lin, Nils Detering","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2022-05-29T23:20:54Z","title":"Bootstrap Percolation in Random Graphs of Unbounded Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14782","kind":"arxiv","version":3},"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:8d1048400fea4db00767211b77345c1230d82cd3e61d5718a49e96e99378e3f5","target":"record","created_at":"2026-06-26T00:15:21Z","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":"88e251216742e025d7a9e860d09ad25d10ae64bdb0296bb988ad459927240a46","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2022-05-29T23:20:54Z","title_canon_sha256":"3551ef319d7a74e40f4470b541f7804ece8679171602df62af7e6a3215d5ea56"},"schema_version":"1.0","source":{"id":"2205.14782","kind":"arxiv","version":3}},"canonical_sha256":"8d1f1c5cd7a25ec4a9e273820f0a3c19b51bec5ebe60f9c51032e353b450e08d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d1f1c5cd7a25ec4a9e273820f0a3c19b51bec5ebe60f9c51032e353b450e08d","first_computed_at":"2026-06-26T00:15:21.419130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-26T00:15:21.419130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/D4z213k6zOkm8kXEStTSRNG8LBJ8AIs6qv+c5rP2SdJ2GeTzbR9o1MV2K4CdC7wxLyUfvqHxi1PKAqdiN3wAA==","signature_status":"signed_v1","signed_at":"2026-06-26T00:15:21.419716Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.14782","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d1048400fea4db00767211b77345c1230d82cd3e61d5718a49e96e99378e3f5","sha256:928aa05549a986bb567228d8a0e3f7f0644256fedc003797151f5f382e3751fe"],"state_sha256":"aaa0fc6980ed6197395c9287cb82f9bcc802c1abbe3e474912e903c746becb40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ja3QPH0sciuMj8hum2emLIHjqF4o5drC42vxgQ0ZS9RNHRdrPglkeBJx5tiKFLXPvd8rep/wnDiZFkIwLIFkAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T12:55:58.957728Z","bundle_sha256":"7f71cbf831b2e256aef05fa8aaa5c98618a0152d33ec7fb723bddca1b717194c"}}