{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OMOJWHEZN2JLYQTU2IG2FFHCUK","short_pith_number":"pith:OMOJWHEZ","canonical_record":{"source":{"id":"1302.0188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-01T14:03:26Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"d0e1c7198c050c58d1ec1c7df63aaad27386b03a89a06896d180c3289cd63d10","abstract_canon_sha256":"eb9f05ceb4fafddce705a107f98997b9db2efe8f6e180caae5f31c95e114a06d"},"schema_version":"1.0"},"canonical_sha256":"731c9b1c996e92bc4274d20da294e2a2b8c7b182f058b4f5394b01d6b44add1d","source":{"kind":"arxiv","id":"1302.0188","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0188","created_at":"2026-05-18T03:34:47Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0188v1","created_at":"2026-05-18T03:34:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0188","created_at":"2026-05-18T03:34:47Z"},{"alias_kind":"pith_short_12","alias_value":"OMOJWHEZN2JL","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OMOJWHEZN2JLYQTU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OMOJWHEZ","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OMOJWHEZN2JLYQTU2IG2FFHCUK","target":"record","payload":{"canonical_record":{"source":{"id":"1302.0188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-01T14:03:26Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"d0e1c7198c050c58d1ec1c7df63aaad27386b03a89a06896d180c3289cd63d10","abstract_canon_sha256":"eb9f05ceb4fafddce705a107f98997b9db2efe8f6e180caae5f31c95e114a06d"},"schema_version":"1.0"},"canonical_sha256":"731c9b1c996e92bc4274d20da294e2a2b8c7b182f058b4f5394b01d6b44add1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:47.131222Z","signature_b64":"1tOK/MpVcQww/yl5695WxQwvzL4l6E2PDJfzOw16a/Lw4C2X6FcjruzLixW1m69oD7ceLzHlkhXYcvNft8tQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"731c9b1c996e92bc4274d20da294e2a2b8c7b182f058b4f5394b01d6b44add1d","last_reissued_at":"2026-05-18T03:34:47.130691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:47.130691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.0188","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-18T03:34:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EgjmwBh3BZ4N89gXqVT9g8nnEW/GK21QcqbNotaQM/86V2qLKvr7TxnCSVe9i3ypYeFyq5Pb1xjrEq3wWZNNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:42:43.330592Z"},"content_sha256":"5676c6baf5070d957d1438518f24e1dab7564ca91aa8479f2680e50aa40442a7","schema_version":"1.0","event_id":"sha256:5676c6baf5070d957d1438518f24e1dab7564ca91aa8479f2680e50aa40442a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OMOJWHEZN2JLYQTU2IG2FFHCUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Last Digit of $\\binom{2n}{n}$ and $\\sum\\binom{n}{i}\\binom{2n-2i}{n-i}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Walter Shur","submitted_at":"2013-02-01T14:03:26Z","abstract_excerpt":"Let $f_{n}=\\sum_{i=0}^n \\binom{n}{i}\\binom{2n-2i}{n-i}$, $g_{n}= \\sum_{i=1}^n \\binom{n}{i}\\binom{2n-2i}{n-i}$. Let $\\{a_k\\}_{k=1}$ be the set of all positive integers n, in increasing order, for which $\\binom{2n}{n}$ is not divisible by 5, and let $\\{b_k\\}_{k=1}$ be the set of all positive integers n, in increasing order, for which $g_n$ is not divisible by 5. This note finds simple formulas for $a_k$, $b_k$, $\\binom{2n}{n}\\ mod\\ 10$, $ f_{n}\\ mod\\ 10$, and $ g_{n}\\ mod\\ 10$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0188","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-18T03:34:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DJ/LnC2eRllZ2V4bSItazjPQL7WXMDaOua2FAj1RHe47KAz0b4zMjin5w9g0/r1tryqzmscFEHruszvPS0pyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:42:43.330930Z"},"content_sha256":"d492cd18976b59eb6410f4c09a414da5ddd1805fe73e1dedc5418b021469c256","schema_version":"1.0","event_id":"sha256:d492cd18976b59eb6410f4c09a414da5ddd1805fe73e1dedc5418b021469c256"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OMOJWHEZN2JLYQTU2IG2FFHCUK/bundle.json","state_url":"https://pith.science/pith/OMOJWHEZN2JLYQTU2IG2FFHCUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OMOJWHEZN2JLYQTU2IG2FFHCUK/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-06-26T02:42:43Z","links":{"resolver":"https://pith.science/pith/OMOJWHEZN2JLYQTU2IG2FFHCUK","bundle":"https://pith.science/pith/OMOJWHEZN2JLYQTU2IG2FFHCUK/bundle.json","state":"https://pith.science/pith/OMOJWHEZN2JLYQTU2IG2FFHCUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OMOJWHEZN2JLYQTU2IG2FFHCUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OMOJWHEZN2JLYQTU2IG2FFHCUK","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":"eb9f05ceb4fafddce705a107f98997b9db2efe8f6e180caae5f31c95e114a06d","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-01T14:03:26Z","title_canon_sha256":"d0e1c7198c050c58d1ec1c7df63aaad27386b03a89a06896d180c3289cd63d10"},"schema_version":"1.0","source":{"id":"1302.0188","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0188","created_at":"2026-05-18T03:34:47Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0188v1","created_at":"2026-05-18T03:34:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0188","created_at":"2026-05-18T03:34:47Z"},{"alias_kind":"pith_short_12","alias_value":"OMOJWHEZN2JL","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OMOJWHEZN2JLYQTU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OMOJWHEZ","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:d492cd18976b59eb6410f4c09a414da5ddd1805fe73e1dedc5418b021469c256","target":"graph","created_at":"2026-05-18T03:34:47Z","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":"Let $f_{n}=\\sum_{i=0}^n \\binom{n}{i}\\binom{2n-2i}{n-i}$, $g_{n}= \\sum_{i=1}^n \\binom{n}{i}\\binom{2n-2i}{n-i}$. Let $\\{a_k\\}_{k=1}$ be the set of all positive integers n, in increasing order, for which $\\binom{2n}{n}$ is not divisible by 5, and let $\\{b_k\\}_{k=1}$ be the set of all positive integers n, in increasing order, for which $g_n$ is not divisible by 5. This note finds simple formulas for $a_k$, $b_k$, $\\binom{2n}{n}\\ mod\\ 10$, $ f_{n}\\ mod\\ 10$, and $ g_{n}\\ mod\\ 10$.","authors_text":"Walter Shur","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-01T14:03:26Z","title":"The Last Digit of $\\binom{2n}{n}$ and $\\sum\\binom{n}{i}\\binom{2n-2i}{n-i}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0188","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:5676c6baf5070d957d1438518f24e1dab7564ca91aa8479f2680e50aa40442a7","target":"record","created_at":"2026-05-18T03:34:47Z","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":"eb9f05ceb4fafddce705a107f98997b9db2efe8f6e180caae5f31c95e114a06d","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-01T14:03:26Z","title_canon_sha256":"d0e1c7198c050c58d1ec1c7df63aaad27386b03a89a06896d180c3289cd63d10"},"schema_version":"1.0","source":{"id":"1302.0188","kind":"arxiv","version":1}},"canonical_sha256":"731c9b1c996e92bc4274d20da294e2a2b8c7b182f058b4f5394b01d6b44add1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"731c9b1c996e92bc4274d20da294e2a2b8c7b182f058b4f5394b01d6b44add1d","first_computed_at":"2026-05-18T03:34:47.130691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:47.130691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1tOK/MpVcQww/yl5695WxQwvzL4l6E2PDJfzOw16a/Lw4C2X6FcjruzLixW1m69oD7ceLzHlkhXYcvNft8tQAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:47.131222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0188","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5676c6baf5070d957d1438518f24e1dab7564ca91aa8479f2680e50aa40442a7","sha256:d492cd18976b59eb6410f4c09a414da5ddd1805fe73e1dedc5418b021469c256"],"state_sha256":"560609ec6e7b30aad22bea8b4da49c3fdfb0bb08e70f4df36b24f82144bed5d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hlKbZJQisVg7bUXS/3EIj4GxX7zuSV0eamM1bEXMlIbyuO7WRz2JmHuBB+CxNdS/YXWF8bTGyLJNKBXZiZa2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:42:43.332983Z","bundle_sha256":"8db058d201597cc3bd47c29b0ba41f184e72ff9a4a6dbc795f3516e9fb0813c4"}}