{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7W7I5CR4ASFVG3SNCEFITNQ3KQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"02777de58f02ea4d275835d46d5d703a54017115208a2e13fcaa3226988a57fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-11-09T13:24:00Z","title_canon_sha256":"75d69826ba8857e17d8849cd9a21cef7a1d0ce5a3effea8635882fb9c3434080"},"schema_version":"1.0","source":{"id":"1811.03890","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.03890","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"1811.03890v1","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03890","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"7W7I5CR4ASFV","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7W7I5CR4ASFVG3SN","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7W7I5CR4","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:f1fd04aeda6529c9b5c345bf1c6c4fbcdd0e7441d7353f9f4b6cb247b1dbddfa","target":"graph","created_at":"2026-05-17T23:57:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Let $G$ be a finite additive abelian group with exponent $n$ and $S=g_{1}\\cdots g_{t}$ be a sequence of elements in $G$. For any element $g$ of $G$ and $A\\subseteq\\{1,2,\\ldots,n-1\\}$, let $N_{A,g}(S)$ denote the number of subsequences $T=\\prod_{i\\in I}g_{i}$ of $S$ such that $\\sum_{i\\in I}a_{i}g_{i}=g$ , where $I\\subseteq\\left\\{ 1,\\ldots,t\\right\\} $ and $a_{i}\\in A$. In this paper, we prove that $N_{A,0}(S)\\geq2^{|S|-D_{A}(G)+1}$, when $A=\\left\\{ 1,\\ldots,n-1\\right\\} $, where $D_{A}(G)$ is the smallest positive integer $l$, such that every sequence $S$ over $G$ of length at least $l$ has nonem","authors_text":"Ab\\'ilio Lemos, Allan O. Moura, Anderson T. Silva, B. K. Moriya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-11-09T13:24:00Z","title":"On the number of fully weighted zero-sum subsequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03890","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7f52d6b24a7e82b02f48f301f1b419659dae99d99ce6694965bfd584a26efb73","target":"record","created_at":"2026-05-17T23:57:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"02777de58f02ea4d275835d46d5d703a54017115208a2e13fcaa3226988a57fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-11-09T13:24:00Z","title_canon_sha256":"75d69826ba8857e17d8849cd9a21cef7a1d0ce5a3effea8635882fb9c3434080"},"schema_version":"1.0","source":{"id":"1811.03890","kind":"arxiv","version":1}},"canonical_sha256":"fdbe8e8a3c048b536e4d110a89b61b540fba921149316ad4c009967f601e71be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdbe8e8a3c048b536e4d110a89b61b540fba921149316ad4c009967f601e71be","first_computed_at":"2026-05-17T23:57:02.467276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:02.467276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"04JcbWgZd1uRH/UxTiMOyBm4oODbWWuLjtTVtmEBpFx09ZZVtVxPFD2UlsKsR1XfMpRXMhPoGETvvoLe2F+TBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:02.467763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.03890","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f52d6b24a7e82b02f48f301f1b419659dae99d99ce6694965bfd584a26efb73","sha256:f1fd04aeda6529c9b5c345bf1c6c4fbcdd0e7441d7353f9f4b6cb247b1dbddfa"],"state_sha256":"42c7bc0ea78e4a27985e0591324d3e75af915c08fb0555473d13752be5ecad30"}