{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:HA3LUJOJUMKF3QNEPIKIJXUSXV","short_pith_number":"pith:HA3LUJOJ","schema_version":"1.0","canonical_sha256":"3836ba25c9a3145dc1a47a1484de92bd53ccfc6ce14459935aad33f565ee87da","source":{"kind":"arxiv","id":"math/0404385","version":3},"attestation_state":"computed","paper":{"title":"On sums of binomial coefficients and their applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Zhi-Wei Sun","submitted_at":"2004-04-21T14:24:55Z","abstract_excerpt":"In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\\sum_{k\\equiv r (mod m)}\\binom {n}{k}$ and the alternate sum $\\sum_{k\\equiv r (mod m)}(-1)^{(k-r)/m}\\binom{n}{k}$, where m>0, $n\\ge 0$ and r are integers. For example, we show that if $n\\ge m-1$ then $$\\sum_{i=0}^{\\lfloor(m-1)/2\\rfloor}(-1)^i\\binom{m-1-i}i [n-2i,r-i]_m=2^{n-m+1}.$$ We also apply such results to investigate Bernoulli and Euler polynomials. Our approach depends heavily on an identity established by the author [Integers 2(2002)]."},"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":"math/0404385","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2004-04-21T14:24:55Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"84acbea8f60ec8a0b4192fa8f60d287d9fd153684c5cfb136a624cdc908a2cc1","abstract_canon_sha256":"2ffffa1b654a93ecd6add6959be2a139ca616b0a418fc24d8edb63a81594d2a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:12:50.913390Z","signature_b64":"2TGct8RCurEYOXP5qabog/EuTCs02Mz3eDn9MXWHsOeoMY/mPlqbxl/HAY09hrND+Z6B2nlA5b3UZlZzxa5CBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3836ba25c9a3145dc1a47a1484de92bd53ccfc6ce14459935aad33f565ee87da","last_reissued_at":"2026-07-04T15:12:50.913019Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:12:50.913019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On sums of binomial coefficients and their applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Zhi-Wei Sun","submitted_at":"2004-04-21T14:24:55Z","abstract_excerpt":"In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\\sum_{k\\equiv r (mod m)}\\binom {n}{k}$ and the alternate sum $\\sum_{k\\equiv r (mod m)}(-1)^{(k-r)/m}\\binom{n}{k}$, where m>0, $n\\ge 0$ and r are integers. For example, we show that if $n\\ge m-1$ then $$\\sum_{i=0}^{\\lfloor(m-1)/2\\rfloor}(-1)^i\\binom{m-1-i}i [n-2i,r-i]_m=2^{n-m+1}.$$ We also apply such results to investigate Bernoulli and Euler polynomials. Our approach depends heavily on an identity established by the author [Integers 2(2002)]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0404385","kind":"arxiv","version":3},"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/math/0404385/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":"math/0404385","created_at":"2026-07-04T15:12:50.913081+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0404385v3","created_at":"2026-07-04T15:12:50.913081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0404385","created_at":"2026-07-04T15:12:50.913081+00:00"},{"alias_kind":"pith_short_12","alias_value":"HA3LUJOJUMKF","created_at":"2026-07-04T15:12:50.913081+00:00"},{"alias_kind":"pith_short_16","alias_value":"HA3LUJOJUMKF3QNE","created_at":"2026-07-04T15:12:50.913081+00:00"},{"alias_kind":"pith_short_8","alias_value":"HA3LUJOJ","created_at":"2026-07-04T15:12:50.913081+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/HA3LUJOJUMKF3QNEPIKIJXUSXV","json":"https://pith.science/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV.json","graph_json":"https://pith.science/api/pith-number/HA3LUJOJUMKF3QNEPIKIJXUSXV/graph.json","events_json":"https://pith.science/api/pith-number/HA3LUJOJUMKF3QNEPIKIJXUSXV/events.json","paper":"https://pith.science/paper/HA3LUJOJ"},"agent_actions":{"view_html":"https://pith.science/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV","download_json":"https://pith.science/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV.json","view_paper":"https://pith.science/paper/HA3LUJOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0404385&json=true","fetch_graph":"https://pith.science/api/pith-number/HA3LUJOJUMKF3QNEPIKIJXUSXV/graph.json","fetch_events":"https://pith.science/api/pith-number/HA3LUJOJUMKF3QNEPIKIJXUSXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV/action/storage_attestation","attest_author":"https://pith.science/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV/action/author_attestation","sign_citation":"https://pith.science/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV/action/citation_signature","submit_replication":"https://pith.science/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV/action/replication_record"}},"created_at":"2026-07-04T15:12:50.913081+00:00","updated_at":"2026-07-04T15:12:50.913081+00:00"}