{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HAUIII2E46ZX62G2ZJDLVPVWH3","short_pith_number":"pith:HAUIII2E","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"},"canonical_sha256":"3828842344e7b37f68daca46babeb63edb418900d683b0a26779b2a03bbbec28","source":{"kind":"arxiv","id":"1504.07404","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HAUIII2E46ZX62G2ZJDLVPVWH3","target":"record","payload":{"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"},"canonical_sha256":"3828842344e7b37f68daca46babeb63edb418900d683b0a26779b2a03bbbec28","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"},"source_kind":"arxiv","source_id":"1504.07404","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k/kgBUmnuBWB/oB99oMFIypsVj9WVmBbN9e6eG5NMZIPnNyQppsGm2Ya22pQKrjY3oKHti3yjbi7ZjjkiYQtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:34:38.465700Z"},"content_sha256":"02db1efc13896a88d34f1760814984000adf04b685daabc6c8fe40b3df7cc9fd","schema_version":"1.0","event_id":"sha256:02db1efc13896a88d34f1760814984000adf04b685daabc6c8fe40b3df7cc9fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HAUIII2E46ZX62G2ZJDLVPVWH3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:17:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xp/erZxiA0Fz9EOCefNOvbx31SksZfklC8izjl98o+94HFXZ7LSufV+lmTGqDlsy2ExJe/2bzKDyzkBPrvkADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:34:38.466047Z"},"content_sha256":"fec543e2aa2617005d73907cb11cddb1e059fb17c53d9bd8633aba64d9133c6c","schema_version":"1.0","event_id":"sha256:fec543e2aa2617005d73907cb11cddb1e059fb17c53d9bd8633aba64d9133c6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HAUIII2E46ZX62G2ZJDLVPVWH3/bundle.json","state_url":"https://pith.science/pith/HAUIII2E46ZX62G2ZJDLVPVWH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HAUIII2E46ZX62G2ZJDLVPVWH3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T14:34:38Z","links":{"resolver":"https://pith.science/pith/HAUIII2E46ZX62G2ZJDLVPVWH3","bundle":"https://pith.science/pith/HAUIII2E46ZX62G2ZJDLVPVWH3/bundle.json","state":"https://pith.science/pith/HAUIII2E46ZX62G2ZJDLVPVWH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HAUIII2E46ZX62G2ZJDLVPVWH3/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"94Nds/xpVnJfiCrtL5Dxt3eyQBH3vGEL6dfHee/zs+szXrWx5xzsKBmDPyp6rvk0aTnkr/bhlkjPXTY9c1QSAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:34:38.468069Z","bundle_sha256":"eee41313e8538ddba9a9aea5bc68c2dbb4f678c4942d7a6655e4e5fb62617b32"}}