{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YLPXU4LP2ZV42HP5YOXYB3EBER","short_pith_number":"pith:YLPXU4LP","canonical_record":{"source":{"id":"1707.02227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-07-05T22:58:56Z","cross_cats_sorted":[],"title_canon_sha256":"61ee9486b61477ce5359f755d2a141581c03b7198a585389b64c2b953d51e524","abstract_canon_sha256":"40b77b5373a11f457fbd000e844bed4e3fada2843716ffcee05b88fb292373d5"},"schema_version":"1.0"},"canonical_sha256":"c2df7a716fd66bcd1dfdc3af80ec81245bc2f26de10e53d8cae3230c0c157531","source":{"kind":"arxiv","id":"1707.02227","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02227","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02227v1","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02227","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"pith_short_12","alias_value":"YLPXU4LP2ZV4","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YLPXU4LP2ZV42HP5","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YLPXU4LP","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YLPXU4LP2ZV42HP5YOXYB3EBER","target":"record","payload":{"canonical_record":{"source":{"id":"1707.02227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-07-05T22:58:56Z","cross_cats_sorted":[],"title_canon_sha256":"61ee9486b61477ce5359f755d2a141581c03b7198a585389b64c2b953d51e524","abstract_canon_sha256":"40b77b5373a11f457fbd000e844bed4e3fada2843716ffcee05b88fb292373d5"},"schema_version":"1.0"},"canonical_sha256":"c2df7a716fd66bcd1dfdc3af80ec81245bc2f26de10e53d8cae3230c0c157531","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:42.495133Z","signature_b64":"yTnt43cNuLqvqYk7AiJh4r0R/lvdqw2fCXEnpMrJkiX25s7PHQf4Yz+uEKXX+G4lmJaUBN+wqh2VZNXgtXfkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2df7a716fd66bcd1dfdc3af80ec81245bc2f26de10e53d8cae3230c0c157531","last_reissued_at":"2026-05-18T00:40:42.494410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:42.494410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.02227","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-18T00:40:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5pF3GeiwDWgCo9DlzKTP2aIzJE4uk1sWMMNtQV4J5aCC/9OkYkNMWH+i5zN5E7yIbacPBACzlY0pHo2vRp3xBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:13:33.114781Z"},"content_sha256":"f60c30046c65a1a70e5e855966e12d79e5f231449fb3e22bea181fa989e8d1c9","schema_version":"1.0","event_id":"sha256:f60c30046c65a1a70e5e855966e12d79e5f231449fb3e22bea181fa989e8d1c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YLPXU4LP2ZV42HP5YOXYB3EBER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coloring Fibonacci-Cayley tree: An application to neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Chih-Hung Chang, Jung-Chao Ban","submitted_at":"2017-07-05T22:58:56Z","abstract_excerpt":"This paper investigates the coloring problem on Fibonacci-Cayley tree, which is a Cayley graph whose vertex set is the Fibonacci sequence. More precisely, we elucidate the complexity of shifts of finite type defined on Fibonacci-Cayley tree via an invariant called entropy. It comes that computing the entropy of a Fibonacci tree-shift of finite type is equivalent to studying a nonlinear recursive system. After proposing an algorithm for the computation of entropy, we apply the result to neural networks defined on Fibonacci-Cayley tree, which reflect those neural systems with neuronal dysfunctio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02227","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-18T00:40:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPtM62BB1jmQ3qyaihD+kPcGX6RNm3TRP1VshTvGW0Xt8n2VciSofAVOtkDiwDxn5e6zyE6NdZl99oGHEUygDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:13:33.115382Z"},"content_sha256":"c9ecf943bdf9b0093b6f7c7bf352152fb696e39a0095f0d1f4441758334f1e16","schema_version":"1.0","event_id":"sha256:c9ecf943bdf9b0093b6f7c7bf352152fb696e39a0095f0d1f4441758334f1e16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLPXU4LP2ZV42HP5YOXYB3EBER/bundle.json","state_url":"https://pith.science/pith/YLPXU4LP2ZV42HP5YOXYB3EBER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLPXU4LP2ZV42HP5YOXYB3EBER/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-05-31T07:13:33Z","links":{"resolver":"https://pith.science/pith/YLPXU4LP2ZV42HP5YOXYB3EBER","bundle":"https://pith.science/pith/YLPXU4LP2ZV42HP5YOXYB3EBER/bundle.json","state":"https://pith.science/pith/YLPXU4LP2ZV42HP5YOXYB3EBER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLPXU4LP2ZV42HP5YOXYB3EBER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YLPXU4LP2ZV42HP5YOXYB3EBER","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":"40b77b5373a11f457fbd000e844bed4e3fada2843716ffcee05b88fb292373d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-07-05T22:58:56Z","title_canon_sha256":"61ee9486b61477ce5359f755d2a141581c03b7198a585389b64c2b953d51e524"},"schema_version":"1.0","source":{"id":"1707.02227","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02227","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02227v1","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02227","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"pith_short_12","alias_value":"YLPXU4LP2ZV4","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YLPXU4LP2ZV42HP5","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YLPXU4LP","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:c9ecf943bdf9b0093b6f7c7bf352152fb696e39a0095f0d1f4441758334f1e16","target":"graph","created_at":"2026-05-18T00:40:42Z","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":"This paper investigates the coloring problem on Fibonacci-Cayley tree, which is a Cayley graph whose vertex set is the Fibonacci sequence. More precisely, we elucidate the complexity of shifts of finite type defined on Fibonacci-Cayley tree via an invariant called entropy. It comes that computing the entropy of a Fibonacci tree-shift of finite type is equivalent to studying a nonlinear recursive system. After proposing an algorithm for the computation of entropy, we apply the result to neural networks defined on Fibonacci-Cayley tree, which reflect those neural systems with neuronal dysfunctio","authors_text":"Chih-Hung Chang, Jung-Chao Ban","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-07-05T22:58:56Z","title":"Coloring Fibonacci-Cayley tree: An application to neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02227","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:f60c30046c65a1a70e5e855966e12d79e5f231449fb3e22bea181fa989e8d1c9","target":"record","created_at":"2026-05-18T00:40:42Z","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":"40b77b5373a11f457fbd000e844bed4e3fada2843716ffcee05b88fb292373d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-07-05T22:58:56Z","title_canon_sha256":"61ee9486b61477ce5359f755d2a141581c03b7198a585389b64c2b953d51e524"},"schema_version":"1.0","source":{"id":"1707.02227","kind":"arxiv","version":1}},"canonical_sha256":"c2df7a716fd66bcd1dfdc3af80ec81245bc2f26de10e53d8cae3230c0c157531","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2df7a716fd66bcd1dfdc3af80ec81245bc2f26de10e53d8cae3230c0c157531","first_computed_at":"2026-05-18T00:40:42.494410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:42.494410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yTnt43cNuLqvqYk7AiJh4r0R/lvdqw2fCXEnpMrJkiX25s7PHQf4Yz+uEKXX+G4lmJaUBN+wqh2VZNXgtXfkAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:42.495133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02227","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f60c30046c65a1a70e5e855966e12d79e5f231449fb3e22bea181fa989e8d1c9","sha256:c9ecf943bdf9b0093b6f7c7bf352152fb696e39a0095f0d1f4441758334f1e16"],"state_sha256":"588a41b2b08f4c74d1e0af4bcacca8a41a7ebdb7706d46d6052b11483bf51d32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F33EHJYf2bNKyG/Byf/UbkgdB6Hid1QZORJ0+7YsaAPDlWogdESoarWnIuI22mXz3eevA6DvF1d34QOCG+q9Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:13:33.118967Z","bundle_sha256":"c8ca039d4c023081010413be3b42a4af071a98165cbfeba8e660be974ea76767"}}