{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4KXJGXEHIRTXNFBLOQPMSOPZI3","short_pith_number":"pith:4KXJGXEH","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"},"canonical_sha256":"e2ae935c87446776942b741ec939f946d97ca3d53e4ae237d0a9ba4ca3f93d6e","source":{"kind":"arxiv","id":"1506.08191","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08191","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08191v2","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08191","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"pith_short_12","alias_value":"4KXJGXEHIRTX","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4KXJGXEHIRTXNFBL","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4KXJGXEH","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4KXJGXEHIRTXNFBLOQPMSOPZI3","target":"record","payload":{"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"},"canonical_sha256":"e2ae935c87446776942b741ec939f946d97ca3d53e4ae237d0a9ba4ca3f93d6e","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"},"source_kind":"arxiv","source_id":"1506.08191","source_version":2,"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-18T01:22:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lswKEkTGVt2M4Mjh/4aVdQeOQ5seN+DUtBkOoUyzzTvGeiDZnP7DmXEx3VGP9i2BpmabCXfFHcQ4hHg1GZuhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:53:06.738586Z"},"content_sha256":"bd28e30047adaa24047698def00074e7a0544d74f392e0819b7d7b4d8513b88a","schema_version":"1.0","event_id":"sha256:bd28e30047adaa24047698def00074e7a0544d74f392e0819b7d7b4d8513b88a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4KXJGXEHIRTXNFBLOQPMSOPZI3","target":"graph","payload":{"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"},"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-18T01:22:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWxmKQKaiYziT+xkdn8IBDHNaxX3yCx8pdVxwHqgxobZA6HIvdnKvkJ/7LSd4RQGb6Qc4PEsRTeEMcxBs/aMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:53:06.738943Z"},"content_sha256":"09c0424ec0b1c3f512cb0eef43a4c83ebd0155797402a4416d9a16b6ad024d21","schema_version":"1.0","event_id":"sha256:09c0424ec0b1c3f512cb0eef43a4c83ebd0155797402a4416d9a16b6ad024d21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3/bundle.json","state_url":"https://pith.science/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3/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:53:06Z","links":{"resolver":"https://pith.science/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3","bundle":"https://pith.science/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3/bundle.json","state":"https://pith.science/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KXJGXEHIRTXNFBLOQPMSOPZI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4KXJGXEHIRTXNFBLOQPMSOPZI3","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":"4b0c0ee3f0902b607129112aa952929f4695481473b0643d670b9047f9ece5b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-06-26T19:54:36Z","title_canon_sha256":"5866979fe5e3be7f2527caa975aae0bd291fad3985281f588f7ebe07f279347f"},"schema_version":"1.0","source":{"id":"1506.08191","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08191","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08191v2","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08191","created_at":"2026-05-18T01:22:57Z"},{"alias_kind":"pith_short_12","alias_value":"4KXJGXEHIRTX","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4KXJGXEHIRTXNFBL","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4KXJGXEH","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:09c0424ec0b1c3f512cb0eef43a4c83ebd0155797402a4416d9a16b6ad024d21","target":"graph","created_at":"2026-05-18T01:22:57Z","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":"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","authors_text":"Sascha Bachmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-06-26T19:54:36Z","title":"Concentration for Poisson functionals: component counts in random geometric graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08191","kind":"arxiv","version":2},"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:bd28e30047adaa24047698def00074e7a0544d74f392e0819b7d7b4d8513b88a","target":"record","created_at":"2026-05-18T01:22:57Z","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":"4b0c0ee3f0902b607129112aa952929f4695481473b0643d670b9047f9ece5b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-06-26T19:54:36Z","title_canon_sha256":"5866979fe5e3be7f2527caa975aae0bd291fad3985281f588f7ebe07f279347f"},"schema_version":"1.0","source":{"id":"1506.08191","kind":"arxiv","version":2}},"canonical_sha256":"e2ae935c87446776942b741ec939f946d97ca3d53e4ae237d0a9ba4ca3f93d6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2ae935c87446776942b741ec939f946d97ca3d53e4ae237d0a9ba4ca3f93d6e","first_computed_at":"2026-05-18T01:22:57.706032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:57.706032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GX0KdIBgZ9OtBoIxD5FbTfsoiN7ckPvKhfVV2GZUzhr/HO9rnaJV+aXKDeZ/2TfietDUoFaS1LGqGMCpUl9NAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:57.706685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08191","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd28e30047adaa24047698def00074e7a0544d74f392e0819b7d7b4d8513b88a","sha256:09c0424ec0b1c3f512cb0eef43a4c83ebd0155797402a4416d9a16b6ad024d21"],"state_sha256":"d45c1d956debce2ef3e5cf825ce7a2c598330ebd712db53723b044ac55b03325"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8mS4OqNIT89eRtxc9C7VegVzoZ0tJ8ioecJu8+sBBjmlVJsRYyFbS/KCg1f2Kmdy0z5Mc54Vllug3ayNJz/VDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:53:06.744591Z","bundle_sha256":"e5399156334daae4ee87f539adbb95cc3626746ad3de96ea8eb6768037ba45e0"}}