{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:U237TOJNLUAUND5TX4HJU3QELS","short_pith_number":"pith:U237TOJN","canonical_record":{"source":{"id":"1108.4817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-24T11:41:47Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"5b61e002f92e1cb7b766e29797ae8ada5f85c0926169a91f5f0d10c36692ac8a","abstract_canon_sha256":"c572509a4d674874b963cc1d73062ee7d6e9dde6831f7fa024a1e4829391fa0e"},"schema_version":"1.0"},"canonical_sha256":"a6b7f9b92d5d01468fb3bf0e9a6e045c87bf15c3dd393582c6190f7b81b9075c","source":{"kind":"arxiv","id":"1108.4817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4817","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4817v1","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4817","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"U237TOJNLUAU","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U237TOJNLUAUND5T","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U237TOJN","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:U237TOJNLUAUND5TX4HJU3QELS","target":"record","payload":{"canonical_record":{"source":{"id":"1108.4817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-24T11:41:47Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"5b61e002f92e1cb7b766e29797ae8ada5f85c0926169a91f5f0d10c36692ac8a","abstract_canon_sha256":"c572509a4d674874b963cc1d73062ee7d6e9dde6831f7fa024a1e4829391fa0e"},"schema_version":"1.0"},"canonical_sha256":"a6b7f9b92d5d01468fb3bf0e9a6e045c87bf15c3dd393582c6190f7b81b9075c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:21.329574Z","signature_b64":"TOYJEBUgP/p3tYPNJdFfvtKojpcrBrPZViYfKOHTdskf8tcvEPiXlyOT1WKY8byv/eZlvc1/nBAOesPH03k7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6b7f9b92d5d01468fb3bf0e9a6e045c87bf15c3dd393582c6190f7b81b9075c","last_reissued_at":"2026-05-18T02:28:21.328848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:21.328848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.4817","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:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vHfwf/qkuClHChJBZt/CZo40QzjHPJ81HT76CigO07TRNl6Wxh1T+deNvP4pJJQJV2uZUUZPQDnDHhbq2LedCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:45:31.613008Z"},"content_sha256":"6c5d426d800494bae1bae7af84a6c4d74eaf121fed7174621475259486f248ce","schema_version":"1.0","event_id":"sha256:6c5d426d800494bae1bae7af84a6c4d74eaf121fed7174621475259486f248ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:U237TOJNLUAUND5TX4HJU3QELS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Favourite distances in high dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Konrad J. Swanepoel","submitted_at":"2011-08-24T11:41:47Z","abstract_excerpt":"Let $S$ be a set of $n$ points in $d$-dimensional Euclidean space. Assign to each $x\\in S$ an arbitrary distance $r(x)>0$. Let $e_r(x,S)$ denote the number of points in $S$ at distance $r(x)$ from $x$. Avis, Erd\\\"os and Pach (1988) introduced the extremal quantity $f_d(n)=\\max\\sum_{x\\in S}e_r(x,S)$, where the maximum is taken over all $n$-point sets $S$ in $d$-dimensional space and all assignments $r\\colon S\\to(0,\\infty)$ of distances. We give a quick derivation of the asymptotics of the error term of $f_d(n)$ using only the analogous asymptotics of the maximum number of unit distance pairs in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4817","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:28:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y+i+ClkIhRncBc2W1/bv3kADwNd5mSdRRFKEd/W1eX63YHRLWm4eNO/iOZCHwzF84/kidqIrQzXtz7FwkOE9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:45:31.613618Z"},"content_sha256":"d22063786bb90451197b2d31722cc6728b80d6d6dfd216a80b82cec76c7f78dc","schema_version":"1.0","event_id":"sha256:d22063786bb90451197b2d31722cc6728b80d6d6dfd216a80b82cec76c7f78dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U237TOJNLUAUND5TX4HJU3QELS/bundle.json","state_url":"https://pith.science/pith/U237TOJNLUAUND5TX4HJU3QELS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U237TOJNLUAUND5TX4HJU3QELS/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-05T01:45:31Z","links":{"resolver":"https://pith.science/pith/U237TOJNLUAUND5TX4HJU3QELS","bundle":"https://pith.science/pith/U237TOJNLUAUND5TX4HJU3QELS/bundle.json","state":"https://pith.science/pith/U237TOJNLUAUND5TX4HJU3QELS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U237TOJNLUAUND5TX4HJU3QELS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:U237TOJNLUAUND5TX4HJU3QELS","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":"c572509a4d674874b963cc1d73062ee7d6e9dde6831f7fa024a1e4829391fa0e","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-24T11:41:47Z","title_canon_sha256":"5b61e002f92e1cb7b766e29797ae8ada5f85c0926169a91f5f0d10c36692ac8a"},"schema_version":"1.0","source":{"id":"1108.4817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4817","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4817v1","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4817","created_at":"2026-05-18T02:28:21Z"},{"alias_kind":"pith_short_12","alias_value":"U237TOJNLUAU","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U237TOJNLUAUND5T","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U237TOJN","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:d22063786bb90451197b2d31722cc6728b80d6d6dfd216a80b82cec76c7f78dc","target":"graph","created_at":"2026-05-18T02:28:21Z","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":"Let $S$ be a set of $n$ points in $d$-dimensional Euclidean space. Assign to each $x\\in S$ an arbitrary distance $r(x)>0$. Let $e_r(x,S)$ denote the number of points in $S$ at distance $r(x)$ from $x$. Avis, Erd\\\"os and Pach (1988) introduced the extremal quantity $f_d(n)=\\max\\sum_{x\\in S}e_r(x,S)$, where the maximum is taken over all $n$-point sets $S$ in $d$-dimensional space and all assignments $r\\colon S\\to(0,\\infty)$ of distances. We give a quick derivation of the asymptotics of the error term of $f_d(n)$ using only the analogous asymptotics of the maximum number of unit distance pairs in","authors_text":"Konrad J. Swanepoel","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-24T11:41:47Z","title":"Favourite distances in high dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4817","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:6c5d426d800494bae1bae7af84a6c4d74eaf121fed7174621475259486f248ce","target":"record","created_at":"2026-05-18T02:28:21Z","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":"c572509a4d674874b963cc1d73062ee7d6e9dde6831f7fa024a1e4829391fa0e","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-24T11:41:47Z","title_canon_sha256":"5b61e002f92e1cb7b766e29797ae8ada5f85c0926169a91f5f0d10c36692ac8a"},"schema_version":"1.0","source":{"id":"1108.4817","kind":"arxiv","version":1}},"canonical_sha256":"a6b7f9b92d5d01468fb3bf0e9a6e045c87bf15c3dd393582c6190f7b81b9075c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6b7f9b92d5d01468fb3bf0e9a6e045c87bf15c3dd393582c6190f7b81b9075c","first_computed_at":"2026-05-18T02:28:21.328848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:21.328848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TOYJEBUgP/p3tYPNJdFfvtKojpcrBrPZViYfKOHTdskf8tcvEPiXlyOT1WKY8byv/eZlvc1/nBAOesPH03k7Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:21.329574Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c5d426d800494bae1bae7af84a6c4d74eaf121fed7174621475259486f248ce","sha256:d22063786bb90451197b2d31722cc6728b80d6d6dfd216a80b82cec76c7f78dc"],"state_sha256":"411a148a57cdec1556d41827fd7d000b4455010614dde665aedbb11fc68688f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/aPLxnWihutcriA8I3NKifrTw8NZEpqQeA66RTVFElqDlYjwd5KFhFEVRdqRH+d9ukAayYJWOp7fkjf76sKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:45:31.617818Z","bundle_sha256":"3cdfb6b8bce701b86d6019e190146a6bd85a5950823f8fe7c4c5d5abf6b301f7"}}