{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MBSFCAIIBQNV2FLGVGIBLJETHK","short_pith_number":"pith:MBSFCAII","canonical_record":{"source":{"id":"1101.4492","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2011-01-24T10:43:37Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"91870ee602618043ab6e645211d499dcc3db920bdb05dfe48e125b0a213145b8","abstract_canon_sha256":"f350828ad21a110e53f9fc92fa5f3853b65f4c572abd9f188806d0b9f2cb8021"},"schema_version":"1.0"},"canonical_sha256":"60645101080c1b5d1566a99015a4933a8027888334db4c55fe6a0edc375d1ede","source":{"kind":"arxiv","id":"1101.4492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4492","created_at":"2026-05-18T04:31:10Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4492v1","created_at":"2026-05-18T04:31:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4492","created_at":"2026-05-18T04:31:10Z"},{"alias_kind":"pith_short_12","alias_value":"MBSFCAIIBQNV","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MBSFCAIIBQNV2FLG","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MBSFCAII","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MBSFCAIIBQNV2FLGVGIBLJETHK","target":"record","payload":{"canonical_record":{"source":{"id":"1101.4492","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2011-01-24T10:43:37Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"91870ee602618043ab6e645211d499dcc3db920bdb05dfe48e125b0a213145b8","abstract_canon_sha256":"f350828ad21a110e53f9fc92fa5f3853b65f4c572abd9f188806d0b9f2cb8021"},"schema_version":"1.0"},"canonical_sha256":"60645101080c1b5d1566a99015a4933a8027888334db4c55fe6a0edc375d1ede","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:10.950802Z","signature_b64":"o+6MXL12o/qsEmmiafmD2odC1H2vu9VuU+O4eXdE9qGi4bK7bV4XLv6yccCaoJ4m5WINYmcB6Rn1Nr2JQJjxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60645101080c1b5d1566a99015a4933a8027888334db4c55fe6a0edc375d1ede","last_reissued_at":"2026-05-18T04:31:10.950367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:10.950367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.4492","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:31:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXVYO2hmiw8pVf1pPcpWO8hTmh+lmOH55DJLzELy8PjWSW5g0Lnov4wmKEca3KSumDpxyTA7rdhYuCYi/IlRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:23:50.936897Z"},"content_sha256":"510e4c3c48e55cd92e33dcd0c931414223129969a64a8f3a1addbc836f60550d","schema_version":"1.0","event_id":"sha256:510e4c3c48e55cd92e33dcd0c931414223129969a64a8f3a1addbc836f60550d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MBSFCAIIBQNV2FLGVGIBLJETHK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of subsequences with a given sum in a finite abelian group","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Gerard Jennhwa Chang, Guoqing Wang, Haiyan Zhang, Sheng-Hua Chen, Yongke Qu","submitted_at":"2011-01-24T10:43:37Z","abstract_excerpt":"Suppose $G$ is a finite abelian group and $S$ is a sequence of elements in $G$. For any element $g$ of $G$, let $N_g(S)$ denote the number of subsequences of $S$ with sum $g$. The purpose of this paper is to investigate the lower bound for $N_g(S)$. In particular, we prove that either $N_g(S)=0$ or $N_g(S) \\ge 2^{|S|-D(G)+1}$, where $D(G)$ is the smallest positive integer $\\ell$ such that every sequence over $G$ of length at least $\\ell$ has a nonempty zero-sum subsequence. We also characterize the structures of the extremal sequences for which the equality holds for some groups."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4492","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:31:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v4VF6kV9Z1TQz7uYwTHiBM2Bamsb0+u/eE59ynQBuubKlgf8uFTID8jIXIhuZrdLFE20dw8ZkomQNnbiGqM8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:23:50.937246Z"},"content_sha256":"9bdf479e2760b628050560d0305fbf7546cf96c545626e562f9b407173d16861","schema_version":"1.0","event_id":"sha256:9bdf479e2760b628050560d0305fbf7546cf96c545626e562f9b407173d16861"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBSFCAIIBQNV2FLGVGIBLJETHK/bundle.json","state_url":"https://pith.science/pith/MBSFCAIIBQNV2FLGVGIBLJETHK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBSFCAIIBQNV2FLGVGIBLJETHK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T07:23:50Z","links":{"resolver":"https://pith.science/pith/MBSFCAIIBQNV2FLGVGIBLJETHK","bundle":"https://pith.science/pith/MBSFCAIIBQNV2FLGVGIBLJETHK/bundle.json","state":"https://pith.science/pith/MBSFCAIIBQNV2FLGVGIBLJETHK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBSFCAIIBQNV2FLGVGIBLJETHK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MBSFCAIIBQNV2FLGVGIBLJETHK","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":"f350828ad21a110e53f9fc92fa5f3853b65f4c572abd9f188806d0b9f2cb8021","cross_cats_sorted":["math.NT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2011-01-24T10:43:37Z","title_canon_sha256":"91870ee602618043ab6e645211d499dcc3db920bdb05dfe48e125b0a213145b8"},"schema_version":"1.0","source":{"id":"1101.4492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.4492","created_at":"2026-05-18T04:31:10Z"},{"alias_kind":"arxiv_version","alias_value":"1101.4492v1","created_at":"2026-05-18T04:31:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4492","created_at":"2026-05-18T04:31:10Z"},{"alias_kind":"pith_short_12","alias_value":"MBSFCAIIBQNV","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MBSFCAIIBQNV2FLG","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MBSFCAII","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:9bdf479e2760b628050560d0305fbf7546cf96c545626e562f9b407173d16861","target":"graph","created_at":"2026-05-18T04:31:10Z","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":"Suppose $G$ is a finite abelian group and $S$ is a sequence of elements in $G$. For any element $g$ of $G$, let $N_g(S)$ denote the number of subsequences of $S$ with sum $g$. The purpose of this paper is to investigate the lower bound for $N_g(S)$. In particular, we prove that either $N_g(S)=0$ or $N_g(S) \\ge 2^{|S|-D(G)+1}$, where $D(G)$ is the smallest positive integer $\\ell$ such that every sequence over $G$ of length at least $\\ell$ has a nonempty zero-sum subsequence. We also characterize the structures of the extremal sequences for which the equality holds for some groups.","authors_text":"Gerard Jennhwa Chang, Guoqing Wang, Haiyan Zhang, Sheng-Hua Chen, Yongke Qu","cross_cats":["math.NT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2011-01-24T10:43:37Z","title":"On the number of subsequences with a given sum in a finite abelian group"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4492","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:510e4c3c48e55cd92e33dcd0c931414223129969a64a8f3a1addbc836f60550d","target":"record","created_at":"2026-05-18T04:31:10Z","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":"f350828ad21a110e53f9fc92fa5f3853b65f4c572abd9f188806d0b9f2cb8021","cross_cats_sorted":["math.NT"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2011-01-24T10:43:37Z","title_canon_sha256":"91870ee602618043ab6e645211d499dcc3db920bdb05dfe48e125b0a213145b8"},"schema_version":"1.0","source":{"id":"1101.4492","kind":"arxiv","version":1}},"canonical_sha256":"60645101080c1b5d1566a99015a4933a8027888334db4c55fe6a0edc375d1ede","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60645101080c1b5d1566a99015a4933a8027888334db4c55fe6a0edc375d1ede","first_computed_at":"2026-05-18T04:31:10.950367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:10.950367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o+6MXL12o/qsEmmiafmD2odC1H2vu9VuU+O4eXdE9qGi4bK7bV4XLv6yccCaoJ4m5WINYmcB6Rn1Nr2JQJjxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:10.950802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.4492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:510e4c3c48e55cd92e33dcd0c931414223129969a64a8f3a1addbc836f60550d","sha256:9bdf479e2760b628050560d0305fbf7546cf96c545626e562f9b407173d16861"],"state_sha256":"eb00420208ba154a12cdbfc836aca1e9bd701b226ffc98cf90736d08af5ef33d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G6hZSQvfriQgQCZxuq+K4EQIqUxVzRKfeQ4FdW6GtPMCe4gTmFL+l8PMFlkOFKSESWd9M1d5OqyoqXspBA4uBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:23:50.939492Z","bundle_sha256":"4a50cd63165674f69e68b9fdad4e8a5762fd7c8d7870b736c02ef57530675a87"}}