{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:R7TFGPYIDSIAEQC3TSUYGM23HY","short_pith_number":"pith:R7TFGPYI","schema_version":"1.0","canonical_sha256":"8fe6533f081c9002405b9ca983335b3e17069ca737dfc054b4838b7654c76659","source":{"kind":"arxiv","id":"1710.04247","version":2},"attestation_state":"computed","paper":{"title":"Lagrange's Theorem for Binary Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.NT","authors_text":"Aayush Rajasekaran, Dirk Nowotka, Jeffrey Shallit, Parthasarathy Madhusudan","submitted_at":"2017-10-11T18:32:57Z","abstract_excerpt":"We show how to prove theorems in additive number theory using a decision procedure based on finite automata. Among other things, we obtain the following analogue of Lagrange's theorem: every natural number > 686 is the sum of at most 4 natural numbers whose canonical base-2 representation is a binary square, that is, a string of the form xx for some block of bits x. Here the number 4 is optimal. While we cannot embed this theorem itself in a decidable theory, we show that stronger lemmas that imply that the theorem can be embedded in decidable theories, and show how automated methods can be us"},"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":"1710.04247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-10-11T18:32:57Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"c7d47e679ece388622aae7eafced5e79de4d1974148c24b5e192c1a5e112d810","abstract_canon_sha256":"e500f139f865219d5f8e399addc9ec248a99df661a28a6664f9ef19df9ed890c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:38.482211Z","signature_b64":"JGkWgitMZfXmqnaEdRKiUCtKv8hCNQj/oDAKEmL/EOqSysfamdBICUxt0dVHgjf4acOlm96FkiqJSeAfaSilDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fe6533f081c9002405b9ca983335b3e17069ca737dfc054b4838b7654c76659","last_reissued_at":"2026-05-18T00:12:38.481634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:38.481634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lagrange's Theorem for Binary Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.NT","authors_text":"Aayush Rajasekaran, Dirk Nowotka, Jeffrey Shallit, Parthasarathy Madhusudan","submitted_at":"2017-10-11T18:32:57Z","abstract_excerpt":"We show how to prove theorems in additive number theory using a decision procedure based on finite automata. Among other things, we obtain the following analogue of Lagrange's theorem: every natural number > 686 is the sum of at most 4 natural numbers whose canonical base-2 representation is a binary square, that is, a string of the form xx for some block of bits x. Here the number 4 is optimal. While we cannot embed this theorem itself in a decidable theory, we show that stronger lemmas that imply that the theorem can be embedded in decidable theories, and show how automated methods can be us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04247","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":"1710.04247","created_at":"2026-05-18T00:12:38.481748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.04247v2","created_at":"2026-05-18T00:12:38.481748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04247","created_at":"2026-05-18T00:12:38.481748+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7TFGPYIDSIA","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7TFGPYIDSIAEQC3","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7TFGPYI","created_at":"2026-05-18T12:31:39.905425+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/R7TFGPYIDSIAEQC3TSUYGM23HY","json":"https://pith.science/pith/R7TFGPYIDSIAEQC3TSUYGM23HY.json","graph_json":"https://pith.science/api/pith-number/R7TFGPYIDSIAEQC3TSUYGM23HY/graph.json","events_json":"https://pith.science/api/pith-number/R7TFGPYIDSIAEQC3TSUYGM23HY/events.json","paper":"https://pith.science/paper/R7TFGPYI"},"agent_actions":{"view_html":"https://pith.science/pith/R7TFGPYIDSIAEQC3TSUYGM23HY","download_json":"https://pith.science/pith/R7TFGPYIDSIAEQC3TSUYGM23HY.json","view_paper":"https://pith.science/paper/R7TFGPYI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.04247&json=true","fetch_graph":"https://pith.science/api/pith-number/R7TFGPYIDSIAEQC3TSUYGM23HY/graph.json","fetch_events":"https://pith.science/api/pith-number/R7TFGPYIDSIAEQC3TSUYGM23HY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7TFGPYIDSIAEQC3TSUYGM23HY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7TFGPYIDSIAEQC3TSUYGM23HY/action/storage_attestation","attest_author":"https://pith.science/pith/R7TFGPYIDSIAEQC3TSUYGM23HY/action/author_attestation","sign_citation":"https://pith.science/pith/R7TFGPYIDSIAEQC3TSUYGM23HY/action/citation_signature","submit_replication":"https://pith.science/pith/R7TFGPYIDSIAEQC3TSUYGM23HY/action/replication_record"}},"created_at":"2026-05-18T00:12:38.481748+00:00","updated_at":"2026-05-18T00:12:38.481748+00:00"}