{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HAUIII2E46ZX62G2ZJDLVPVWH3","short_pith_number":"pith:HAUIII2E","schema_version":"1.0","canonical_sha256":"3828842344e7b37f68daca46babeb63edb418900d683b0a26779b2a03bbbec28","source":{"kind":"arxiv","id":"1504.07404","version":1},"attestation_state":"computed","paper":{"title":"Concentration for Poisson U-Statistics: Subgraph Counts in Random Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Matthias Reitzner, Sascha Bachmann","submitted_at":"2015-04-28T10:04:22Z","abstract_excerpt":"Concentration inequalities for subgraph counts in random geometric graphs built over Poisson point processes are proved. The estimates give upper bounds for the probabilities $\\mathbb{P}(N\\geq M +r)$ and $\\mathbb{P}(N\\leq M - r)$ where $M$ is either a median or the expectation of a subgraph count $N$. The bounds for the lower tail have a fast Gaussian decay and the bounds for the upper tail satisfy an optimality condition. A special feature of the presented inequalities is that the underlying Poisson process does not need to have finite intensity measure.\n  The tail estimates for subgraph coun"},"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":"1504.07404","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-28T10:04:22Z","cross_cats_sorted":[],"title_canon_sha256":"929326d986cd36aaee848400f2264d9b30a2161cbe958e119bbf39745507c07a","abstract_canon_sha256":"c295d1b116e3af2311f2fef392388c86a7b34737cc038fa6f616b8361682a02b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:34.819182Z","signature_b64":"qHReEtA27mAB6bHzSc5/qCg3IEP6KYhFLcBPwb812AjKeyHyg8yNl0fG1heiB0ktVcuyN1NXmNkG7C1waXfWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3828842344e7b37f68daca46babeb63edb418900d683b0a26779b2a03bbbec28","last_reissued_at":"2026-05-18T02:17:34.818511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:34.818511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concentration for Poisson U-Statistics: Subgraph Counts in Random Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Matthias Reitzner, Sascha Bachmann","submitted_at":"2015-04-28T10:04:22Z","abstract_excerpt":"Concentration inequalities for subgraph counts in random geometric graphs built over Poisson point processes are proved. The estimates give upper bounds for the probabilities $\\mathbb{P}(N\\geq M +r)$ and $\\mathbb{P}(N\\leq M - r)$ where $M$ is either a median or the expectation of a subgraph count $N$. The bounds for the lower tail have a fast Gaussian decay and the bounds for the upper tail satisfy an optimality condition. A special feature of the presented inequalities is that the underlying Poisson process does not need to have finite intensity measure.\n  The tail estimates for subgraph coun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07404","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":""},"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":"1504.07404","created_at":"2026-05-18T02:17:34.818609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07404v1","created_at":"2026-05-18T02:17:34.818609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07404","created_at":"2026-05-18T02:17:34.818609+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAUIII2E46ZX","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAUIII2E46ZX62G2","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAUIII2E","created_at":"2026-05-18T12:29:22.688609+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/HAUIII2E46ZX62G2ZJDLVPVWH3","json":"https://pith.science/pith/HAUIII2E46ZX62G2ZJDLVPVWH3.json","graph_json":"https://pith.science/api/pith-number/HAUIII2E46ZX62G2ZJDLVPVWH3/graph.json","events_json":"https://pith.science/api/pith-number/HAUIII2E46ZX62G2ZJDLVPVWH3/events.json","paper":"https://pith.science/paper/HAUIII2E"},"agent_actions":{"view_html":"https://pith.science/pith/HAUIII2E46ZX62G2ZJDLVPVWH3","download_json":"https://pith.science/pith/HAUIII2E46ZX62G2ZJDLVPVWH3.json","view_paper":"https://pith.science/paper/HAUIII2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07404&json=true","fetch_graph":"https://pith.science/api/pith-number/HAUIII2E46ZX62G2ZJDLVPVWH3/graph.json","fetch_events":"https://pith.science/api/pith-number/HAUIII2E46ZX62G2ZJDLVPVWH3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAUIII2E46ZX62G2ZJDLVPVWH3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAUIII2E46ZX62G2ZJDLVPVWH3/action/storage_attestation","attest_author":"https://pith.science/pith/HAUIII2E46ZX62G2ZJDLVPVWH3/action/author_attestation","sign_citation":"https://pith.science/pith/HAUIII2E46ZX62G2ZJDLVPVWH3/action/citation_signature","submit_replication":"https://pith.science/pith/HAUIII2E46ZX62G2ZJDLVPVWH3/action/replication_record"}},"created_at":"2026-05-18T02:17:34.818609+00:00","updated_at":"2026-05-18T02:17:34.818609+00:00"}