{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:5MQHZVKRZVRSLA5D6M77JHD57A","short_pith_number":"pith:5MQHZVKR","schema_version":"1.0","canonical_sha256":"eb207cd551cd632583a3f33ff49c7df81e81b2f7d0eaa24c57290015a0cb8b59","source":{"kind":"arxiv","id":"0809.2335","version":5},"attestation_state":"computed","paper":{"title":"Infinite paths and cliques in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"A. Berarducci, M. Novaga, P. Majer","submitted_at":"2008-09-13T12:59:28Z","abstract_excerpt":"We study some percolation problems on the complete graph over $\\mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the probability, such as independency, is made. The main tools are a topological version of Ramsey theory, exchangeability theory and elementary ergodic theory."},"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":"0809.2335","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2008-09-13T12:59:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a97b71f5c0205369f1f5b9f14a4a5641a5fc2698f3c3334f3ec172668d1d933a","abstract_canon_sha256":"0279662e8ec25065e0d54820f901bb6cb9d52534107d2f4016860028069af132"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:39.343702Z","signature_b64":"RS8Zw1PW2bMWMJswNICgBnosNK98r+HndKabsWZM/fTD8FFq8vDMlWqM2tK0KL9inj5QZUqLS3UiQl4aH+azDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb207cd551cd632583a3f33ff49c7df81e81b2f7d0eaa24c57290015a0cb8b59","last_reissued_at":"2026-05-18T04:25:39.343111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:39.343111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite paths and cliques in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"A. Berarducci, M. Novaga, P. Majer","submitted_at":"2008-09-13T12:59:28Z","abstract_excerpt":"We study some percolation problems on the complete graph over $\\mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the probability, such as independency, is made. The main tools are a topological version of Ramsey theory, exchangeability theory and elementary ergodic theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.2335","kind":"arxiv","version":5},"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":"0809.2335","created_at":"2026-05-18T04:25:39.343193+00:00"},{"alias_kind":"arxiv_version","alias_value":"0809.2335v5","created_at":"2026-05-18T04:25:39.343193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.2335","created_at":"2026-05-18T04:25:39.343193+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MQHZVKRZVRS","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MQHZVKRZVRSLA5D","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MQHZVKR","created_at":"2026-05-18T12:25:56.245647+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/5MQHZVKRZVRSLA5D6M77JHD57A","json":"https://pith.science/pith/5MQHZVKRZVRSLA5D6M77JHD57A.json","graph_json":"https://pith.science/api/pith-number/5MQHZVKRZVRSLA5D6M77JHD57A/graph.json","events_json":"https://pith.science/api/pith-number/5MQHZVKRZVRSLA5D6M77JHD57A/events.json","paper":"https://pith.science/paper/5MQHZVKR"},"agent_actions":{"view_html":"https://pith.science/pith/5MQHZVKRZVRSLA5D6M77JHD57A","download_json":"https://pith.science/pith/5MQHZVKRZVRSLA5D6M77JHD57A.json","view_paper":"https://pith.science/paper/5MQHZVKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0809.2335&json=true","fetch_graph":"https://pith.science/api/pith-number/5MQHZVKRZVRSLA5D6M77JHD57A/graph.json","fetch_events":"https://pith.science/api/pith-number/5MQHZVKRZVRSLA5D6M77JHD57A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MQHZVKRZVRSLA5D6M77JHD57A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MQHZVKRZVRSLA5D6M77JHD57A/action/storage_attestation","attest_author":"https://pith.science/pith/5MQHZVKRZVRSLA5D6M77JHD57A/action/author_attestation","sign_citation":"https://pith.science/pith/5MQHZVKRZVRSLA5D6M77JHD57A/action/citation_signature","submit_replication":"https://pith.science/pith/5MQHZVKRZVRSLA5D6M77JHD57A/action/replication_record"}},"created_at":"2026-05-18T04:25:39.343193+00:00","updated_at":"2026-05-18T04:25:39.343193+00:00"}