{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:34EKX3ZA64ZR3NMUCGX3YNLVES","short_pith_number":"pith:34EKX3ZA","schema_version":"1.0","canonical_sha256":"df08abef20f7331db59411afbc357524a4be8e8241e272662489b51409cf3b7b","source":{"kind":"arxiv","id":"1011.1567","version":4},"attestation_state":"computed","paper":{"title":"A first order phase transition in the threshold-$\\theta\\ge 2$ contact process on random $r$-regular graphs and $r$-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Rick Durrett, Shirshendu Chatterjee","submitted_at":"2010-11-06T16:07:26Z","abstract_excerpt":"We consider the discrete-time threshold-$\\theta \\ge 2$ contact process on a random r-regular graph on n vertices. In this process, a vertex with at least \\theta occupied neighbors at time t will be occupied at time t+1 with probability p, and vacant otherwise. We show that if $\\theta \\ge 2$ and $r \\ge \\theta+2$, $\\epsilon_1$ is small and p is at least $p_1(\\epsilon_1)$, then starting from all vertices occupied the fraction of occupied vertices stays above $1-2\\epsilon_1$ up to time $\\exp(\\gamma_1(r)n)$ with probability at least $1 - \\exp(-\\gamma_1(r)n)$. In the other direction, we show that fo"},"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":"1011.1567","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-11-06T16:07:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"403227be97bd85a69085b180348aff7c16ce81b624c88e989b919f2ae812c912","abstract_canon_sha256":"755ab1bcbd135b9f1d91abc18a3f23982ab58bab9e2c68986a62304a32cd7a60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:14.797138Z","signature_b64":"U4qcVtAmDY5WeUiecBAQRG4R8E1NumFOjw7EsuT/dfma67j7TvSuLCaWjtQy+9SEzpVYUC2EjX3gkQezjuiPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df08abef20f7331db59411afbc357524a4be8e8241e272662489b51409cf3b7b","last_reissued_at":"2026-05-18T03:10:14.796431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:14.796431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A first order phase transition in the threshold-$\\theta\\ge 2$ contact process on random $r$-regular graphs and $r$-trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Rick Durrett, Shirshendu Chatterjee","submitted_at":"2010-11-06T16:07:26Z","abstract_excerpt":"We consider the discrete-time threshold-$\\theta \\ge 2$ contact process on a random r-regular graph on n vertices. In this process, a vertex with at least \\theta occupied neighbors at time t will be occupied at time t+1 with probability p, and vacant otherwise. We show that if $\\theta \\ge 2$ and $r \\ge \\theta+2$, $\\epsilon_1$ is small and p is at least $p_1(\\epsilon_1)$, then starting from all vertices occupied the fraction of occupied vertices stays above $1-2\\epsilon_1$ up to time $\\exp(\\gamma_1(r)n)$ with probability at least $1 - \\exp(-\\gamma_1(r)n)$. In the other direction, we show that fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1567","kind":"arxiv","version":4},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.1567","created_at":"2026-05-18T03:10:14.796548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.1567v4","created_at":"2026-05-18T03:10:14.796548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1567","created_at":"2026-05-18T03:10:14.796548+00:00"},{"alias_kind":"pith_short_12","alias_value":"34EKX3ZA64ZR","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"34EKX3ZA64ZR3NMU","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"34EKX3ZA","created_at":"2026-05-18T12:26:03.138858+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/34EKX3ZA64ZR3NMUCGX3YNLVES","json":"https://pith.science/pith/34EKX3ZA64ZR3NMUCGX3YNLVES.json","graph_json":"https://pith.science/api/pith-number/34EKX3ZA64ZR3NMUCGX3YNLVES/graph.json","events_json":"https://pith.science/api/pith-number/34EKX3ZA64ZR3NMUCGX3YNLVES/events.json","paper":"https://pith.science/paper/34EKX3ZA"},"agent_actions":{"view_html":"https://pith.science/pith/34EKX3ZA64ZR3NMUCGX3YNLVES","download_json":"https://pith.science/pith/34EKX3ZA64ZR3NMUCGX3YNLVES.json","view_paper":"https://pith.science/paper/34EKX3ZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.1567&json=true","fetch_graph":"https://pith.science/api/pith-number/34EKX3ZA64ZR3NMUCGX3YNLVES/graph.json","fetch_events":"https://pith.science/api/pith-number/34EKX3ZA64ZR3NMUCGX3YNLVES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34EKX3ZA64ZR3NMUCGX3YNLVES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34EKX3ZA64ZR3NMUCGX3YNLVES/action/storage_attestation","attest_author":"https://pith.science/pith/34EKX3ZA64ZR3NMUCGX3YNLVES/action/author_attestation","sign_citation":"https://pith.science/pith/34EKX3ZA64ZR3NMUCGX3YNLVES/action/citation_signature","submit_replication":"https://pith.science/pith/34EKX3ZA64ZR3NMUCGX3YNLVES/action/replication_record"}},"created_at":"2026-05-18T03:10:14.796548+00:00","updated_at":"2026-05-18T03:10:14.796548+00:00"}