{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:MUGQIKWEWJOBNJLRA5HGP2A23Q","short_pith_number":"pith:MUGQIKWE","schema_version":"1.0","canonical_sha256":"650d042ac4b25c16a571074e67e81adc0c25aaa2517d9c26a8d34187caeb0cfb","source":{"kind":"arxiv","id":"cs/0602036","version":1},"attestation_state":"computed","paper":{"title":"R\\'{e}seaux d'Automates de Caianiello Revisit\\'{e}","license":"","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Maurice Tchuente, Ren\\'e Ndoundam","submitted_at":"2006-02-10T06:32:29Z","abstract_excerpt":"We exhibit a family of neural networks of McCulloch and Pitts of size $2nk+2$ which can be simulated by a neural networks of Caianiello of size $2n+2$ and memory length $k$. This simulation allows us to find again one of the result of the following article: [Cycles exponentiels des r\\'{e}seaux de Caianiello et compteurs en arithm\\'{e}tique redondante, Technique et Science Informatiques Vol. 19, pages 985-1008] on the existence of neural networks of Caianiello of size $2n+2$ and memory length $k$ which describes a cycle of length $k \\times 2^{nk}$."},"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":"cs/0602036","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.NE","submitted_at":"2006-02-10T06:32:29Z","cross_cats_sorted":[],"title_canon_sha256":"cc0d7b234e4683fe93230755758d4fd346c7ef17ad910b8d643231104304b6c8","abstract_canon_sha256":"2815ee77628fc296fe5a8bfc4859f795ac5614a3c559bb2e1215bdb0f965c753"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:54.836644Z","signature_b64":"aZuCrKsN8DGegjF8o7R052sUDN6RpcUCmslrEuotn9+nXNTGfXVFHUN8erS+93cCuCD1c8k2AJvYIDY2g3csBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"650d042ac4b25c16a571074e67e81adc0c25aaa2517d9c26a8d34187caeb0cfb","last_reissued_at":"2026-05-18T01:08:54.836127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:54.836127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"R\\'{e}seaux d'Automates de Caianiello Revisit\\'{e}","license":"","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Maurice Tchuente, Ren\\'e Ndoundam","submitted_at":"2006-02-10T06:32:29Z","abstract_excerpt":"We exhibit a family of neural networks of McCulloch and Pitts of size $2nk+2$ which can be simulated by a neural networks of Caianiello of size $2n+2$ and memory length $k$. This simulation allows us to find again one of the result of the following article: [Cycles exponentiels des r\\'{e}seaux de Caianiello et compteurs en arithm\\'{e}tique redondante, Technique et Science Informatiques Vol. 19, pages 985-1008] on the existence of neural networks of Caianiello of size $2n+2$ and memory length $k$ which describes a cycle of length $k \\times 2^{nk}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0602036","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":"cs/0602036","created_at":"2026-05-18T01:08:54.836209+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0602036v1","created_at":"2026-05-18T01:08:54.836209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602036","created_at":"2026-05-18T01:08:54.836209+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUGQIKWEWJOB","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUGQIKWEWJOBNJLR","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUGQIKWE","created_at":"2026-05-18T12:25:54.717736+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/MUGQIKWEWJOBNJLRA5HGP2A23Q","json":"https://pith.science/pith/MUGQIKWEWJOBNJLRA5HGP2A23Q.json","graph_json":"https://pith.science/api/pith-number/MUGQIKWEWJOBNJLRA5HGP2A23Q/graph.json","events_json":"https://pith.science/api/pith-number/MUGQIKWEWJOBNJLRA5HGP2A23Q/events.json","paper":"https://pith.science/paper/MUGQIKWE"},"agent_actions":{"view_html":"https://pith.science/pith/MUGQIKWEWJOBNJLRA5HGP2A23Q","download_json":"https://pith.science/pith/MUGQIKWEWJOBNJLRA5HGP2A23Q.json","view_paper":"https://pith.science/paper/MUGQIKWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0602036&json=true","fetch_graph":"https://pith.science/api/pith-number/MUGQIKWEWJOBNJLRA5HGP2A23Q/graph.json","fetch_events":"https://pith.science/api/pith-number/MUGQIKWEWJOBNJLRA5HGP2A23Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUGQIKWEWJOBNJLRA5HGP2A23Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUGQIKWEWJOBNJLRA5HGP2A23Q/action/storage_attestation","attest_author":"https://pith.science/pith/MUGQIKWEWJOBNJLRA5HGP2A23Q/action/author_attestation","sign_citation":"https://pith.science/pith/MUGQIKWEWJOBNJLRA5HGP2A23Q/action/citation_signature","submit_replication":"https://pith.science/pith/MUGQIKWEWJOBNJLRA5HGP2A23Q/action/replication_record"}},"created_at":"2026-05-18T01:08:54.836209+00:00","updated_at":"2026-05-18T01:08:54.836209+00:00"}