{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:HA3LUJOJUMKF3QNEPIKIJXUSXV","short_pith_number":"pith:HA3LUJOJ","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"},"canonical_sha256":"3836ba25c9a3145dc1a47a1484de92bd53ccfc6ce14459935aad33f565ee87da","source":{"kind":"arxiv","id":"math/0404385","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0404385","created_at":"2026-07-04T15:12:50Z"},{"alias_kind":"arxiv_version","alias_value":"math/0404385v3","created_at":"2026-07-04T15:12:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0404385","created_at":"2026-07-04T15:12:50Z"},{"alias_kind":"pith_short_12","alias_value":"HA3LUJOJUMKF","created_at":"2026-07-04T15:12:50Z"},{"alias_kind":"pith_short_16","alias_value":"HA3LUJOJUMKF3QNE","created_at":"2026-07-04T15:12:50Z"},{"alias_kind":"pith_short_8","alias_value":"HA3LUJOJ","created_at":"2026-07-04T15:12:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:HA3LUJOJUMKF3QNEPIKIJXUSXV","target":"record","payload":{"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"},"canonical_sha256":"3836ba25c9a3145dc1a47a1484de92bd53ccfc6ce14459935aad33f565ee87da","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"},"source_kind":"arxiv","source_id":"math/0404385","source_version":3,"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-07-04T15:12:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jElAF9Ced+KXd6Rvu240JPfdAp0KLPv7PdCDdq+4FkajFOnjYPUlScGg0FAL6SCC7X6J/om4Uc1n+Pj6MmzvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:40:30.019373Z"},"content_sha256":"269b007006b2da66e67cf54ad8c0788ec456232ec82c911f211243ccb9419bb9","schema_version":"1.0","event_id":"sha256:269b007006b2da66e67cf54ad8c0788ec456232ec82c911f211243ccb9419bb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:HA3LUJOJUMKF3QNEPIKIJXUSXV","target":"graph","payload":{"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"},"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-07-04T15:12:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"64W+mHfIdxVLxUTFUJLIhz3zOil0ibbcD4CdD7eV97lWBLFW7bDmpkTTGPw9VK5jAk9XnGxOX50krfIBfqPVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T02:40:30.019880Z"},"content_sha256":"f35265bc03b0da7110c4738e30b8d7bfb12b7a683147a89216252d50a0da188c","schema_version":"1.0","event_id":"sha256:f35265bc03b0da7110c4738e30b8d7bfb12b7a683147a89216252d50a0da188c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV/bundle.json","state_url":"https://pith.science/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV/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-08-04T02:40:30Z","links":{"resolver":"https://pith.science/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV","bundle":"https://pith.science/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV/bundle.json","state":"https://pith.science/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HA3LUJOJUMKF3QNEPIKIJXUSXV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:HA3LUJOJUMKF3QNEPIKIJXUSXV","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":"2ffffa1b654a93ecd6add6959be2a139ca616b0a418fc24d8edb63a81594d2a6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2004-04-21T14:24:55Z","title_canon_sha256":"84acbea8f60ec8a0b4192fa8f60d287d9fd153684c5cfb136a624cdc908a2cc1"},"schema_version":"1.0","source":{"id":"math/0404385","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0404385","created_at":"2026-07-04T15:12:50Z"},{"alias_kind":"arxiv_version","alias_value":"math/0404385v3","created_at":"2026-07-04T15:12:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0404385","created_at":"2026-07-04T15:12:50Z"},{"alias_kind":"pith_short_12","alias_value":"HA3LUJOJUMKF","created_at":"2026-07-04T15:12:50Z"},{"alias_kind":"pith_short_16","alias_value":"HA3LUJOJUMKF3QNE","created_at":"2026-07-04T15:12:50Z"},{"alias_kind":"pith_short_8","alias_value":"HA3LUJOJ","created_at":"2026-07-04T15:12:50Z"}],"graph_snapshots":[{"event_id":"sha256:f35265bc03b0da7110c4738e30b8d7bfb12b7a683147a89216252d50a0da188c","target":"graph","created_at":"2026-07-04T15:12:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0404385/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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)].","authors_text":"Zhi-Wei Sun","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2004-04-21T14:24:55Z","title":"On sums of binomial coefficients and their applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0404385","kind":"arxiv","version":3},"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:269b007006b2da66e67cf54ad8c0788ec456232ec82c911f211243ccb9419bb9","target":"record","created_at":"2026-07-04T15:12:50Z","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":"2ffffa1b654a93ecd6add6959be2a139ca616b0a418fc24d8edb63a81594d2a6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2004-04-21T14:24:55Z","title_canon_sha256":"84acbea8f60ec8a0b4192fa8f60d287d9fd153684c5cfb136a624cdc908a2cc1"},"schema_version":"1.0","source":{"id":"math/0404385","kind":"arxiv","version":3}},"canonical_sha256":"3836ba25c9a3145dc1a47a1484de92bd53ccfc6ce14459935aad33f565ee87da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3836ba25c9a3145dc1a47a1484de92bd53ccfc6ce14459935aad33f565ee87da","first_computed_at":"2026-07-04T15:12:50.913019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:12:50.913019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2TGct8RCurEYOXP5qabog/EuTCs02Mz3eDn9MXWHsOeoMY/mPlqbxl/HAY09hrND+Z6B2nlA5b3UZlZzxa5CBg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:12:50.913390Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0404385","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:269b007006b2da66e67cf54ad8c0788ec456232ec82c911f211243ccb9419bb9","sha256:f35265bc03b0da7110c4738e30b8d7bfb12b7a683147a89216252d50a0da188c"],"state_sha256":"3cd5d2e349b234deedcecda5df8fcf9dc7547dbc75af9dcb10a6fb33a986559a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YO7r70P/TghsOBrdUE2Ca7ZL9fZVT2bUigIRHo8y+r20yI23ht8oS+JRko59dt1GvYZmvbMdSajKR4WhNvaoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T02:40:30.023894Z","bundle_sha256":"fe09a83734373bd5c2b1e988e372eb22c86241f756e257a2799116941f001dc9"}}