{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7JYHWC6SWPBORHLSLADWF3ND2Y","short_pith_number":"pith:7JYHWC6S","schema_version":"1.0","canonical_sha256":"fa707b0bd2b3c2e89d72580762eda3d61ab3cf68c8477cceccb95b393088b412","source":{"kind":"arxiv","id":"1410.3973","version":2},"attestation_state":"computed","paper":{"title":"Intersections of sets of distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mauro Di Nasso","submitted_at":"2014-10-15T08:48:38Z","abstract_excerpt":"We isolate conditions on the relative size of sets of natural numbers $A,B$ that guarantee a nonempty intersection $\\Delta(A)\\cap\\Delta(B)\\ne\\emptyset$ of the corresponding sets of distances. Such conditions apply to a large class of zero density sets. We also show that a variant of Khintchine's Recurrence Theorem holds for all infinite sets $A=\\{a_1<a_2<...\\}$ with $a_n\\ll n^{3/2}$."},"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":"1410.3973","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-15T08:48:38Z","cross_cats_sorted":[],"title_canon_sha256":"36da27f823819d7a33afca3c51535c06b9c996877d06af01e6d2f361dac26db2","abstract_canon_sha256":"45c51163e99556d7045bdfbb9edb4305b9b6f0b5bdb1e921461900161533b274"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:09.607309Z","signature_b64":"ya7vF2Zu3RpRQeL7iwGW5RZaT9aotMn/7sA+k6FDkhlzbji7BKvEO1p+9MULaJEhqYdir/YIYewmpITcaWk5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa707b0bd2b3c2e89d72580762eda3d61ab3cf68c8477cceccb95b393088b412","last_reissued_at":"2026-05-18T01:04:09.606785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:09.606785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intersections of sets of distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mauro Di Nasso","submitted_at":"2014-10-15T08:48:38Z","abstract_excerpt":"We isolate conditions on the relative size of sets of natural numbers $A,B$ that guarantee a nonempty intersection $\\Delta(A)\\cap\\Delta(B)\\ne\\emptyset$ of the corresponding sets of distances. Such conditions apply to a large class of zero density sets. We also show that a variant of Khintchine's Recurrence Theorem holds for all infinite sets $A=\\{a_1<a_2<...\\}$ with $a_n\\ll n^{3/2}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3973","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":"1410.3973","created_at":"2026-05-18T01:04:09.606860+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3973v2","created_at":"2026-05-18T01:04:09.606860+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3973","created_at":"2026-05-18T01:04:09.606860+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JYHWC6SWPBO","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JYHWC6SWPBORHLS","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JYHWC6S","created_at":"2026-05-18T12:28:19.803747+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/7JYHWC6SWPBORHLSLADWF3ND2Y","json":"https://pith.science/pith/7JYHWC6SWPBORHLSLADWF3ND2Y.json","graph_json":"https://pith.science/api/pith-number/7JYHWC6SWPBORHLSLADWF3ND2Y/graph.json","events_json":"https://pith.science/api/pith-number/7JYHWC6SWPBORHLSLADWF3ND2Y/events.json","paper":"https://pith.science/paper/7JYHWC6S"},"agent_actions":{"view_html":"https://pith.science/pith/7JYHWC6SWPBORHLSLADWF3ND2Y","download_json":"https://pith.science/pith/7JYHWC6SWPBORHLSLADWF3ND2Y.json","view_paper":"https://pith.science/paper/7JYHWC6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3973&json=true","fetch_graph":"https://pith.science/api/pith-number/7JYHWC6SWPBORHLSLADWF3ND2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/7JYHWC6SWPBORHLSLADWF3ND2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JYHWC6SWPBORHLSLADWF3ND2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JYHWC6SWPBORHLSLADWF3ND2Y/action/storage_attestation","attest_author":"https://pith.science/pith/7JYHWC6SWPBORHLSLADWF3ND2Y/action/author_attestation","sign_citation":"https://pith.science/pith/7JYHWC6SWPBORHLSLADWF3ND2Y/action/citation_signature","submit_replication":"https://pith.science/pith/7JYHWC6SWPBORHLSLADWF3ND2Y/action/replication_record"}},"created_at":"2026-05-18T01:04:09.606860+00:00","updated_at":"2026-05-18T01:04:09.606860+00:00"}