{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CG2G2RDYUK2HUPGNGV53AEVHZC","short_pith_number":"pith:CG2G2RDY","schema_version":"1.0","canonical_sha256":"11b46d4478a2b47a3ccd357bb012a7c8913e11d3076aa1fa1af452301115af29","source":{"kind":"arxiv","id":"1204.0110","version":4},"attestation_state":"computed","paper":{"title":"Badly approximable vectors on a vertical Cantor set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.NT","authors_text":"Erez Nesharim","submitted_at":"2012-03-31T15:52:37Z","abstract_excerpt":"For $i, j > 0, i + j = 1$, the set of badly approximable vectors with weight $(i, j)$ is defined by $Bad(i, j) = \\{(x, y) \\in \\R^2 : \\exists c > 0 \\forall q\\in\\N, \\;\\; \\max\\{q||qx||^{1/i}, q||qy||^{1/j} \\} > c\\}$, where $||x||$ is the distance of $x$ to the nearest integer. In 2010 Badziahin-Pollington-Velani solved Schmidt's conjecture which was stated in 1982, proving that $Bad(i, j) \\cap Bad(j, i)$ is nonempty. Using Badziahin-Pollington-Velani's technique with reference to fractal sets, we were able to improve their results: Assume that we are given a sequence $(i_t, j_t)$ with $i_t, j_t >"},"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":"1204.0110","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-03-31T15:52:37Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"4baf387ea30afe49fc98989764d2666234b0287dac8e893ebbbcb3818cc701b5","abstract_canon_sha256":"1f861656aa976a527fa14006149bb85df6e019bd51bea524d9ac4e14a2ca8ecd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:01.794539Z","signature_b64":"ZnClPaX7N2WMoj/PcLsC5MSEmgnUT+tTkrjM1jMm/CsDJycar4YTW4zFUdQM8e5DgRn3CQkC9DEZzvWJTU1yDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11b46d4478a2b47a3ccd357bb012a7c8913e11d3076aa1fa1af452301115af29","last_reissued_at":"2026-05-18T03:19:01.793673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:01.793673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Badly approximable vectors on a vertical Cantor set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.NT","authors_text":"Erez Nesharim","submitted_at":"2012-03-31T15:52:37Z","abstract_excerpt":"For $i, j > 0, i + j = 1$, the set of badly approximable vectors with weight $(i, j)$ is defined by $Bad(i, j) = \\{(x, y) \\in \\R^2 : \\exists c > 0 \\forall q\\in\\N, \\;\\; \\max\\{q||qx||^{1/i}, q||qy||^{1/j} \\} > c\\}$, where $||x||$ is the distance of $x$ to the nearest integer. In 2010 Badziahin-Pollington-Velani solved Schmidt's conjecture which was stated in 1982, proving that $Bad(i, j) \\cap Bad(j, i)$ is nonempty. Using Badziahin-Pollington-Velani's technique with reference to fractal sets, we were able to improve their results: Assume that we are given a sequence $(i_t, j_t)$ with $i_t, j_t >"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0110","kind":"arxiv","version":4},"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":"1204.0110","created_at":"2026-05-18T03:19:01.793793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0110v4","created_at":"2026-05-18T03:19:01.793793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0110","created_at":"2026-05-18T03:19:01.793793+00:00"},{"alias_kind":"pith_short_12","alias_value":"CG2G2RDYUK2H","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CG2G2RDYUK2HUPGN","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CG2G2RDY","created_at":"2026-05-18T12:27:01.376967+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/CG2G2RDYUK2HUPGNGV53AEVHZC","json":"https://pith.science/pith/CG2G2RDYUK2HUPGNGV53AEVHZC.json","graph_json":"https://pith.science/api/pith-number/CG2G2RDYUK2HUPGNGV53AEVHZC/graph.json","events_json":"https://pith.science/api/pith-number/CG2G2RDYUK2HUPGNGV53AEVHZC/events.json","paper":"https://pith.science/paper/CG2G2RDY"},"agent_actions":{"view_html":"https://pith.science/pith/CG2G2RDYUK2HUPGNGV53AEVHZC","download_json":"https://pith.science/pith/CG2G2RDYUK2HUPGNGV53AEVHZC.json","view_paper":"https://pith.science/paper/CG2G2RDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0110&json=true","fetch_graph":"https://pith.science/api/pith-number/CG2G2RDYUK2HUPGNGV53AEVHZC/graph.json","fetch_events":"https://pith.science/api/pith-number/CG2G2RDYUK2HUPGNGV53AEVHZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CG2G2RDYUK2HUPGNGV53AEVHZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CG2G2RDYUK2HUPGNGV53AEVHZC/action/storage_attestation","attest_author":"https://pith.science/pith/CG2G2RDYUK2HUPGNGV53AEVHZC/action/author_attestation","sign_citation":"https://pith.science/pith/CG2G2RDYUK2HUPGNGV53AEVHZC/action/citation_signature","submit_replication":"https://pith.science/pith/CG2G2RDYUK2HUPGNGV53AEVHZC/action/replication_record"}},"created_at":"2026-05-18T03:19:01.793793+00:00","updated_at":"2026-05-18T03:19:01.793793+00:00"}