{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VXAAUQMUZBTELTEKOTUY2QKEO3","short_pith_number":"pith:VXAAUQMU","schema_version":"1.0","canonical_sha256":"adc00a4194c86645cc8a74e98d414476ce448a0ba25a1377a1bf0859f7e25717","source":{"kind":"arxiv","id":"1310.3796","version":1},"attestation_state":"computed","paper":{"title":"A no-go theorem for one-layer feedforward networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.GT"],"primary_cat":"q-bio.NC","authors_text":"Chad Giusti, Vladimir Itskov","submitted_at":"2013-10-14T19:16:11Z","abstract_excerpt":"It is often hypothesized that a crucial role for recurrent connections in the brain is to constrain the set of possible response patterns, thereby shaping the neural code. This implies the existence of neural codes that cannot arise solely from feedforward processing. We set out to find such codes in the context of one-layer feedforward networks, and identified a large class of combinatorial codes that indeed cannot be shaped by the feedforward architecture alone. However, these codes are difficult to distinguish from codes that share the same sets of maximal activity patterns in the presence "},"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":"1310.3796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2013-10-14T19:16:11Z","cross_cats_sorted":["math.CO","math.GT"],"title_canon_sha256":"dbb2645f7b2343ceac4e42e634b34aef800546de7371b0da63a211b7e808456d","abstract_canon_sha256":"351f8ec17ed71ca20ed6d347ff0cbe332ca83fb2153728d8aec05ddd93764ea1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:34.888748Z","signature_b64":"q+SHlgc8hfQ3WfDcTkMtSny3AIrujOPphb1xggXFzEz5DgQ1/Bey0rptXepeiHxmjsLYHBbyQo0YHbCGqbVXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adc00a4194c86645cc8a74e98d414476ce448a0ba25a1377a1bf0859f7e25717","last_reissued_at":"2026-05-18T03:10:34.888286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:34.888286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A no-go theorem for one-layer feedforward networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.GT"],"primary_cat":"q-bio.NC","authors_text":"Chad Giusti, Vladimir Itskov","submitted_at":"2013-10-14T19:16:11Z","abstract_excerpt":"It is often hypothesized that a crucial role for recurrent connections in the brain is to constrain the set of possible response patterns, thereby shaping the neural code. This implies the existence of neural codes that cannot arise solely from feedforward processing. We set out to find such codes in the context of one-layer feedforward networks, and identified a large class of combinatorial codes that indeed cannot be shaped by the feedforward architecture alone. However, these codes are difficult to distinguish from codes that share the same sets of maximal activity patterns in the presence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3796","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":"1310.3796","created_at":"2026-05-18T03:10:34.888371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.3796v1","created_at":"2026-05-18T03:10:34.888371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3796","created_at":"2026-05-18T03:10:34.888371+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXAAUQMUZBTE","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXAAUQMUZBTELTEK","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXAAUQMU","created_at":"2026-05-18T12:28:04.890932+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/VXAAUQMUZBTELTEKOTUY2QKEO3","json":"https://pith.science/pith/VXAAUQMUZBTELTEKOTUY2QKEO3.json","graph_json":"https://pith.science/api/pith-number/VXAAUQMUZBTELTEKOTUY2QKEO3/graph.json","events_json":"https://pith.science/api/pith-number/VXAAUQMUZBTELTEKOTUY2QKEO3/events.json","paper":"https://pith.science/paper/VXAAUQMU"},"agent_actions":{"view_html":"https://pith.science/pith/VXAAUQMUZBTELTEKOTUY2QKEO3","download_json":"https://pith.science/pith/VXAAUQMUZBTELTEKOTUY2QKEO3.json","view_paper":"https://pith.science/paper/VXAAUQMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.3796&json=true","fetch_graph":"https://pith.science/api/pith-number/VXAAUQMUZBTELTEKOTUY2QKEO3/graph.json","fetch_events":"https://pith.science/api/pith-number/VXAAUQMUZBTELTEKOTUY2QKEO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXAAUQMUZBTELTEKOTUY2QKEO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXAAUQMUZBTELTEKOTUY2QKEO3/action/storage_attestation","attest_author":"https://pith.science/pith/VXAAUQMUZBTELTEKOTUY2QKEO3/action/author_attestation","sign_citation":"https://pith.science/pith/VXAAUQMUZBTELTEKOTUY2QKEO3/action/citation_signature","submit_replication":"https://pith.science/pith/VXAAUQMUZBTELTEKOTUY2QKEO3/action/replication_record"}},"created_at":"2026-05-18T03:10:34.888371+00:00","updated_at":"2026-05-18T03:10:34.888371+00:00"}