{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PQPAYEZPZZN7SPT3C63MOC3OEO","short_pith_number":"pith:PQPAYEZP","schema_version":"1.0","canonical_sha256":"7c1e0c132fce5bf93e7b17b6c70b6e238df2f9e2c9d633da6c7d095c752a9d89","source":{"kind":"arxiv","id":"2506.11918","version":1},"attestation_state":"computed","paper":{"title":"Central limit theorems for the Euler characteristic in the Random Connection Model for higher-dimensional simplicial complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dominik Pabst","submitted_at":"2025-06-13T16:10:25Z","abstract_excerpt":"As generalizations of random graphs, random simplicial complexes have been receiving growing attention in the literature. In this paper, we naturally extend the Random Connection Model (RCM), a random graph that has been extensively studied for over three decades, to a random simplicial complex, recovering many models currently found in the literature as special cases. In this new model, we derive quantitative central limit theorems for a generalized Euler characteristic in various asymptotic scenarios. We will accomplish this within a very general framework, where the vertices of the simplici"},"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":"2506.11918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2025-06-13T16:10:25Z","cross_cats_sorted":[],"title_canon_sha256":"c78b76e8799dcd87abb5abbf4671d9b1d92c004b91000605d3a7d43be3f2d8ad","abstract_canon_sha256":"4a8e37afbaf8a3127fcdebcc9a102d956126947a7b027909acf19ac15eb95996"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:12.798383Z","signature_b64":"zDxo71rppO6plezt5gadrUZbJlHcwiITA6/oQrYM7tY/tan0Sl93x/I4RTm2M6JxpltcCzsWCYSnvzx1GG4FAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c1e0c132fce5bf93e7b17b6c70b6e238df2f9e2c9d633da6c7d095c752a9d89","last_reissued_at":"2026-07-05T11:21:12.797962Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:12.797962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Central limit theorems for the Euler characteristic in the Random Connection Model for higher-dimensional simplicial complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dominik Pabst","submitted_at":"2025-06-13T16:10:25Z","abstract_excerpt":"As generalizations of random graphs, random simplicial complexes have been receiving growing attention in the literature. In this paper, we naturally extend the Random Connection Model (RCM), a random graph that has been extensively studied for over three decades, to a random simplicial complex, recovering many models currently found in the literature as special cases. In this new model, we derive quantitative central limit theorems for a generalized Euler characteristic in various asymptotic scenarios. We will accomplish this within a very general framework, where the vertices of the simplici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.11918","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/2506.11918/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":"2506.11918","created_at":"2026-07-05T11:21:12.798017+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.11918v1","created_at":"2026-07-05T11:21:12.798017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.11918","created_at":"2026-07-05T11:21:12.798017+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQPAYEZPZZN7","created_at":"2026-07-05T11:21:12.798017+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQPAYEZPZZN7SPT3","created_at":"2026-07-05T11:21:12.798017+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQPAYEZP","created_at":"2026-07-05T11:21:12.798017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.15038","citing_title":"Percolation in the marked stationary Random Connection Model for higher-dimensional simplicial complexes","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PQPAYEZPZZN7SPT3C63MOC3OEO","json":"https://pith.science/pith/PQPAYEZPZZN7SPT3C63MOC3OEO.json","graph_json":"https://pith.science/api/pith-number/PQPAYEZPZZN7SPT3C63MOC3OEO/graph.json","events_json":"https://pith.science/api/pith-number/PQPAYEZPZZN7SPT3C63MOC3OEO/events.json","paper":"https://pith.science/paper/PQPAYEZP"},"agent_actions":{"view_html":"https://pith.science/pith/PQPAYEZPZZN7SPT3C63MOC3OEO","download_json":"https://pith.science/pith/PQPAYEZPZZN7SPT3C63MOC3OEO.json","view_paper":"https://pith.science/paper/PQPAYEZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.11918&json=true","fetch_graph":"https://pith.science/api/pith-number/PQPAYEZPZZN7SPT3C63MOC3OEO/graph.json","fetch_events":"https://pith.science/api/pith-number/PQPAYEZPZZN7SPT3C63MOC3OEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQPAYEZPZZN7SPT3C63MOC3OEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQPAYEZPZZN7SPT3C63MOC3OEO/action/storage_attestation","attest_author":"https://pith.science/pith/PQPAYEZPZZN7SPT3C63MOC3OEO/action/author_attestation","sign_citation":"https://pith.science/pith/PQPAYEZPZZN7SPT3C63MOC3OEO/action/citation_signature","submit_replication":"https://pith.science/pith/PQPAYEZPZZN7SPT3C63MOC3OEO/action/replication_record"}},"created_at":"2026-07-05T11:21:12.798017+00:00","updated_at":"2026-07-05T11:21:12.798017+00:00"}