{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O5SG3DPR4ABVY6E756K2MFML6H","short_pith_number":"pith:O5SG3DPR","canonical_record":{"source":{"id":"1901.00476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-28T21:51:52Z","cross_cats_sorted":[],"title_canon_sha256":"59daf57ee443f3ab777ff1344ad57c57c461c9eed661c951fc634d2581e18bdd","abstract_canon_sha256":"a2ff771e9d49c2fd0a4519006de7113d2f8723971db6facd9c3b27153ecb9d0d"},"schema_version":"1.0"},"canonical_sha256":"77646d8df1e0035c789fef95a6158bf1c5dfc4936e44fd689b064c968f4d2b61","source":{"kind":"arxiv","id":"1901.00476","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00476","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00476v1","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00476","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"pith_short_12","alias_value":"O5SG3DPR4ABV","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O5SG3DPR4ABVY6E7","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O5SG3DPR","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O5SG3DPR4ABVY6E756K2MFML6H","target":"record","payload":{"canonical_record":{"source":{"id":"1901.00476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-28T21:51:52Z","cross_cats_sorted":[],"title_canon_sha256":"59daf57ee443f3ab777ff1344ad57c57c461c9eed661c951fc634d2581e18bdd","abstract_canon_sha256":"a2ff771e9d49c2fd0a4519006de7113d2f8723971db6facd9c3b27153ecb9d0d"},"schema_version":"1.0"},"canonical_sha256":"77646d8df1e0035c789fef95a6158bf1c5dfc4936e44fd689b064c968f4d2b61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:03.727484Z","signature_b64":"aYMQt4fEuTUf0Sj9d09sMkXiyxT6QPiPK0gCqZr0SaaBnu9Cm7EO3K49i/sj4fHz8knB5vWrRqVJ7SW8Zy+dDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77646d8df1e0035c789fef95a6158bf1c5dfc4936e44fd689b064c968f4d2b61","last_reissued_at":"2026-05-17T23:57:03.726863Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:03.726863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.00476","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-17T23:57:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PyUA7Om4UHNRIjTpuFNLweBhs6jtmUk5CIdZsyCVBPVn736Mz9RpOmfnrX4Q7Pq+gPn2Pv0FZ7pj1sVNrY0UCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:41:14.617290Z"},"content_sha256":"71acfb37c7cc4ab2793694025bea171a5583d9c5561279bd26ed259864b6d0c2","schema_version":"1.0","event_id":"sha256:71acfb37c7cc4ab2793694025bea171a5583d9c5561279bd26ed259864b6d0c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O5SG3DPR4ABVY6E756K2MFML6H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Further Combinatorial Identities deriving from the $n$-th power of a $2 \\times 2$ matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"James Mc Laughlin, Nancy J. Wyshinski","submitted_at":"2018-12-28T21:51:52Z","abstract_excerpt":"In this paper we use a formula for the $n$-th power of a $2\\times2$ matrix $A$ (in terms of the entries in $A$) to derive various combinatorial identities. Three examples of our results follow. 1) We show that if $m$ and $n$ are positive integers and $s \\in \\{0,1,2,\\dots,$ $\\lfloor (mn-1)/2 \\rfloor \\}$, then \\begin{multline*} \\sum_{i,j,k,t}2^{1+2t-mn+n} \\frac{(-1)^{nk+i(n+1)}}{1+\\delta_{(m-1)/2,\\,i+k}} \\binom{m-1-i}{i} \\binom{m-1-2i}{k}\\times\\\\ \\binom{n(m-1-2(i+k))}{2j}\\binom{j}{t-n(i+k)} \\binom{n-1-s+t}{s-t}\\\\ =\\binom{mn-1-s}{s}. \\end{multline*} 2) The generalized Fibonacci polynomial $f_{m}("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00476","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-17T23:57:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EOxFnW2BD5MF47nvh2Cdqf01SKa/eIpe+42YHy/OMpjqLuAShRbH4sUem7mrLmFnH+2hy71FExWK/Xfbj2x8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:41:14.617670Z"},"content_sha256":"f5ad8a98deebb85d6d503b8167a9263e7d38f2bf295d6a7f15612ad5d56884b6","schema_version":"1.0","event_id":"sha256:f5ad8a98deebb85d6d503b8167a9263e7d38f2bf295d6a7f15612ad5d56884b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5SG3DPR4ABVY6E756K2MFML6H/bundle.json","state_url":"https://pith.science/pith/O5SG3DPR4ABVY6E756K2MFML6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5SG3DPR4ABVY6E756K2MFML6H/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-03T18:41:14Z","links":{"resolver":"https://pith.science/pith/O5SG3DPR4ABVY6E756K2MFML6H","bundle":"https://pith.science/pith/O5SG3DPR4ABVY6E756K2MFML6H/bundle.json","state":"https://pith.science/pith/O5SG3DPR4ABVY6E756K2MFML6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5SG3DPR4ABVY6E756K2MFML6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O5SG3DPR4ABVY6E756K2MFML6H","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":"a2ff771e9d49c2fd0a4519006de7113d2f8723971db6facd9c3b27153ecb9d0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-28T21:51:52Z","title_canon_sha256":"59daf57ee443f3ab777ff1344ad57c57c461c9eed661c951fc634d2581e18bdd"},"schema_version":"1.0","source":{"id":"1901.00476","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00476","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00476v1","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00476","created_at":"2026-05-17T23:57:03Z"},{"alias_kind":"pith_short_12","alias_value":"O5SG3DPR4ABV","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O5SG3DPR4ABVY6E7","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O5SG3DPR","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:f5ad8a98deebb85d6d503b8167a9263e7d38f2bf295d6a7f15612ad5d56884b6","target":"graph","created_at":"2026-05-17T23:57:03Z","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":"In this paper we use a formula for the $n$-th power of a $2\\times2$ matrix $A$ (in terms of the entries in $A$) to derive various combinatorial identities. Three examples of our results follow. 1) We show that if $m$ and $n$ are positive integers and $s \\in \\{0,1,2,\\dots,$ $\\lfloor (mn-1)/2 \\rfloor \\}$, then \\begin{multline*} \\sum_{i,j,k,t}2^{1+2t-mn+n} \\frac{(-1)^{nk+i(n+1)}}{1+\\delta_{(m-1)/2,\\,i+k}} \\binom{m-1-i}{i} \\binom{m-1-2i}{k}\\times\\\\ \\binom{n(m-1-2(i+k))}{2j}\\binom{j}{t-n(i+k)} \\binom{n-1-s+t}{s-t}\\\\ =\\binom{mn-1-s}{s}. \\end{multline*} 2) The generalized Fibonacci polynomial $f_{m}(","authors_text":"James Mc Laughlin, Nancy J. Wyshinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-28T21:51:52Z","title":"Further Combinatorial Identities deriving from the $n$-th power of a $2 \\times 2$ matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00476","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:71acfb37c7cc4ab2793694025bea171a5583d9c5561279bd26ed259864b6d0c2","target":"record","created_at":"2026-05-17T23:57:03Z","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":"a2ff771e9d49c2fd0a4519006de7113d2f8723971db6facd9c3b27153ecb9d0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-28T21:51:52Z","title_canon_sha256":"59daf57ee443f3ab777ff1344ad57c57c461c9eed661c951fc634d2581e18bdd"},"schema_version":"1.0","source":{"id":"1901.00476","kind":"arxiv","version":1}},"canonical_sha256":"77646d8df1e0035c789fef95a6158bf1c5dfc4936e44fd689b064c968f4d2b61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77646d8df1e0035c789fef95a6158bf1c5dfc4936e44fd689b064c968f4d2b61","first_computed_at":"2026-05-17T23:57:03.726863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:03.726863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aYMQt4fEuTUf0Sj9d09sMkXiyxT6QPiPK0gCqZr0SaaBnu9Cm7EO3K49i/sj4fHz8knB5vWrRqVJ7SW8Zy+dDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:03.727484Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00476","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71acfb37c7cc4ab2793694025bea171a5583d9c5561279bd26ed259864b6d0c2","sha256:f5ad8a98deebb85d6d503b8167a9263e7d38f2bf295d6a7f15612ad5d56884b6"],"state_sha256":"b352b5425fc9ace87bdd1af65fb588309eee4bbb792fedf72ced3bb9b921b511"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DYVRvKy7nTQht/MGVAiv5Zgj/tTENczrXgCTlHEtPp2EICJ4cIzdZMz1Ai0nbgPa1/lY/D68nYot+WdX8bEDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:41:14.619638Z","bundle_sha256":"d073942b0e88ce57986487eec6ae22ce47766f640902d6785e294b95b19ffd99"}}