{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AZQFYFKNCM3PRZGVFMDJFJEVRM","short_pith_number":"pith:AZQFYFKN","canonical_record":{"source":{"id":"1612.03286","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-10T12:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"61dd1c8aa4826b71cadcbc6ced585e9853e616aa968bdb079b41b96aba66deb9","abstract_canon_sha256":"9b16fb2e291ce197bf36f299839e9bff33dd010e574519138ac16ad04029c595"},"schema_version":"1.0"},"canonical_sha256":"06605c154d1336f8e4d52b0692a4958b3526d12e31dfb27be8b6921783df5500","source":{"kind":"arxiv","id":"1612.03286","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03286","created_at":"2026-05-18T00:53:29Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03286v2","created_at":"2026-05-18T00:53:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03286","created_at":"2026-05-18T00:53:29Z"},{"alias_kind":"pith_short_12","alias_value":"AZQFYFKNCM3P","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AZQFYFKNCM3PRZGV","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AZQFYFKN","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AZQFYFKNCM3PRZGVFMDJFJEVRM","target":"record","payload":{"canonical_record":{"source":{"id":"1612.03286","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-10T12:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"61dd1c8aa4826b71cadcbc6ced585e9853e616aa968bdb079b41b96aba66deb9","abstract_canon_sha256":"9b16fb2e291ce197bf36f299839e9bff33dd010e574519138ac16ad04029c595"},"schema_version":"1.0"},"canonical_sha256":"06605c154d1336f8e4d52b0692a4958b3526d12e31dfb27be8b6921783df5500","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:29.347635Z","signature_b64":"80PHj56niDC6gqh/dogsluiI/gSjjoFEwYPQQGWgrn0htGwinfVoGQJfk4RhCRJbz3RHP3zjkLmYuHVdI4HYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06605c154d1336f8e4d52b0692a4958b3526d12e31dfb27be8b6921783df5500","last_reissued_at":"2026-05-18T00:53:29.347145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:29.347145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.03286","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-18T00:53:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZmFWf5kYbxbFaf1euxkJh1rHtO3DgR7y6nuL1yegj7BzanCQvCT/Uv2Gzx0bcLrC9pxUpSyzk3Y0pEkg+fUUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:04:18.922334Z"},"content_sha256":"f5a450a24c53f29b69d1b0126bd947dcbf5a79c55e654b0e6e55739222eac539","schema_version":"1.0","event_id":"sha256:f5a450a24c53f29b69d1b0126bd947dcbf5a79c55e654b0e6e55739222eac539"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AZQFYFKNCM3PRZGVFMDJFJEVRM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gaussian fluctuations for edge counts in high-dimensional random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Christoph Thaele, Jens Grygierek","submitted_at":"2016-12-10T12:45:53Z","abstract_excerpt":"Consider a stationary Poisson point process in $\\mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric graph. The number of edges of this graph is counted that have midpoint in the $d$-dimensional unit ball. A quantitative central limit theorem for this counting statistic is derived, as the space dimension $d$ and the intensity of the Poisson point process tend to infinity simultaneously."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03286","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-18T00:53:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P4JzCUYIxIoCKxegDF5Kgjt+Yecm4Ey376zc4uzej73AuGGHhL9BPv9wt3H660VTvYmB+1pyPMpHFiG7aDYBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:04:18.923042Z"},"content_sha256":"0066f68e6f407c67078e712f42b20023094b8870437ee75a685453e9b623839f","schema_version":"1.0","event_id":"sha256:0066f68e6f407c67078e712f42b20023094b8870437ee75a685453e9b623839f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AZQFYFKNCM3PRZGVFMDJFJEVRM/bundle.json","state_url":"https://pith.science/pith/AZQFYFKNCM3PRZGVFMDJFJEVRM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AZQFYFKNCM3PRZGVFMDJFJEVRM/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-07T20:04:18Z","links":{"resolver":"https://pith.science/pith/AZQFYFKNCM3PRZGVFMDJFJEVRM","bundle":"https://pith.science/pith/AZQFYFKNCM3PRZGVFMDJFJEVRM/bundle.json","state":"https://pith.science/pith/AZQFYFKNCM3PRZGVFMDJFJEVRM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AZQFYFKNCM3PRZGVFMDJFJEVRM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AZQFYFKNCM3PRZGVFMDJFJEVRM","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":"9b16fb2e291ce197bf36f299839e9bff33dd010e574519138ac16ad04029c595","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-10T12:45:53Z","title_canon_sha256":"61dd1c8aa4826b71cadcbc6ced585e9853e616aa968bdb079b41b96aba66deb9"},"schema_version":"1.0","source":{"id":"1612.03286","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03286","created_at":"2026-05-18T00:53:29Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03286v2","created_at":"2026-05-18T00:53:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03286","created_at":"2026-05-18T00:53:29Z"},{"alias_kind":"pith_short_12","alias_value":"AZQFYFKNCM3P","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AZQFYFKNCM3PRZGV","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AZQFYFKN","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:0066f68e6f407c67078e712f42b20023094b8870437ee75a685453e9b623839f","target":"graph","created_at":"2026-05-18T00:53:29Z","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":"Consider a stationary Poisson point process in $\\mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric graph. The number of edges of this graph is counted that have midpoint in the $d$-dimensional unit ball. A quantitative central limit theorem for this counting statistic is derived, as the space dimension $d$ and the intensity of the Poisson point process tend to infinity simultaneously.","authors_text":"Christoph Thaele, Jens Grygierek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-10T12:45:53Z","title":"Gaussian fluctuations for edge counts in high-dimensional random geometric graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03286","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:f5a450a24c53f29b69d1b0126bd947dcbf5a79c55e654b0e6e55739222eac539","target":"record","created_at":"2026-05-18T00:53:29Z","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":"9b16fb2e291ce197bf36f299839e9bff33dd010e574519138ac16ad04029c595","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-12-10T12:45:53Z","title_canon_sha256":"61dd1c8aa4826b71cadcbc6ced585e9853e616aa968bdb079b41b96aba66deb9"},"schema_version":"1.0","source":{"id":"1612.03286","kind":"arxiv","version":2}},"canonical_sha256":"06605c154d1336f8e4d52b0692a4958b3526d12e31dfb27be8b6921783df5500","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06605c154d1336f8e4d52b0692a4958b3526d12e31dfb27be8b6921783df5500","first_computed_at":"2026-05-18T00:53:29.347145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:29.347145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"80PHj56niDC6gqh/dogsluiI/gSjjoFEwYPQQGWgrn0htGwinfVoGQJfk4RhCRJbz3RHP3zjkLmYuHVdI4HYCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:29.347635Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03286","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5a450a24c53f29b69d1b0126bd947dcbf5a79c55e654b0e6e55739222eac539","sha256:0066f68e6f407c67078e712f42b20023094b8870437ee75a685453e9b623839f"],"state_sha256":"6a39572403b2477c39e31dbd0303b3ad19a2c44a66d3afe5b5fabad20a2f4817"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZHuJps7dHxNpKzqCN7TOPuVg5fQi5m5jNAjMK28zrzffvVBOxAGLrxvMKPdnVqBQbMYhjPhXpNzk3wajqmf3BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:04:18.926757Z","bundle_sha256":"f08dfa9206f9d466fea24a3f7ab90759046f707b6e26cdab95a18d8feaed5e06"}}