{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IGUZVMLQCQ5KPNI4TDUN6L5ZI2","short_pith_number":"pith:IGUZVMLQ","schema_version":"1.0","canonical_sha256":"41a99ab170143aa7b51c98e8df2fb946949e8d5e7ffb5ab3e17d1034f62c6618","source":{"kind":"arxiv","id":"1808.03213","version":1},"attestation_state":"computed","paper":{"title":"Divisibility of some binomial sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Hao Pan, He-Xia Ni","submitted_at":"2018-08-09T15:59:17Z","abstract_excerpt":"With help of $q$-congruence, we prove the divisibility of some binomial sums. For example, for any integers $\\rho,n\\geq 2$, $$\\sum_{k=0}^{n-1}(4k+1) \\binom{2k}{k}^\\rho \\cdot (-4)^{\\rho(n-1-k)} \\equiv 0\\pmod{2^{\\rho-2}n\\binom{2n}{n}}.$$"},"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":"1808.03213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-08-09T15:59:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"58b94c328938e0ae8553ec51266edd6ee88736e412661162c2aff88c3e13fb32","abstract_canon_sha256":"65fbb1b97d3d38ec3ed1f07b0e7972342ab21b2a72a1fd3666679c642584a772"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:29.888708Z","signature_b64":"xFN+lpE6hok7mOIWK2pxhI8AIWqS3POJjhexzdiPWPGjlPTsEEjM128LHY/hxGmeunJqZW3laVckwXzGRBcuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41a99ab170143aa7b51c98e8df2fb946949e8d5e7ffb5ab3e17d1034f62c6618","last_reissued_at":"2026-05-18T00:08:29.888345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:29.888345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Divisibility of some binomial sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Hao Pan, He-Xia Ni","submitted_at":"2018-08-09T15:59:17Z","abstract_excerpt":"With help of $q$-congruence, we prove the divisibility of some binomial sums. For example, for any integers $\\rho,n\\geq 2$, $$\\sum_{k=0}^{n-1}(4k+1) \\binom{2k}{k}^\\rho \\cdot (-4)^{\\rho(n-1-k)} \\equiv 0\\pmod{2^{\\rho-2}n\\binom{2n}{n}}.$$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03213","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.03213","created_at":"2026-05-18T00:08:29.888413+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03213v1","created_at":"2026-05-18T00:08:29.888413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03213","created_at":"2026-05-18T00:08:29.888413+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGUZVMLQCQ5K","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGUZVMLQCQ5KPNI4","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGUZVMLQ","created_at":"2026-05-18T12:32:28.185984+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/IGUZVMLQCQ5KPNI4TDUN6L5ZI2","json":"https://pith.science/pith/IGUZVMLQCQ5KPNI4TDUN6L5ZI2.json","graph_json":"https://pith.science/api/pith-number/IGUZVMLQCQ5KPNI4TDUN6L5ZI2/graph.json","events_json":"https://pith.science/api/pith-number/IGUZVMLQCQ5KPNI4TDUN6L5ZI2/events.json","paper":"https://pith.science/paper/IGUZVMLQ"},"agent_actions":{"view_html":"https://pith.science/pith/IGUZVMLQCQ5KPNI4TDUN6L5ZI2","download_json":"https://pith.science/pith/IGUZVMLQCQ5KPNI4TDUN6L5ZI2.json","view_paper":"https://pith.science/paper/IGUZVMLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03213&json=true","fetch_graph":"https://pith.science/api/pith-number/IGUZVMLQCQ5KPNI4TDUN6L5ZI2/graph.json","fetch_events":"https://pith.science/api/pith-number/IGUZVMLQCQ5KPNI4TDUN6L5ZI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGUZVMLQCQ5KPNI4TDUN6L5ZI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGUZVMLQCQ5KPNI4TDUN6L5ZI2/action/storage_attestation","attest_author":"https://pith.science/pith/IGUZVMLQCQ5KPNI4TDUN6L5ZI2/action/author_attestation","sign_citation":"https://pith.science/pith/IGUZVMLQCQ5KPNI4TDUN6L5ZI2/action/citation_signature","submit_replication":"https://pith.science/pith/IGUZVMLQCQ5KPNI4TDUN6L5ZI2/action/replication_record"}},"created_at":"2026-05-18T00:08:29.888413+00:00","updated_at":"2026-05-18T00:08:29.888413+00:00"}