{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:N6LEJAWOTNWACZK6MXGX72VNZ6","short_pith_number":"pith:N6LEJAWO","schema_version":"1.0","canonical_sha256":"6f964482ce9b6c01655e65cd7feaadcf9640f33267c2bca208bedef88029cd7c","source":{"kind":"arxiv","id":"1506.08869","version":1},"attestation_state":"computed","paper":{"title":"Carries and the arithmetic progression structure of sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Francesco Monopoli, Imre Z. Ruzsa","submitted_at":"2015-06-29T21:22:41Z","abstract_excerpt":"If we want to represent integers in base $m$, we need a set $A$ of digits, which needs to be a complete set of residues modulo $m$. When adding two integers with last digits $a_1, a_2 \\in A$, we find the unique $a \\in A$ such that $a_1 + a_2 \\equiv a$ mod $m$, and call $(a_1 + a_2 -a)/m$ the carry. Carries occur also when addition is done modulo $m^2$, with $A$ chosen as a set of coset representatives for the cyclic group $\\mathbb{Z}/m \\mathbb{Z} \\subseteq \\mathbb{Z}/m^2\\mathbb{Z}$. It is a natural to look for sets $A$ which minimize the number of different carries. In a recent paper, Diaconis"},"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":"1506.08869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-06-29T21:22:41Z","cross_cats_sorted":[],"title_canon_sha256":"3350b5d9f41afbc6532584139ffd5a79da7c464571845dd608c0943ffd52c6a4","abstract_canon_sha256":"b89485405394594e21037f75ce9b79644b2f3f37fb04e8baae4b1961b37cf573"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:34.252169Z","signature_b64":"B4G6rQ1HUC19Lznr4M1aN5N7vAai0QyNqsWijoo5ONOYv3jSVUuIJUsLBqzvziv64swH8DhhgMDDr1HyBRt8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f964482ce9b6c01655e65cd7feaadcf9640f33267c2bca208bedef88029cd7c","last_reissued_at":"2026-05-18T01:37:34.251616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:34.251616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Carries and the arithmetic progression structure of sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Francesco Monopoli, Imre Z. Ruzsa","submitted_at":"2015-06-29T21:22:41Z","abstract_excerpt":"If we want to represent integers in base $m$, we need a set $A$ of digits, which needs to be a complete set of residues modulo $m$. When adding two integers with last digits $a_1, a_2 \\in A$, we find the unique $a \\in A$ such that $a_1 + a_2 \\equiv a$ mod $m$, and call $(a_1 + a_2 -a)/m$ the carry. Carries occur also when addition is done modulo $m^2$, with $A$ chosen as a set of coset representatives for the cyclic group $\\mathbb{Z}/m \\mathbb{Z} \\subseteq \\mathbb{Z}/m^2\\mathbb{Z}$. It is a natural to look for sets $A$ which minimize the number of different carries. In a recent paper, Diaconis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08869","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":"1506.08869","created_at":"2026-05-18T01:37:34.251680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.08869v1","created_at":"2026-05-18T01:37:34.251680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08869","created_at":"2026-05-18T01:37:34.251680+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6LEJAWOTNWA","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6LEJAWOTNWACZK6","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6LEJAWO","created_at":"2026-05-18T12:29:32.376354+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/N6LEJAWOTNWACZK6MXGX72VNZ6","json":"https://pith.science/pith/N6LEJAWOTNWACZK6MXGX72VNZ6.json","graph_json":"https://pith.science/api/pith-number/N6LEJAWOTNWACZK6MXGX72VNZ6/graph.json","events_json":"https://pith.science/api/pith-number/N6LEJAWOTNWACZK6MXGX72VNZ6/events.json","paper":"https://pith.science/paper/N6LEJAWO"},"agent_actions":{"view_html":"https://pith.science/pith/N6LEJAWOTNWACZK6MXGX72VNZ6","download_json":"https://pith.science/pith/N6LEJAWOTNWACZK6MXGX72VNZ6.json","view_paper":"https://pith.science/paper/N6LEJAWO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.08869&json=true","fetch_graph":"https://pith.science/api/pith-number/N6LEJAWOTNWACZK6MXGX72VNZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/N6LEJAWOTNWACZK6MXGX72VNZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6LEJAWOTNWACZK6MXGX72VNZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6LEJAWOTNWACZK6MXGX72VNZ6/action/storage_attestation","attest_author":"https://pith.science/pith/N6LEJAWOTNWACZK6MXGX72VNZ6/action/author_attestation","sign_citation":"https://pith.science/pith/N6LEJAWOTNWACZK6MXGX72VNZ6/action/citation_signature","submit_replication":"https://pith.science/pith/N6LEJAWOTNWACZK6MXGX72VNZ6/action/replication_record"}},"created_at":"2026-05-18T01:37:34.251680+00:00","updated_at":"2026-05-18T01:37:34.251680+00:00"}