{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YLPXU4LP2ZV42HP5YOXYB3EBER","short_pith_number":"pith:YLPXU4LP","schema_version":"1.0","canonical_sha256":"c2df7a716fd66bcd1dfdc3af80ec81245bc2f26de10e53d8cae3230c0c157531","source":{"kind":"arxiv","id":"1707.02227","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.02227","created_at":"2026-05-18T00:40:42.494527+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02227v1","created_at":"2026-05-18T00:40:42.494527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02227","created_at":"2026-05-18T00:40:42.494527+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLPXU4LP2ZV4","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLPXU4LP2ZV42HP5","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLPXU4LP","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YLPXU4LP2ZV42HP5YOXYB3EBER","json":"https://pith.science/pith/YLPXU4LP2ZV42HP5YOXYB3EBER.json","graph_json":"https://pith.science/api/pith-number/YLPXU4LP2ZV42HP5YOXYB3EBER/graph.json","events_json":"https://pith.science/api/pith-number/YLPXU4LP2ZV42HP5YOXYB3EBER/events.json","paper":"https://pith.science/paper/YLPXU4LP"},"agent_actions":{"view_html":"https://pith.science/pith/YLPXU4LP2ZV42HP5YOXYB3EBER","download_json":"https://pith.science/pith/YLPXU4LP2ZV42HP5YOXYB3EBER.json","view_paper":"https://pith.science/paper/YLPXU4LP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02227&json=true","fetch_graph":"https://pith.science/api/pith-number/YLPXU4LP2ZV42HP5YOXYB3EBER/graph.json","fetch_events":"https://pith.science/api/pith-number/YLPXU4LP2ZV42HP5YOXYB3EBER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLPXU4LP2ZV42HP5YOXYB3EBER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLPXU4LP2ZV42HP5YOXYB3EBER/action/storage_attestation","attest_author":"https://pith.science/pith/YLPXU4LP2ZV42HP5YOXYB3EBER/action/author_attestation","sign_citation":"https://pith.science/pith/YLPXU4LP2ZV42HP5YOXYB3EBER/action/citation_signature","submit_replication":"https://pith.science/pith/YLPXU4LP2ZV42HP5YOXYB3EBER/action/replication_record"}},"created_at":"2026-05-18T00:40:42.494527+00:00","updated_at":"2026-05-18T00:40:42.494527+00:00"}