{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3NOHSQZV6TVUSZT7JV3FZKHEWE","short_pith_number":"pith:3NOHSQZV","schema_version":"1.0","canonical_sha256":"db5c794335f4eb49667f4d765ca8e4b10cc9af1844b5ac29eab153b29dbcf915","source":{"kind":"arxiv","id":"1108.4840","version":1},"attestation_state":"computed","paper":{"title":"Congruences involving $\\binom{4k}{2k}$ and $\\binom{3k}k$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Zhi-Hong Sun","submitted_at":"2011-08-24T13:47:04Z","abstract_excerpt":"Let $p$ be a prime greater than 3. In the paper we mainly determine $\\sum_{k=0}^{[p/4]}\\binom{4k}{2k}(-1)^k$, $\\sum_{k=0}^{[p/3]}\\binom{3k}k, \\sum_{k=0}^{[p/3]}\\binom{3k}k(-1)^k$ and $\\sum_{k=0}^{[p/3]}\\binom{3k}k(-3)^k$ modulo $p$, where $[x]$ is the greatest integer not exceeding $x$."},"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":"1108.4840","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-08-24T13:47:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8d337bc93e67bb4d23a43411b0307bb6d2f99cc656c7f4076d9fe84c4123df2b","abstract_canon_sha256":"87f815efdcf17a08d81ee20f7308a1485ffa3912919a7ea0bde793f4eed80632"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:46.682260Z","signature_b64":"wcgN4Ni/UJxEchp0qYkk5Gf0vqF1HPx1C25GwmhCBztWzMTBKdok0JIe0VikjaCSzkDELqPRlxT7XtxXnMx1BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db5c794335f4eb49667f4d765ca8e4b10cc9af1844b5ac29eab153b29dbcf915","last_reissued_at":"2026-05-18T04:14:46.681823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:46.681823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Congruences involving $\\binom{4k}{2k}$ and $\\binom{3k}k$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Zhi-Hong Sun","submitted_at":"2011-08-24T13:47:04Z","abstract_excerpt":"Let $p$ be a prime greater than 3. In the paper we mainly determine $\\sum_{k=0}^{[p/4]}\\binom{4k}{2k}(-1)^k$, $\\sum_{k=0}^{[p/3]}\\binom{3k}k, \\sum_{k=0}^{[p/3]}\\binom{3k}k(-1)^k$ and $\\sum_{k=0}^{[p/3]}\\binom{3k}k(-3)^k$ modulo $p$, where $[x]$ is the greatest integer not exceeding $x$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4840","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":"1108.4840","created_at":"2026-05-18T04:14:46.681888+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.4840v1","created_at":"2026-05-18T04:14:46.681888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4840","created_at":"2026-05-18T04:14:46.681888+00:00"},{"alias_kind":"pith_short_12","alias_value":"3NOHSQZV6TVU","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3NOHSQZV6TVUSZT7","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3NOHSQZV","created_at":"2026-05-18T12:26:18.847500+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/3NOHSQZV6TVUSZT7JV3FZKHEWE","json":"https://pith.science/pith/3NOHSQZV6TVUSZT7JV3FZKHEWE.json","graph_json":"https://pith.science/api/pith-number/3NOHSQZV6TVUSZT7JV3FZKHEWE/graph.json","events_json":"https://pith.science/api/pith-number/3NOHSQZV6TVUSZT7JV3FZKHEWE/events.json","paper":"https://pith.science/paper/3NOHSQZV"},"agent_actions":{"view_html":"https://pith.science/pith/3NOHSQZV6TVUSZT7JV3FZKHEWE","download_json":"https://pith.science/pith/3NOHSQZV6TVUSZT7JV3FZKHEWE.json","view_paper":"https://pith.science/paper/3NOHSQZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.4840&json=true","fetch_graph":"https://pith.science/api/pith-number/3NOHSQZV6TVUSZT7JV3FZKHEWE/graph.json","fetch_events":"https://pith.science/api/pith-number/3NOHSQZV6TVUSZT7JV3FZKHEWE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3NOHSQZV6TVUSZT7JV3FZKHEWE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3NOHSQZV6TVUSZT7JV3FZKHEWE/action/storage_attestation","attest_author":"https://pith.science/pith/3NOHSQZV6TVUSZT7JV3FZKHEWE/action/author_attestation","sign_citation":"https://pith.science/pith/3NOHSQZV6TVUSZT7JV3FZKHEWE/action/citation_signature","submit_replication":"https://pith.science/pith/3NOHSQZV6TVUSZT7JV3FZKHEWE/action/replication_record"}},"created_at":"2026-05-18T04:14:46.681888+00:00","updated_at":"2026-05-18T04:14:46.681888+00:00"}