{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SXZMJ3PDE5TR5Q4ZTCVVQWYC4P","short_pith_number":"pith:SXZMJ3PD","schema_version":"1.0","canonical_sha256":"95f2c4ede327671ec39998ab585b02e3f4cb7b9880a5760a81ed6eb12f76688b","source":{"kind":"arxiv","id":"1711.01722","version":1},"attestation_state":"computed","paper":{"title":"On the binary digits of $\\sqrt{2}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Joseph Vandehey","submitted_at":"2017-11-06T04:17:09Z","abstract_excerpt":"We show that the number of $1$'s in the first $N$ digits of the binary expansion of $\\sqrt{2}$ is at least $\\sqrt{2N}(1+o(1))$ and show that this bound can be improved to around $2\\sqrt{N}/\\sqrt{2\\sqrt{2}-1}$ infinitely often."},"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":"1711.01722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-11-06T04:17:09Z","cross_cats_sorted":[],"title_canon_sha256":"e239a74810d37505d862a277d20d5c04a70cd9847bb7cf63e02c7b12fc53699d","abstract_canon_sha256":"aefcfe96eb785492ef309d12d8a1f3bba6854048f6b14e1142fa9a004f8d2a08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:17.046255Z","signature_b64":"jY03eJFWOP0T1Pd95AYCvjTLhpY5RcXi+l7hZIDvAWRCUOm+vbtgaGAyO4ayvKdFCqKD5aXwaVipxADWh3/zAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95f2c4ede327671ec39998ab585b02e3f4cb7b9880a5760a81ed6eb12f76688b","last_reissued_at":"2026-05-18T00:31:17.045725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:17.045725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the binary digits of $\\sqrt{2}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Joseph Vandehey","submitted_at":"2017-11-06T04:17:09Z","abstract_excerpt":"We show that the number of $1$'s in the first $N$ digits of the binary expansion of $\\sqrt{2}$ is at least $\\sqrt{2N}(1+o(1))$ and show that this bound can be improved to around $2\\sqrt{N}/\\sqrt{2\\sqrt{2}-1}$ infinitely often."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01722","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.01722","created_at":"2026-05-18T00:31:17.045820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01722v1","created_at":"2026-05-18T00:31:17.045820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01722","created_at":"2026-05-18T00:31:17.045820+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXZMJ3PDE5TR","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXZMJ3PDE5TR5Q4Z","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXZMJ3PD","created_at":"2026-05-18T12:31:43.269735+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/SXZMJ3PDE5TR5Q4ZTCVVQWYC4P","json":"https://pith.science/pith/SXZMJ3PDE5TR5Q4ZTCVVQWYC4P.json","graph_json":"https://pith.science/api/pith-number/SXZMJ3PDE5TR5Q4ZTCVVQWYC4P/graph.json","events_json":"https://pith.science/api/pith-number/SXZMJ3PDE5TR5Q4ZTCVVQWYC4P/events.json","paper":"https://pith.science/paper/SXZMJ3PD"},"agent_actions":{"view_html":"https://pith.science/pith/SXZMJ3PDE5TR5Q4ZTCVVQWYC4P","download_json":"https://pith.science/pith/SXZMJ3PDE5TR5Q4ZTCVVQWYC4P.json","view_paper":"https://pith.science/paper/SXZMJ3PD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01722&json=true","fetch_graph":"https://pith.science/api/pith-number/SXZMJ3PDE5TR5Q4ZTCVVQWYC4P/graph.json","fetch_events":"https://pith.science/api/pith-number/SXZMJ3PDE5TR5Q4ZTCVVQWYC4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXZMJ3PDE5TR5Q4ZTCVVQWYC4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXZMJ3PDE5TR5Q4ZTCVVQWYC4P/action/storage_attestation","attest_author":"https://pith.science/pith/SXZMJ3PDE5TR5Q4ZTCVVQWYC4P/action/author_attestation","sign_citation":"https://pith.science/pith/SXZMJ3PDE5TR5Q4ZTCVVQWYC4P/action/citation_signature","submit_replication":"https://pith.science/pith/SXZMJ3PDE5TR5Q4ZTCVVQWYC4P/action/replication_record"}},"created_at":"2026-05-18T00:31:17.045820+00:00","updated_at":"2026-05-18T00:31:17.045820+00:00"}