{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YWFRQF4MTRNMBUCC22W4C7BLHC","short_pith_number":"pith:YWFRQF4M","schema_version":"1.0","canonical_sha256":"c58b18178c9c5ac0d042d6adc17c2b388c0186c842eba2ad765ceb97fec2b371","source":{"kind":"arxiv","id":"1804.07996","version":1},"attestation_state":"computed","paper":{"title":"Additive Number Theory via Approximation by Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.FL","authors_text":"Jason Bell, Jeffrey Shallit, Thomas Finn Lidbetter","submitted_at":"2018-04-21T16:44:47Z","abstract_excerpt":"We prove some new theorems in additive number theory, using novel techniques from automata theory and formal languages. As an example of our method, we prove that every natural number > 25 is the sum of at most three natural numbers whose base-2 representation has an equal number of 0's and 1's."},"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":"1804.07996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-04-21T16:44:47Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"f71080e2839d2dab1a09d8b06dee16231f577d95dd6fc259a57f93c4413fbaa9","abstract_canon_sha256":"da8b987a9e9bcad1a535bb5815a6c310e459d3026f3379754d38fd3416d7ce4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:49.885419Z","signature_b64":"E+Upp8cT9nnnOvJeCtXAOq3ZEEAToJ5diVJg0iPwUCqn1X72ROMf9p04LC3mRsQSAbubOMAoti/nKj2eRfK2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c58b18178c9c5ac0d042d6adc17c2b388c0186c842eba2ad765ceb97fec2b371","last_reissued_at":"2026-05-18T00:17:49.884825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:49.884825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Additive Number Theory via Approximation by Regular Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.FL","authors_text":"Jason Bell, Jeffrey Shallit, Thomas Finn Lidbetter","submitted_at":"2018-04-21T16:44:47Z","abstract_excerpt":"We prove some new theorems in additive number theory, using novel techniques from automata theory and formal languages. As an example of our method, we prove that every natural number > 25 is the sum of at most three natural numbers whose base-2 representation has an equal number of 0's and 1's."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07996","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":"1804.07996","created_at":"2026-05-18T00:17:49.884909+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.07996v1","created_at":"2026-05-18T00:17:49.884909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07996","created_at":"2026-05-18T00:17:49.884909+00:00"},{"alias_kind":"pith_short_12","alias_value":"YWFRQF4MTRNM","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YWFRQF4MTRNMBUCC","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YWFRQF4M","created_at":"2026-05-18T12:33:04.347982+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/YWFRQF4MTRNMBUCC22W4C7BLHC","json":"https://pith.science/pith/YWFRQF4MTRNMBUCC22W4C7BLHC.json","graph_json":"https://pith.science/api/pith-number/YWFRQF4MTRNMBUCC22W4C7BLHC/graph.json","events_json":"https://pith.science/api/pith-number/YWFRQF4MTRNMBUCC22W4C7BLHC/events.json","paper":"https://pith.science/paper/YWFRQF4M"},"agent_actions":{"view_html":"https://pith.science/pith/YWFRQF4MTRNMBUCC22W4C7BLHC","download_json":"https://pith.science/pith/YWFRQF4MTRNMBUCC22W4C7BLHC.json","view_paper":"https://pith.science/paper/YWFRQF4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.07996&json=true","fetch_graph":"https://pith.science/api/pith-number/YWFRQF4MTRNMBUCC22W4C7BLHC/graph.json","fetch_events":"https://pith.science/api/pith-number/YWFRQF4MTRNMBUCC22W4C7BLHC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YWFRQF4MTRNMBUCC22W4C7BLHC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YWFRQF4MTRNMBUCC22W4C7BLHC/action/storage_attestation","attest_author":"https://pith.science/pith/YWFRQF4MTRNMBUCC22W4C7BLHC/action/author_attestation","sign_citation":"https://pith.science/pith/YWFRQF4MTRNMBUCC22W4C7BLHC/action/citation_signature","submit_replication":"https://pith.science/pith/YWFRQF4MTRNMBUCC22W4C7BLHC/action/replication_record"}},"created_at":"2026-05-18T00:17:49.884909+00:00","updated_at":"2026-05-18T00:17:49.884909+00:00"}