{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:66BB4ORLYCMUMCI7KAGXZPQJ6W","short_pith_number":"pith:66BB4ORL","canonical_record":{"source":{"id":"1202.1817","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NT","submitted_at":"2012-02-08T20:54:24Z","cross_cats_sorted":[],"title_canon_sha256":"3b91aa8bf57e8d034a791561e62f5ab9f9feb421989d6de0350b6058ca84625f","abstract_canon_sha256":"52e2ca9a39c1ee39997e99986c5b426f5c5dea5edfddbf43be066edfae36f0a2"},"schema_version":"1.0"},"canonical_sha256":"f7821e3a2bc09946091f500d7cbe09f58835f737a94e415b0fef1405b103aed4","source":{"kind":"arxiv","id":"1202.1817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1817","created_at":"2026-05-18T04:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1817v1","created_at":"2026-05-18T04:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1817","created_at":"2026-05-18T04:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"66BB4ORLYCMU","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"66BB4ORLYCMUMCI7","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"66BB4ORL","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:66BB4ORLYCMUMCI7KAGXZPQJ6W","target":"record","payload":{"canonical_record":{"source":{"id":"1202.1817","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NT","submitted_at":"2012-02-08T20:54:24Z","cross_cats_sorted":[],"title_canon_sha256":"3b91aa8bf57e8d034a791561e62f5ab9f9feb421989d6de0350b6058ca84625f","abstract_canon_sha256":"52e2ca9a39c1ee39997e99986c5b426f5c5dea5edfddbf43be066edfae36f0a2"},"schema_version":"1.0"},"canonical_sha256":"f7821e3a2bc09946091f500d7cbe09f58835f737a94e415b0fef1405b103aed4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:50.963834Z","signature_b64":"x7YkB0y9mYP76Ird+lxd9xfdLCX8VCIyEjpZHOzh4Nf1y3YtzxwseAOrcUue9PTeI9+7xknMh6eQ4f/NgoidAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7821e3a2bc09946091f500d7cbe09f58835f737a94e415b0fef1405b103aed4","last_reissued_at":"2026-05-18T04:02:50.962959Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:50.962959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.1817","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-18T04:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J7PJ5AOvdNYNeNe8aRJO3XquCGW8UyxhiQp2BlZIMyg3zBA+oqcEUMXggrSnRT5UFFYiXnQD8al1bVp67FKvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T19:38:54.981923Z"},"content_sha256":"1f3ec899548e7bf2d7999dffbcff12f648a95a3db60d11d431fbf45722df7a20","schema_version":"1.0","event_id":"sha256:1f3ec899548e7bf2d7999dffbcff12f648a95a3db60d11d431fbf45722df7a20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:66BB4ORLYCMUMCI7KAGXZPQJ6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The adjacency matrix of one type of graph and the Fibonacci numbers","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"\\c{S}erife Burcu Bozkurt, Durmu\\c{s} Bozkurt, Fatih Y{\\i}lmaz","submitted_at":"2012-02-08T20:54:24Z","abstract_excerpt":"Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we investigate relationships between one type of graph and well-known Fibonacci sequence. In this content, we consider the adjacency matrix of one type of graph with 2k (k=1,2,...) vertices. It is also known that for any positive integer r, the (i,j)th entry of A^{r} (A is the adjacency matrix of the graph) is just the number of walks from vertex i to vertex j, that use exactly k edges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1817","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-18T04:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSIEkr4+k3ui6siVP18OtgaBmnu7GurFEMVHhoWFRDjlUgRAJHwqdComIgtgDoWwAvCrDZzL2gsFOEeNK8zlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T19:38:54.982288Z"},"content_sha256":"dccc63ca304fc4a12390710d1e84c831718f1f706b575ed30b343791538efc13","schema_version":"1.0","event_id":"sha256:dccc63ca304fc4a12390710d1e84c831718f1f706b575ed30b343791538efc13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66BB4ORLYCMUMCI7KAGXZPQJ6W/bundle.json","state_url":"https://pith.science/pith/66BB4ORLYCMUMCI7KAGXZPQJ6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66BB4ORLYCMUMCI7KAGXZPQJ6W/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-22T19:38:54Z","links":{"resolver":"https://pith.science/pith/66BB4ORLYCMUMCI7KAGXZPQJ6W","bundle":"https://pith.science/pith/66BB4ORLYCMUMCI7KAGXZPQJ6W/bundle.json","state":"https://pith.science/pith/66BB4ORLYCMUMCI7KAGXZPQJ6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66BB4ORLYCMUMCI7KAGXZPQJ6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:66BB4ORLYCMUMCI7KAGXZPQJ6W","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":"52e2ca9a39c1ee39997e99986c5b426f5c5dea5edfddbf43be066edfae36f0a2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NT","submitted_at":"2012-02-08T20:54:24Z","title_canon_sha256":"3b91aa8bf57e8d034a791561e62f5ab9f9feb421989d6de0350b6058ca84625f"},"schema_version":"1.0","source":{"id":"1202.1817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.1817","created_at":"2026-05-18T04:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1202.1817v1","created_at":"2026-05-18T04:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1817","created_at":"2026-05-18T04:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"66BB4ORLYCMU","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"66BB4ORLYCMUMCI7","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"66BB4ORL","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:dccc63ca304fc4a12390710d1e84c831718f1f706b575ed30b343791538efc13","target":"graph","created_at":"2026-05-18T04:02:50Z","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":"Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we investigate relationships between one type of graph and well-known Fibonacci sequence. In this content, we consider the adjacency matrix of one type of graph with 2k (k=1,2,...) vertices. It is also known that for any positive integer r, the (i,j)th entry of A^{r} (A is the adjacency matrix of the graph) is just the number of walks from vertex i to vertex j, that use exactly k edges.","authors_text":"\\c{S}erife Burcu Bozkurt, Durmu\\c{s} Bozkurt, Fatih Y{\\i}lmaz","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NT","submitted_at":"2012-02-08T20:54:24Z","title":"The adjacency matrix of one type of graph and the Fibonacci numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1817","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:1f3ec899548e7bf2d7999dffbcff12f648a95a3db60d11d431fbf45722df7a20","target":"record","created_at":"2026-05-18T04:02:50Z","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":"52e2ca9a39c1ee39997e99986c5b426f5c5dea5edfddbf43be066edfae36f0a2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.NT","submitted_at":"2012-02-08T20:54:24Z","title_canon_sha256":"3b91aa8bf57e8d034a791561e62f5ab9f9feb421989d6de0350b6058ca84625f"},"schema_version":"1.0","source":{"id":"1202.1817","kind":"arxiv","version":1}},"canonical_sha256":"f7821e3a2bc09946091f500d7cbe09f58835f737a94e415b0fef1405b103aed4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7821e3a2bc09946091f500d7cbe09f58835f737a94e415b0fef1405b103aed4","first_computed_at":"2026-05-18T04:02:50.962959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:50.962959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x7YkB0y9mYP76Ird+lxd9xfdLCX8VCIyEjpZHOzh4Nf1y3YtzxwseAOrcUue9PTeI9+7xknMh6eQ4f/NgoidAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:50.963834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.1817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f3ec899548e7bf2d7999dffbcff12f648a95a3db60d11d431fbf45722df7a20","sha256:dccc63ca304fc4a12390710d1e84c831718f1f706b575ed30b343791538efc13"],"state_sha256":"eeacdfaa85588c96f5929477576942443795e9e542157d5f56821d69df337974"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tlJQYAoPleCfRQHwqFxIFJHxqDPH1l4aJJw0I9pwfR44zX8siPQGmJhUkx1KHGxN8SjoUNunkstW+EvlWtl+Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T19:38:54.984524Z","bundle_sha256":"9cd6bbba56c07cd3ee9f4fa6218f33fbaf5ce829831abfad64bdb15c1c3a0da8"}}