{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BVYNNQIVJXRRI3W55EEYU4CHL3","short_pith_number":"pith:BVYNNQIV","canonical_record":{"source":{"id":"1709.08048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2017-09-23T13:06:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d88d59b995a87cc6639ebee08a4b0e42307393f11db669362d6515f18b97a0e4","abstract_canon_sha256":"5b5b5780ddd32bd8f12cfcbfd1278054a1c40fb39763e5806fe4a99f33e5f1d4"},"schema_version":"1.0"},"canonical_sha256":"0d70d6c1154de3146edde9098a70475ecbc56f833f1e5464e8beb842ea5b3a34","source":{"kind":"arxiv","id":"1709.08048","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08048","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08048v1","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08048","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"pith_short_12","alias_value":"BVYNNQIVJXRR","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BVYNNQIVJXRRI3W5","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BVYNNQIV","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BVYNNQIVJXRRI3W55EEYU4CHL3","target":"record","payload":{"canonical_record":{"source":{"id":"1709.08048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2017-09-23T13:06:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d88d59b995a87cc6639ebee08a4b0e42307393f11db669362d6515f18b97a0e4","abstract_canon_sha256":"5b5b5780ddd32bd8f12cfcbfd1278054a1c40fb39763e5806fe4a99f33e5f1d4"},"schema_version":"1.0"},"canonical_sha256":"0d70d6c1154de3146edde9098a70475ecbc56f833f1e5464e8beb842ea5b3a34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:28.145681Z","signature_b64":"sjNyjQ/xKZjTjP2QpnLatZ28u5+gJAUyGesbiIz9EiaaphCSHXlKBBEeEC5fg3iMtm8/suG3TKSJCBqzkERZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d70d6c1154de3146edde9098a70475ecbc56f833f1e5464e8beb842ea5b3a34","last_reissued_at":"2026-05-18T00:34:28.145034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:28.145034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.08048","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-18T00:34:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gCdNw4K/43NZM6M957ObrVHyn/I5VzguPBdBHT/m4dspqNDhGm87oDcnrp8H2jolStTB9PxvQMtSXgOMlUsCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:46:17.205879Z"},"content_sha256":"4860340b530921c9e49fc2a475340105d5147b658d93941f3d83ed38de600997","schema_version":"1.0","event_id":"sha256:4860340b530921c9e49fc2a475340105d5147b658d93941f3d83ed38de600997"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BVYNNQIVJXRRI3W55EEYU4CHL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the unit distance problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.CA","authors_text":"Alex Iosevich","submitted_at":"2017-09-23T13:06:26Z","abstract_excerpt":"The Erd\\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\\leq C_{\\epsilon} n^{1+\\epsilon}$ for any $\\epsilon>0$. The best known bound is $Cn^{\\frac{4}{3}}$. We show that if the set under consideration is well-distributed and the fixed distance is much smaller than the diameter of the set, then the exponent $\\frac{4}{3}$ is significantly improved. Corresponding results are also established in higher dimensions. The results are obtained by solving the corresponding continuous problem and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08048","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-18T00:34:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OQ8pn9LynM++CJ16qcnozL+6pPOmWpxexJdWD21pw+msmwi1P4fLeX2+gV96RU2bsrGd7QyeJmk/gxMPQP6CBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:46:17.206231Z"},"content_sha256":"e18ee151e1eb200615bddaaa0d90609b0225491dc4bb780f1a15bc495dac3ff3","schema_version":"1.0","event_id":"sha256:e18ee151e1eb200615bddaaa0d90609b0225491dc4bb780f1a15bc495dac3ff3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BVYNNQIVJXRRI3W55EEYU4CHL3/bundle.json","state_url":"https://pith.science/pith/BVYNNQIVJXRRI3W55EEYU4CHL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BVYNNQIVJXRRI3W55EEYU4CHL3/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-03T18:46:17Z","links":{"resolver":"https://pith.science/pith/BVYNNQIVJXRRI3W55EEYU4CHL3","bundle":"https://pith.science/pith/BVYNNQIVJXRRI3W55EEYU4CHL3/bundle.json","state":"https://pith.science/pith/BVYNNQIVJXRRI3W55EEYU4CHL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BVYNNQIVJXRRI3W55EEYU4CHL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BVYNNQIVJXRRI3W55EEYU4CHL3","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":"5b5b5780ddd32bd8f12cfcbfd1278054a1c40fb39763e5806fe4a99f33e5f1d4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2017-09-23T13:06:26Z","title_canon_sha256":"d88d59b995a87cc6639ebee08a4b0e42307393f11db669362d6515f18b97a0e4"},"schema_version":"1.0","source":{"id":"1709.08048","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08048","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08048v1","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08048","created_at":"2026-05-18T00:34:28Z"},{"alias_kind":"pith_short_12","alias_value":"BVYNNQIVJXRR","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BVYNNQIVJXRRI3W5","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BVYNNQIV","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:e18ee151e1eb200615bddaaa0d90609b0225491dc4bb780f1a15bc495dac3ff3","target":"graph","created_at":"2026-05-18T00:34:28Z","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":"The Erd\\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\\leq C_{\\epsilon} n^{1+\\epsilon}$ for any $\\epsilon>0$. The best known bound is $Cn^{\\frac{4}{3}}$. We show that if the set under consideration is well-distributed and the fixed distance is much smaller than the diameter of the set, then the exponent $\\frac{4}{3}$ is significantly improved. Corresponding results are also established in higher dimensions. The results are obtained by solving the corresponding continuous problem and ","authors_text":"Alex Iosevich","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2017-09-23T13:06:26Z","title":"On the unit distance problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08048","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:4860340b530921c9e49fc2a475340105d5147b658d93941f3d83ed38de600997","target":"record","created_at":"2026-05-18T00:34:28Z","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":"5b5b5780ddd32bd8f12cfcbfd1278054a1c40fb39763e5806fe4a99f33e5f1d4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2017-09-23T13:06:26Z","title_canon_sha256":"d88d59b995a87cc6639ebee08a4b0e42307393f11db669362d6515f18b97a0e4"},"schema_version":"1.0","source":{"id":"1709.08048","kind":"arxiv","version":1}},"canonical_sha256":"0d70d6c1154de3146edde9098a70475ecbc56f833f1e5464e8beb842ea5b3a34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d70d6c1154de3146edde9098a70475ecbc56f833f1e5464e8beb842ea5b3a34","first_computed_at":"2026-05-18T00:34:28.145034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:28.145034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sjNyjQ/xKZjTjP2QpnLatZ28u5+gJAUyGesbiIz9EiaaphCSHXlKBBEeEC5fg3iMtm8/suG3TKSJCBqzkERZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:28.145681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08048","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4860340b530921c9e49fc2a475340105d5147b658d93941f3d83ed38de600997","sha256:e18ee151e1eb200615bddaaa0d90609b0225491dc4bb780f1a15bc495dac3ff3"],"state_sha256":"f684f6208ff5cf805cb737b180ffbdd7fd21a9ce89dbcb9ab615733df9193660"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zLq3oKoyY726fKrHPCmdMOt0JW1GGyOFSyIh7LFYeL+m/vO2mc2j7/aNTG786fMVoIOq4wG194zXKDrnAgP1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:46:17.208240Z","bundle_sha256":"a26735a91e750ef337c265ea7328544fed300e02b0822c59c95d6d733fe6d3fe"}}