{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NFNGF5V44WDDXFKFTUNAUBV57S","short_pith_number":"pith:NFNGF5V4","schema_version":"1.0","canonical_sha256":"695a62f6bce5863b95459d1a0a06bdfc9c3d6806f4b784365d6e546f90db6b67","source":{"kind":"arxiv","id":"2312.14085","version":1},"attestation_state":"computed","paper":{"title":"Percolation on preferential attachment models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Rajat Subhra Hazra, Remco van der Hofstad, Rounak Ray","submitted_at":"2023-12-21T18:02:26Z","abstract_excerpt":"We study the percolation phase transition on preferential attachment models, in which vertices enter with $m$ edges and attach proportionally to their degree plus $\\delta$. We identify the critical percolation threshold as $$\\pi_c=\\frac{\\delta}{2\\big(m(m+\\delta)+\\sqrt{m(m-1)(m+\\delta)(m+1+\\delta)}\\big)}$$ for $\\delta$ positive and $\\pi_c=0$ for non-positive values of $\\delta$. Therefore the giant component is robust for $\\delta\\in(-m,0]$, while it is not for $\\delta>0$.\n  Our proof for the critical percolation threshold consists of three main steps. First, we show that preferential attachment "},"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":"2312.14085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-12-21T18:02:26Z","cross_cats_sorted":[],"title_canon_sha256":"49e90a7a634f30fffb7a72b58dce1712fccd705000c22d0618ad72c7568941ff","abstract_canon_sha256":"c648e78a4eb19bde8ad409f4d37f61818e7b7d108abfde1be94c7ab147cf7c16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:27:00.186993Z","signature_b64":"z0Oo9gFpndaqXonqNzxcXD06/Edo6mdWaRrCmDPspckfwD6lY37bTZKC5GQDmQvPjOOg7FfnPxMlJq6X6Uv9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"695a62f6bce5863b95459d1a0a06bdfc9c3d6806f4b784365d6e546f90db6b67","last_reissued_at":"2026-07-05T07:27:00.186486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:27:00.186486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Percolation on preferential attachment models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Rajat Subhra Hazra, Remco van der Hofstad, Rounak Ray","submitted_at":"2023-12-21T18:02:26Z","abstract_excerpt":"We study the percolation phase transition on preferential attachment models, in which vertices enter with $m$ edges and attach proportionally to their degree plus $\\delta$. We identify the critical percolation threshold as $$\\pi_c=\\frac{\\delta}{2\\big(m(m+\\delta)+\\sqrt{m(m-1)(m+\\delta)(m+1+\\delta)}\\big)}$$ for $\\delta$ positive and $\\pi_c=0$ for non-positive values of $\\delta$. Therefore the giant component is robust for $\\delta\\in(-m,0]$, while it is not for $\\delta>0$.\n  Our proof for the critical percolation threshold consists of three main steps. First, we show that preferential attachment "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.14085","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.14085/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":"2312.14085","created_at":"2026-07-05T07:27:00.186553+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.14085v1","created_at":"2026-07-05T07:27:00.186553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.14085","created_at":"2026-07-05T07:27:00.186553+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFNGF5V44WDD","created_at":"2026-07-05T07:27:00.186553+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFNGF5V44WDDXFKF","created_at":"2026-07-05T07:27:00.186553+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFNGF5V4","created_at":"2026-07-05T07:27:00.186553+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04867","citing_title":"Local limit of Prim's algorithm","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NFNGF5V44WDDXFKFTUNAUBV57S","json":"https://pith.science/pith/NFNGF5V44WDDXFKFTUNAUBV57S.json","graph_json":"https://pith.science/api/pith-number/NFNGF5V44WDDXFKFTUNAUBV57S/graph.json","events_json":"https://pith.science/api/pith-number/NFNGF5V44WDDXFKFTUNAUBV57S/events.json","paper":"https://pith.science/paper/NFNGF5V4"},"agent_actions":{"view_html":"https://pith.science/pith/NFNGF5V44WDDXFKFTUNAUBV57S","download_json":"https://pith.science/pith/NFNGF5V44WDDXFKFTUNAUBV57S.json","view_paper":"https://pith.science/paper/NFNGF5V4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.14085&json=true","fetch_graph":"https://pith.science/api/pith-number/NFNGF5V44WDDXFKFTUNAUBV57S/graph.json","fetch_events":"https://pith.science/api/pith-number/NFNGF5V44WDDXFKFTUNAUBV57S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFNGF5V44WDDXFKFTUNAUBV57S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFNGF5V44WDDXFKFTUNAUBV57S/action/storage_attestation","attest_author":"https://pith.science/pith/NFNGF5V44WDDXFKFTUNAUBV57S/action/author_attestation","sign_citation":"https://pith.science/pith/NFNGF5V44WDDXFKFTUNAUBV57S/action/citation_signature","submit_replication":"https://pith.science/pith/NFNGF5V44WDDXFKFTUNAUBV57S/action/replication_record"}},"created_at":"2026-07-05T07:27:00.186553+00:00","updated_at":"2026-07-05T07:27:00.186553+00:00"}