{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:7IBLZBI6MIHHEQYU44XBHVDSW4","short_pith_number":"pith:7IBLZBI6","schema_version":"1.0","canonical_sha256":"fa02bc851e620e724314e72e13d472b729cd3af2591bfb2bb71ba650a58f394e","source":{"kind":"arxiv","id":"1008.3671","version":2},"attestation_state":"computed","paper":{"title":"Rational Distances with Rational Angles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Frank de Zeeuw, J\\'ozsef Solymosi, Ryan Schwartz","submitted_at":"2010-08-22T00:37:44Z","abstract_excerpt":"In 1946 Erd\\H os asked for the maximum number of unit distances, $u(n)$, among $n$ points in the plane. He showed that $u(n)> n^{1+c/\\log\\log n}$ and conjectured that this was the true magnitude. The best known upper bound is $u(n)<cn^{4/3}$, due to Spencer, Szemer\\'edi and Trotter. We show that the upper bound $n^{1+6/\\sqrt{\\log n}}$ holds if we only consider unit distances with rational angle, by which we mean that the line through the pair of points makes a rational angle in degrees with the x-axis. Using an algebraic theorem of Mann we get a uniform bound on the number of paths between two"},"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":"1008.3671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-22T00:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"6f5e9cef1da371f52231cd87870229542db676c6972e9c4e79ef63736412a5d4","abstract_canon_sha256":"eadd0da4aa8d12c757034ce364f39f26889c0ad63a35cbb6bc50b90a25566e47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:54.498158Z","signature_b64":"L39QOqbKEzfy4ODLls3JFcjbo192ZX3lggFKxwZ73GIiqKq+3Gu9ts48ACvR9XZsrDWhrCcrwZOPVE7vHYo1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa02bc851e620e724314e72e13d472b729cd3af2591bfb2bb71ba650a58f394e","last_reissued_at":"2026-05-18T02:53:54.497302Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:54.497302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rational Distances with Rational Angles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Frank de Zeeuw, J\\'ozsef Solymosi, Ryan Schwartz","submitted_at":"2010-08-22T00:37:44Z","abstract_excerpt":"In 1946 Erd\\H os asked for the maximum number of unit distances, $u(n)$, among $n$ points in the plane. He showed that $u(n)> n^{1+c/\\log\\log n}$ and conjectured that this was the true magnitude. The best known upper bound is $u(n)<cn^{4/3}$, due to Spencer, Szemer\\'edi and Trotter. We show that the upper bound $n^{1+6/\\sqrt{\\log n}}$ holds if we only consider unit distances with rational angle, by which we mean that the line through the pair of points makes a rational angle in degrees with the x-axis. Using an algebraic theorem of Mann we get a uniform bound on the number of paths between two"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3671","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":"1008.3671","created_at":"2026-05-18T02:53:54.497468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3671v2","created_at":"2026-05-18T02:53:54.497468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3671","created_at":"2026-05-18T02:53:54.497468+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IBLZBI6MIHH","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IBLZBI6MIHHEQYU","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IBLZBI6","created_at":"2026-05-18T12:26:04.259169+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/7IBLZBI6MIHHEQYU44XBHVDSW4","json":"https://pith.science/pith/7IBLZBI6MIHHEQYU44XBHVDSW4.json","graph_json":"https://pith.science/api/pith-number/7IBLZBI6MIHHEQYU44XBHVDSW4/graph.json","events_json":"https://pith.science/api/pith-number/7IBLZBI6MIHHEQYU44XBHVDSW4/events.json","paper":"https://pith.science/paper/7IBLZBI6"},"agent_actions":{"view_html":"https://pith.science/pith/7IBLZBI6MIHHEQYU44XBHVDSW4","download_json":"https://pith.science/pith/7IBLZBI6MIHHEQYU44XBHVDSW4.json","view_paper":"https://pith.science/paper/7IBLZBI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3671&json=true","fetch_graph":"https://pith.science/api/pith-number/7IBLZBI6MIHHEQYU44XBHVDSW4/graph.json","fetch_events":"https://pith.science/api/pith-number/7IBLZBI6MIHHEQYU44XBHVDSW4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IBLZBI6MIHHEQYU44XBHVDSW4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IBLZBI6MIHHEQYU44XBHVDSW4/action/storage_attestation","attest_author":"https://pith.science/pith/7IBLZBI6MIHHEQYU44XBHVDSW4/action/author_attestation","sign_citation":"https://pith.science/pith/7IBLZBI6MIHHEQYU44XBHVDSW4/action/citation_signature","submit_replication":"https://pith.science/pith/7IBLZBI6MIHHEQYU44XBHVDSW4/action/replication_record"}},"created_at":"2026-05-18T02:53:54.497468+00:00","updated_at":"2026-05-18T02:53:54.497468+00:00"}