{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4KXJGXEHIRTXNFBLOQPMSOPZI3","short_pith_number":"pith:4KXJGXEH","schema_version":"1.0","canonical_sha256":"e2ae935c87446776942b741ec939f946d97ca3d53e4ae237d0a9ba4ca3f93d6e","source":{"kind":"arxiv","id":"1506.08191","version":2},"attestation_state":"computed","paper":{"title":"Concentration for Poisson functionals: component counts in random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Sascha Bachmann","submitted_at":"2015-06-26T19:54:36Z","abstract_excerpt":"Upper bounds for the probabilities $\\mathbb{P}(F\\geq \\mathbb{E} F + r)$ and $\\mathbb{P}(F\\leq \\mathbb{E} F - r)$ are proved, where $F$ is a certain component count associated with a random geometric graph built over a Poisson point process on $\\mathbb{R}^d$. The bounds for the upper tail decay exponentially, and the lower tail estimates even have a Gaussian decay.\n  For the proof of the concentration inequalities, recently developed methods based on logarithmic Sobolev inequalities are used and enhanced. A particular advantage of this approach is that the resulting inequalities even apply in s"},"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":"1506.08191","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-06-26T19:54:36Z","cross_cats_sorted":[],"title_canon_sha256":"5866979fe5e3be7f2527caa975aae0bd291fad3985281f588f7ebe07f279347f","abstract_canon_sha256":"4b0c0ee3f0902b607129112aa952929f4695481473b0643d670b9047f9ece5b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:57.706685Z","signature_b64":"GX0KdIBgZ9OtBoIxD5FbTfsoiN7ckPvKhfVV2GZUzhr/HO9rnaJV+aXKDeZ/2TfietDUoFaS1LGqGMCpUl9NAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2ae935c87446776942b741ec939f946d97ca3d53e4ae237d0a9ba4ca3f93d6e","last_reissued_at":"2026-05-18T01:22:57.706032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:57.706032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concentration for Poisson functionals: component counts in random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Sascha Bachmann","submitted_at":"2015-06-26T19:54:36Z","abstract_excerpt":"Upper bounds for the probabilities $\\mathbb{P}(F\\geq \\mathbb{E} F + r)$ and $\\mathbb{P}(F\\leq \\mathbb{E} F - r)$ are proved, where $F$ is a certain component count associated with a random geometric graph built over a Poisson point process on $\\mathbb{R}^d$. The bounds for the upper tail decay exponentially, and the lower tail estimates even have a Gaussian decay.\n  For the proof of the concentration inequalities, recently developed methods based on logarithmic Sobolev inequalities are used and enhanced. A particular advantage of this approach is that the resulting inequalities even apply in s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08191","kind":"arxiv","version":2},"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":"1506.08191","created_at":"2026-05-18T01:22:57.706120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.08191v2","created_at":"2026-05-18T01:22:57.706120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08191","created_at":"2026-05-18T01:22:57.706120+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KXJGXEHIRTX","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KXJGXEHIRTXNFBL","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KXJGXEH","created_at":"2026-05-18T12:29:05.191682+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/4KXJGXEHIRTXNFBLOQPMSOPZI3","json":"https://pith.science/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3.json","graph_json":"https://pith.science/api/pith-number/4KXJGXEHIRTXNFBLOQPMSOPZI3/graph.json","events_json":"https://pith.science/api/pith-number/4KXJGXEHIRTXNFBLOQPMSOPZI3/events.json","paper":"https://pith.science/paper/4KXJGXEH"},"agent_actions":{"view_html":"https://pith.science/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3","download_json":"https://pith.science/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3.json","view_paper":"https://pith.science/paper/4KXJGXEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.08191&json=true","fetch_graph":"https://pith.science/api/pith-number/4KXJGXEHIRTXNFBLOQPMSOPZI3/graph.json","fetch_events":"https://pith.science/api/pith-number/4KXJGXEHIRTXNFBLOQPMSOPZI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3/action/storage_attestation","attest_author":"https://pith.science/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3/action/author_attestation","sign_citation":"https://pith.science/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3/action/citation_signature","submit_replication":"https://pith.science/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3/action/replication_record"}},"created_at":"2026-05-18T01:22:57.706120+00:00","updated_at":"2026-05-18T01:22:57.706120+00:00"}