{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HAUIII2E46ZX62G2ZJDLVPVWH3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c295d1b116e3af2311f2fef392388c86a7b34737cc038fa6f616b8361682a02b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-28T10:04:22Z","title_canon_sha256":"929326d986cd36aaee848400f2264d9b30a2161cbe958e119bbf39745507c07a"},"schema_version":"1.0","source":{"id":"1504.07404","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07404","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07404v1","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07404","created_at":"2026-05-18T02:17:34Z"},{"alias_kind":"pith_short_12","alias_value":"HAUIII2E46ZX","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"HAUIII2E46ZX62G2","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"HAUIII2E","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:fec543e2aa2617005d73907cb11cddb1e059fb17c53d9bd8633aba64d9133c6c","target":"graph","created_at":"2026-05-18T02:17:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Matthias Reitzner, Sascha Bachmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-28T10:04:22Z","title":"Concentration for Poisson U-Statistics: Subgraph Counts in Random Geometric Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07404","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:02db1efc13896a88d34f1760814984000adf04b685daabc6c8fe40b3df7cc9fd","target":"record","created_at":"2026-05-18T02:17:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c295d1b116e3af2311f2fef392388c86a7b34737cc038fa6f616b8361682a02b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-04-28T10:04:22Z","title_canon_sha256":"929326d986cd36aaee848400f2264d9b30a2161cbe958e119bbf39745507c07a"},"schema_version":"1.0","source":{"id":"1504.07404","kind":"arxiv","version":1}},"canonical_sha256":"3828842344e7b37f68daca46babeb63edb418900d683b0a26779b2a03bbbec28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3828842344e7b37f68daca46babeb63edb418900d683b0a26779b2a03bbbec28","first_computed_at":"2026-05-18T02:17:34.818511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:34.818511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qHReEtA27mAB6bHzSc5/qCg3IEP6KYhFLcBPwb812AjKeyHyg8yNl0fG1heiB0ktVcuyN1NXmNkG7C1waXfWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:34.819182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07404","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02db1efc13896a88d34f1760814984000adf04b685daabc6c8fe40b3df7cc9fd","sha256:fec543e2aa2617005d73907cb11cddb1e059fb17c53d9bd8633aba64d9133c6c"],"state_sha256":"2244bd0b08d436b1c915f917210c37a0aa0934bf8f8a9650961121ea4342c67e"}