{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GG4NFLMOHB4EN7FQX7ZF25UQUI","short_pith_number":"pith:GG4NFLMO","schema_version":"1.0","canonical_sha256":"31b8d2ad8e387846fcb0bff25d7690a22435be5c7478ca972703303dda2b7496","source":{"kind":"arxiv","id":"2506.20836","version":2},"attestation_state":"computed","paper":{"title":"On Nathanson's Triangular Number Phenomenon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Kevin O'Bryant","submitted_at":"2025-06-25T21:06:16Z","abstract_excerpt":"For a finite set $A\\subseteq \\mathbb{Z}$, the $h$-fold sumset is $hA :=\\{x_1+\\dots+x_h:x_i\\in A\\}$. We interpret the beginning of the sequence of sumset sizes $(|hA|)_{h=1}^\\infty$ in terms of the successive $L^1$-minima of a lattice (specifically, the points in $\\mathbb{Z}^{|A|}$ whose coordinates sum to 0 and which are perpendicular to $\\langle a_1,\\dots,a_{|A|}\\rangle$). In particular, if $h_1,h_2$ are the first and second minima, and $1\\le h<h_1$, then $|hA|=\\binom{h+|A|-1}{|A|-1}$, while if $h_1\\le h <h_2$, then $|hA|=\\binom{h+|A|-1}{|A|-1}-\\binom{h-h_1+|A|-1}{|A|-1}$. This explains the a"},"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":"2506.20836","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2025-06-25T21:06:16Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"901131a560ac75030266fafd23715b4116c2d794d8242b1c788176abdcf69061","abstract_canon_sha256":"918935c7d6fbfbbfd34144ab8568852fc9296261213fc62534313960b8474bb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:55:20.078750Z","signature_b64":"5Ayh90IsyGFTjabV5fXdJJKB5oJLllahJ99NMMFSzNm6SUYIRhp/VMBW5Ef4rRIvj9uojRg5I2KPHLWDKwVwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31b8d2ad8e387846fcb0bff25d7690a22435be5c7478ca972703303dda2b7496","last_reissued_at":"2026-07-05T11:55:20.078227Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:55:20.078227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Nathanson's Triangular Number Phenomenon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Kevin O'Bryant","submitted_at":"2025-06-25T21:06:16Z","abstract_excerpt":"For a finite set $A\\subseteq \\mathbb{Z}$, the $h$-fold sumset is $hA :=\\{x_1+\\dots+x_h:x_i\\in A\\}$. We interpret the beginning of the sequence of sumset sizes $(|hA|)_{h=1}^\\infty$ in terms of the successive $L^1$-minima of a lattice (specifically, the points in $\\mathbb{Z}^{|A|}$ whose coordinates sum to 0 and which are perpendicular to $\\langle a_1,\\dots,a_{|A|}\\rangle$). In particular, if $h_1,h_2$ are the first and second minima, and $1\\le h<h_1$, then $|hA|=\\binom{h+|A|-1}{|A|-1}$, while if $h_1\\le h <h_2$, then $|hA|=\\binom{h+|A|-1}{|A|-1}-\\binom{h-h_1+|A|-1}{|A|-1}$. This explains the a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20836","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.20836/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.20836","created_at":"2026-07-05T11:55:20.078286+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.20836v2","created_at":"2026-07-05T11:55:20.078286+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20836","created_at":"2026-07-05T11:55:20.078286+00:00"},{"alias_kind":"pith_short_12","alias_value":"GG4NFLMOHB4E","created_at":"2026-07-05T11:55:20.078286+00:00"},{"alias_kind":"pith_short_16","alias_value":"GG4NFLMOHB4EN7FQ","created_at":"2026-07-05T11:55:20.078286+00:00"},{"alias_kind":"pith_short_8","alias_value":"GG4NFLMO","created_at":"2026-07-05T11:55:20.078286+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2505.05329","citing_title":"Explicit sumset sizes in additive number theory","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2512.23574","citing_title":"Intersections of sumsets in additive number theory","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GG4NFLMOHB4EN7FQX7ZF25UQUI","json":"https://pith.science/pith/GG4NFLMOHB4EN7FQX7ZF25UQUI.json","graph_json":"https://pith.science/api/pith-number/GG4NFLMOHB4EN7FQX7ZF25UQUI/graph.json","events_json":"https://pith.science/api/pith-number/GG4NFLMOHB4EN7FQX7ZF25UQUI/events.json","paper":"https://pith.science/paper/GG4NFLMO"},"agent_actions":{"view_html":"https://pith.science/pith/GG4NFLMOHB4EN7FQX7ZF25UQUI","download_json":"https://pith.science/pith/GG4NFLMOHB4EN7FQX7ZF25UQUI.json","view_paper":"https://pith.science/paper/GG4NFLMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.20836&json=true","fetch_graph":"https://pith.science/api/pith-number/GG4NFLMOHB4EN7FQX7ZF25UQUI/graph.json","fetch_events":"https://pith.science/api/pith-number/GG4NFLMOHB4EN7FQX7ZF25UQUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GG4NFLMOHB4EN7FQX7ZF25UQUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GG4NFLMOHB4EN7FQX7ZF25UQUI/action/storage_attestation","attest_author":"https://pith.science/pith/GG4NFLMOHB4EN7FQX7ZF25UQUI/action/author_attestation","sign_citation":"https://pith.science/pith/GG4NFLMOHB4EN7FQX7ZF25UQUI/action/citation_signature","submit_replication":"https://pith.science/pith/GG4NFLMOHB4EN7FQX7ZF25UQUI/action/replication_record"}},"created_at":"2026-07-05T11:55:20.078286+00:00","updated_at":"2026-07-05T11:55:20.078286+00:00"}