{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MVLRTNB54XNKQBJEC4CU3NKJRW","short_pith_number":"pith:MVLRTNB5","schema_version":"1.0","canonical_sha256":"655719b43de5daa8052417054db5498d89720e0deb9dffc6d48530be9ed1d052","source":{"kind":"arxiv","id":"2411.02917","version":1},"attestation_state":"computed","paper":{"title":"Stein's Method for Spatial Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dominic Schuhmacher, Leoni Carla Wirth","submitted_at":"2024-11-05T09:03:05Z","abstract_excerpt":"In this article, we derive Stein's method for approximating a spatial random graph by a generalised random geometric graph, which has vertices given by a finite Gibbs point process and edges based on a general connection function. Our main theorems provide explicit upper bounds for integral probability metrics and, at improved rates, a recently introduced Wasserstein metric for random graph distributions. The bounds are in terms of a vertex error term based on the Papangelou kernels of the vertex point processes and two edge error terms based on conditional edge probabilities. In addition to p"},"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":"2411.02917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-11-05T09:03:05Z","cross_cats_sorted":[],"title_canon_sha256":"2b3fec2085f99f54b92bf11835475c8d680cb7ec977b1c8790d65a961bf53bff","abstract_canon_sha256":"7d9dc9fc5abd1bf0f44a77e95ffee4cd0221c91ce77e217875346c8a960dc43f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:20.305093Z","signature_b64":"eX5wNd1pdsCPqF+zCMObQLb4oCYoQY/Z08dXgAaYhBRmYcibbBhieXZUcyVeCR2Ynz1G8PHo3ni9byEXTDw4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"655719b43de5daa8052417054db5498d89720e0deb9dffc6d48530be9ed1d052","last_reissued_at":"2026-07-05T09:31:20.304633Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:20.304633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stein's Method for Spatial Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Dominic Schuhmacher, Leoni Carla Wirth","submitted_at":"2024-11-05T09:03:05Z","abstract_excerpt":"In this article, we derive Stein's method for approximating a spatial random graph by a generalised random geometric graph, which has vertices given by a finite Gibbs point process and edges based on a general connection function. Our main theorems provide explicit upper bounds for integral probability metrics and, at improved rates, a recently introduced Wasserstein metric for random graph distributions. The bounds are in terms of a vertex error term based on the Papangelou kernels of the vertex point processes and two edge error terms based on conditional edge probabilities. In addition to p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02917","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/2411.02917/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":"2411.02917","created_at":"2026-07-05T09:31:20.304692+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.02917v1","created_at":"2026-07-05T09:31:20.304692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02917","created_at":"2026-07-05T09:31:20.304692+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVLRTNB54XNK","created_at":"2026-07-05T09:31:20.304692+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVLRTNB54XNKQBJE","created_at":"2026-07-05T09:31:20.304692+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVLRTNB5","created_at":"2026-07-05T09:31:20.304692+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.03442","citing_title":"Stein's method in network analysis","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MVLRTNB54XNKQBJEC4CU3NKJRW","json":"https://pith.science/pith/MVLRTNB54XNKQBJEC4CU3NKJRW.json","graph_json":"https://pith.science/api/pith-number/MVLRTNB54XNKQBJEC4CU3NKJRW/graph.json","events_json":"https://pith.science/api/pith-number/MVLRTNB54XNKQBJEC4CU3NKJRW/events.json","paper":"https://pith.science/paper/MVLRTNB5"},"agent_actions":{"view_html":"https://pith.science/pith/MVLRTNB54XNKQBJEC4CU3NKJRW","download_json":"https://pith.science/pith/MVLRTNB54XNKQBJEC4CU3NKJRW.json","view_paper":"https://pith.science/paper/MVLRTNB5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.02917&json=true","fetch_graph":"https://pith.science/api/pith-number/MVLRTNB54XNKQBJEC4CU3NKJRW/graph.json","fetch_events":"https://pith.science/api/pith-number/MVLRTNB54XNKQBJEC4CU3NKJRW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVLRTNB54XNKQBJEC4CU3NKJRW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVLRTNB54XNKQBJEC4CU3NKJRW/action/storage_attestation","attest_author":"https://pith.science/pith/MVLRTNB54XNKQBJEC4CU3NKJRW/action/author_attestation","sign_citation":"https://pith.science/pith/MVLRTNB54XNKQBJEC4CU3NKJRW/action/citation_signature","submit_replication":"https://pith.science/pith/MVLRTNB54XNKQBJEC4CU3NKJRW/action/replication_record"}},"created_at":"2026-07-05T09:31:20.304692+00:00","updated_at":"2026-07-05T09:31:20.304692+00:00"}