{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RUPRYXGXUJPMJKPCOOBA6CR4DG","short_pith_number":"pith:RUPRYXGX","schema_version":"1.0","canonical_sha256":"8d1f1c5cd7a25ec4a9e273820f0a3c19b51bec5ebe60f9c51032e353b450e08d","source":{"kind":"arxiv","id":"2205.14782","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2205.14782","created_at":"2026-06-26T00:15:21.419200+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.14782v3","created_at":"2026-06-26T00:15:21.419200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14782","created_at":"2026-06-26T00:15:21.419200+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUPRYXGXUJPM","created_at":"2026-06-26T00:15:21.419200+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUPRYXGXUJPMJKPC","created_at":"2026-06-26T00:15:21.419200+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUPRYXGX","created_at":"2026-06-26T00:15:21.419200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG","json":"https://pith.science/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG.json","graph_json":"https://pith.science/api/pith-number/RUPRYXGXUJPMJKPCOOBA6CR4DG/graph.json","events_json":"https://pith.science/api/pith-number/RUPRYXGXUJPMJKPCOOBA6CR4DG/events.json","paper":"https://pith.science/paper/RUPRYXGX"},"agent_actions":{"view_html":"https://pith.science/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG","download_json":"https://pith.science/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG.json","view_paper":"https://pith.science/paper/RUPRYXGX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.14782&json=true","fetch_graph":"https://pith.science/api/pith-number/RUPRYXGXUJPMJKPCOOBA6CR4DG/graph.json","fetch_events":"https://pith.science/api/pith-number/RUPRYXGXUJPMJKPCOOBA6CR4DG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG/action/storage_attestation","attest_author":"https://pith.science/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG/action/author_attestation","sign_citation":"https://pith.science/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG/action/citation_signature","submit_replication":"https://pith.science/pith/RUPRYXGXUJPMJKPCOOBA6CR4DG/action/replication_record"}},"created_at":"2026-06-26T00:15:21.419200+00:00","updated_at":"2026-06-26T00:15:21.419200+00:00"}