{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CGFKREJKSMXBDY7TM36S52OQOS","short_pith_number":"pith:CGFKREJK","schema_version":"1.0","canonical_sha256":"118aa8912a932e11e3f366fd2ee9d074802c1227c088f9e23f7f2abe318e1d07","source":{"kind":"arxiv","id":"1609.02090","version":2},"attestation_state":"computed","paper":{"title":"A variant of Waring's Problem for the ring of integers modulo n","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alex Iosevich, David Covert, Jonathan Pakianathan","submitted_at":"2016-09-07T17:49:22Z","abstract_excerpt":"We study a variant of Waring's problem for $\\mathbb{Z}_n$, the ring of integers modulo $n$: For a fixed integer $k \\geq 2$, what is the minimum number $m$ of $k$th powers necessary such that $x \\equiv x_1^k + \\dots + x_m^k \\pmod{n}$ has a solution for every $x \\in \\mathbb{Z}_n$? Using only elementary methods, we answer fully this question for exponents $k \\leq 10$, and we further discuss some intermediary cases such as categorizing the values of $n$ such that every element in $\\mathbb{Z}_n$ can be written as a sum of three squares. Hensel's Theorem for $p$-adic integers plays a key role. Final"},"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":"1609.02090","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-09-07T17:49:22Z","cross_cats_sorted":[],"title_canon_sha256":"efc2ca22a71a2c1b56336e8308be67ecb7f1b2a49bdab5fc48093e9f41d838dc","abstract_canon_sha256":"5580640a2f904652ad3730abb9e44285ad47e98ae9020321a4e080309f09546e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:24.600552Z","signature_b64":"kReUWXeB80d4HcU03VNkaq1jP1QOKwv/gRVqE1FA8jVZoKR0tRqGhZkTY1b/qhkEof8FIw/LegOFEBNUHWH/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"118aa8912a932e11e3f366fd2ee9d074802c1227c088f9e23f7f2abe318e1d07","last_reissued_at":"2026-05-18T00:36:24.599787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:24.599787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A variant of Waring's Problem for the ring of integers modulo n","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alex Iosevich, David Covert, Jonathan Pakianathan","submitted_at":"2016-09-07T17:49:22Z","abstract_excerpt":"We study a variant of Waring's problem for $\\mathbb{Z}_n$, the ring of integers modulo $n$: For a fixed integer $k \\geq 2$, what is the minimum number $m$ of $k$th powers necessary such that $x \\equiv x_1^k + \\dots + x_m^k \\pmod{n}$ has a solution for every $x \\in \\mathbb{Z}_n$? Using only elementary methods, we answer fully this question for exponents $k \\leq 10$, and we further discuss some intermediary cases such as categorizing the values of $n$ such that every element in $\\mathbb{Z}_n$ can be written as a sum of three squares. Hensel's Theorem for $p$-adic integers plays a key role. Final"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02090","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":"1609.02090","created_at":"2026-05-18T00:36:24.599914+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.02090v2","created_at":"2026-05-18T00:36:24.599914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02090","created_at":"2026-05-18T00:36:24.599914+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGFKREJKSMXB","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGFKREJKSMXBDY7T","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGFKREJK","created_at":"2026-05-18T12:30:09.641336+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/CGFKREJKSMXBDY7TM36S52OQOS","json":"https://pith.science/pith/CGFKREJKSMXBDY7TM36S52OQOS.json","graph_json":"https://pith.science/api/pith-number/CGFKREJKSMXBDY7TM36S52OQOS/graph.json","events_json":"https://pith.science/api/pith-number/CGFKREJKSMXBDY7TM36S52OQOS/events.json","paper":"https://pith.science/paper/CGFKREJK"},"agent_actions":{"view_html":"https://pith.science/pith/CGFKREJKSMXBDY7TM36S52OQOS","download_json":"https://pith.science/pith/CGFKREJKSMXBDY7TM36S52OQOS.json","view_paper":"https://pith.science/paper/CGFKREJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.02090&json=true","fetch_graph":"https://pith.science/api/pith-number/CGFKREJKSMXBDY7TM36S52OQOS/graph.json","fetch_events":"https://pith.science/api/pith-number/CGFKREJKSMXBDY7TM36S52OQOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGFKREJKSMXBDY7TM36S52OQOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGFKREJKSMXBDY7TM36S52OQOS/action/storage_attestation","attest_author":"https://pith.science/pith/CGFKREJKSMXBDY7TM36S52OQOS/action/author_attestation","sign_citation":"https://pith.science/pith/CGFKREJKSMXBDY7TM36S52OQOS/action/citation_signature","submit_replication":"https://pith.science/pith/CGFKREJKSMXBDY7TM36S52OQOS/action/replication_record"}},"created_at":"2026-05-18T00:36:24.599914+00:00","updated_at":"2026-05-18T00:36:24.599914+00:00"}