{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:DMVKW6GXTIPVVNJ5XHSSMHZF73","short_pith_number":"pith:DMVKW6GX","canonical_record":{"source":{"id":"math/0509648","kind":"arxiv","version":9},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-09-27T22:24:05Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"07fa58d1c9bcfc30b5d6d09145a5e49ca69076e2343f0f6822b8c693369edaf5","abstract_canon_sha256":"d35c8ef2bd692cccf009c71a4d6fe1c25eb6b7f6db8b8b60c5ecb794c84638a9"},"schema_version":"1.0"},"canonical_sha256":"1b2aab78d79a1f5ab53db9e5261f25fec02134f5ea58a0836b9bc399d5ff9972","source":{"kind":"arxiv","id":"math/0509648","version":9},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0509648","created_at":"2026-07-04T14:50:38Z"},{"alias_kind":"arxiv_version","alias_value":"math/0509648v9","created_at":"2026-07-04T14:50:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0509648","created_at":"2026-07-04T14:50:38Z"},{"alias_kind":"pith_short_12","alias_value":"DMVKW6GXTIPV","created_at":"2026-07-04T14:50:38Z"},{"alias_kind":"pith_short_16","alias_value":"DMVKW6GXTIPVVNJ5","created_at":"2026-07-04T14:50:38Z"},{"alias_kind":"pith_short_8","alias_value":"DMVKW6GX","created_at":"2026-07-04T14:50:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:DMVKW6GXTIPVVNJ5XHSSMHZF73","target":"record","payload":{"canonical_record":{"source":{"id":"math/0509648","kind":"arxiv","version":9},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-09-27T22:24:05Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"07fa58d1c9bcfc30b5d6d09145a5e49ca69076e2343f0f6822b8c693369edaf5","abstract_canon_sha256":"d35c8ef2bd692cccf009c71a4d6fe1c25eb6b7f6db8b8b60c5ecb794c84638a9"},"schema_version":"1.0"},"canonical_sha256":"1b2aab78d79a1f5ab53db9e5261f25fec02134f5ea58a0836b9bc399d5ff9972","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:50:38.788127Z","signature_b64":"VNYRkrp3nJxTQiDO5m0OcUkhDFN9/9mndBt/tskDCi+Tm1OenOMwVnZxpCDbT9Vajdr612kscSf0qQyKPDhFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b2aab78d79a1f5ab53db9e5261f25fec02134f5ea58a0836b9bc399d5ff9972","last_reissued_at":"2026-07-04T14:50:38.787763Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:50:38.787763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0509648","source_version":9,"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-04T14:50:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bvBcK9ABeGLnfUkHAW0bqMUrscc6K+1JTGrz/F0TgGEYpXmdpnXwVFippomc3XbhPEAQDHwoydQWE6jD5eY3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T00:57:19.726471Z"},"content_sha256":"323c788ff0426039e46bb0f569d26f784cf77e179e1b30009031082246f06549","schema_version":"1.0","event_id":"sha256:323c788ff0426039e46bb0f569d26f784cf77e179e1b30009031082246f06549"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:DMVKW6GXTIPVVNJ5XHSSMHZF73","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A combinatorial identity with application to Catalan numbers","license":"","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Hao Pan, Zhi-Wei Sun","submitted_at":"2005-09-27T22:24:05Z","abstract_excerpt":"By a very simple argument, we prove that if $l,m,n$ are nonnegative integers then $$\\sum_{k=0}^l(-1)^{m-k}\\binom{l}{k}\\binom{m-k}{n}\\binom{2k}{k-2l+m} =\\sum_{k=0}^l\\binom{l}{k}\\binom{2k}{n}\\binom{n-l}{m+n-3k-l}.\n  On the basis of this identity, for $d,r=0,1,2,...$ we construct explicit $F(d,r)$ and $G(d,r)$ such that for any prime $p>\\max\\{d,r\\}$ we have\n  \\sum_{k=1}^{p-1}k^r C_{k+d}\\equiv \\cases F(d,r)(mod p)& if 3|p-1, \\\\G(d,r)\\ (mod p)& if 3|p-2,\n  where $C_n$ denotes the Catalan number $(n+1)^{-1}\\binom{2n}{n}$. For example, when $p\\geq 5$ is a prime, we have\n  \\sum_{k=1}^{p-1}k^2C_k\\equiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0509648","kind":"arxiv","version":9},"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/0509648/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-04T14:50:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/00d1aMkzJ7cp1XTG5zqQkCjJbGewuHhC5jNwBl+5lDqp9aOOYH0OhriJsug5ldKxsEn2lYE0p1cOdawTVHrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T00:57:19.727075Z"},"content_sha256":"2fe36de66f54ebf88e20c1e767d1ae702044725c85b6e14f6bb7a8dade8aa15c","schema_version":"1.0","event_id":"sha256:2fe36de66f54ebf88e20c1e767d1ae702044725c85b6e14f6bb7a8dade8aa15c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMVKW6GXTIPVVNJ5XHSSMHZF73/bundle.json","state_url":"https://pith.science/pith/DMVKW6GXTIPVVNJ5XHSSMHZF73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMVKW6GXTIPVVNJ5XHSSMHZF73/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-04T00:57:19Z","links":{"resolver":"https://pith.science/pith/DMVKW6GXTIPVVNJ5XHSSMHZF73","bundle":"https://pith.science/pith/DMVKW6GXTIPVVNJ5XHSSMHZF73/bundle.json","state":"https://pith.science/pith/DMVKW6GXTIPVVNJ5XHSSMHZF73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMVKW6GXTIPVVNJ5XHSSMHZF73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:DMVKW6GXTIPVVNJ5XHSSMHZF73","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":"d35c8ef2bd692cccf009c71a4d6fe1c25eb6b7f6db8b8b60c5ecb794c84638a9","cross_cats_sorted":["math.NT"],"license":"","primary_cat":"math.CO","submitted_at":"2005-09-27T22:24:05Z","title_canon_sha256":"07fa58d1c9bcfc30b5d6d09145a5e49ca69076e2343f0f6822b8c693369edaf5"},"schema_version":"1.0","source":{"id":"math/0509648","kind":"arxiv","version":9}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0509648","created_at":"2026-07-04T14:50:38Z"},{"alias_kind":"arxiv_version","alias_value":"math/0509648v9","created_at":"2026-07-04T14:50:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0509648","created_at":"2026-07-04T14:50:38Z"},{"alias_kind":"pith_short_12","alias_value":"DMVKW6GXTIPV","created_at":"2026-07-04T14:50:38Z"},{"alias_kind":"pith_short_16","alias_value":"DMVKW6GXTIPVVNJ5","created_at":"2026-07-04T14:50:38Z"},{"alias_kind":"pith_short_8","alias_value":"DMVKW6GX","created_at":"2026-07-04T14:50:38Z"}],"graph_snapshots":[{"event_id":"sha256:2fe36de66f54ebf88e20c1e767d1ae702044725c85b6e14f6bb7a8dade8aa15c","target":"graph","created_at":"2026-07-04T14:50:38Z","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/0509648/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"By a very simple argument, we prove that if $l,m,n$ are nonnegative integers then $$\\sum_{k=0}^l(-1)^{m-k}\\binom{l}{k}\\binom{m-k}{n}\\binom{2k}{k-2l+m} =\\sum_{k=0}^l\\binom{l}{k}\\binom{2k}{n}\\binom{n-l}{m+n-3k-l}.\n  On the basis of this identity, for $d,r=0,1,2,...$ we construct explicit $F(d,r)$ and $G(d,r)$ such that for any prime $p>\\max\\{d,r\\}$ we have\n  \\sum_{k=1}^{p-1}k^r C_{k+d}\\equiv \\cases F(d,r)(mod p)& if 3|p-1, \\\\G(d,r)\\ (mod p)& if 3|p-2,\n  where $C_n$ denotes the Catalan number $(n+1)^{-1}\\binom{2n}{n}$. For example, when $p\\geq 5$ is a prime, we have\n  \\sum_{k=1}^{p-1}k^2C_k\\equiv","authors_text":"Hao Pan, Zhi-Wei Sun","cross_cats":["math.NT"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2005-09-27T22:24:05Z","title":"A combinatorial identity with application to Catalan numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0509648","kind":"arxiv","version":9},"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:323c788ff0426039e46bb0f569d26f784cf77e179e1b30009031082246f06549","target":"record","created_at":"2026-07-04T14:50:38Z","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":"d35c8ef2bd692cccf009c71a4d6fe1c25eb6b7f6db8b8b60c5ecb794c84638a9","cross_cats_sorted":["math.NT"],"license":"","primary_cat":"math.CO","submitted_at":"2005-09-27T22:24:05Z","title_canon_sha256":"07fa58d1c9bcfc30b5d6d09145a5e49ca69076e2343f0f6822b8c693369edaf5"},"schema_version":"1.0","source":{"id":"math/0509648","kind":"arxiv","version":9}},"canonical_sha256":"1b2aab78d79a1f5ab53db9e5261f25fec02134f5ea58a0836b9bc399d5ff9972","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b2aab78d79a1f5ab53db9e5261f25fec02134f5ea58a0836b9bc399d5ff9972","first_computed_at":"2026-07-04T14:50:38.787763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:50:38.787763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VNYRkrp3nJxTQiDO5m0OcUkhDFN9/9mndBt/tskDCi+Tm1OenOMwVnZxpCDbT9Vajdr612kscSf0qQyKPDhFAA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:50:38.788127Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0509648","source_kind":"arxiv","source_version":9}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:323c788ff0426039e46bb0f569d26f784cf77e179e1b30009031082246f06549","sha256:2fe36de66f54ebf88e20c1e767d1ae702044725c85b6e14f6bb7a8dade8aa15c"],"state_sha256":"82b0455f2f7a02b41a4fe13c9c30b9820d7f518b42e1b61cfdcfe0a3461a97e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4k9SmzEIu+R2iyICfWywA+j9fYhO3iQAhIZRRa2rTiuii8WIWKXPFeNXMrF72j8GsRaIcOxiTLEpLOxa0hDWBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T00:57:19.732911Z","bundle_sha256":"57ff728c397e075c7cdc1da1f37f62451d893c97f94579b6ccbe0d9ab2c7884c"}}