{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OC2WHAMU3C2CXVXWJIY5T6WTSC","short_pith_number":"pith:OC2WHAMU","schema_version":"1.0","canonical_sha256":"70b5638194d8b42bd6f64a31d9fad39085ba3d2917164ef5dddae641dd58a7a9","source":{"kind":"arxiv","id":"2406.16689","version":1},"attestation_state":"computed","paper":{"title":"Coding schemes in neural networks learning classification tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Van Meegen, Haim Sompolinsky","submitted_at":"2024-06-24T14:50:05Z","abstract_excerpt":"Neural networks posses the crucial ability to generate meaningful representations of task-dependent features. Indeed, with appropriate scaling, supervised learning in neural networks can result in strong, task-dependent feature learning. However, the nature of the emergent representations, which we call the `coding scheme', is still unclear. To understand the emergent coding scheme, we investigate fully-connected, wide neural networks learning classification tasks using the Bayesian framework where learning shapes the posterior distribution of the network weights. Consistent with previous find"},"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":"2406.16689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-24T14:50:05Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","stat.ML"],"title_canon_sha256":"d4fa5bd079cec83432c9a02d97ccd323c2633096fb5c1f193f9c05fd6ecbc20b","abstract_canon_sha256":"25df9534b23f570a7d33671bad4d4ea17bd1b8a7d5d0b619d5c21a6e45803da2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:59.679166Z","signature_b64":"Kb3BCEsTAvpWkta6CnXnZuu2L6NxqwzMVC2SmSW5aCNLfUMw4wiSGG2btzkijaBYwvZ2h6h8vgjUt5GF25nXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70b5638194d8b42bd6f64a31d9fad39085ba3d2917164ef5dddae641dd58a7a9","last_reissued_at":"2026-07-05T11:00:59.678612Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:59.678612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coding schemes in neural networks learning classification tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander Van Meegen, Haim Sompolinsky","submitted_at":"2024-06-24T14:50:05Z","abstract_excerpt":"Neural networks posses the crucial ability to generate meaningful representations of task-dependent features. Indeed, with appropriate scaling, supervised learning in neural networks can result in strong, task-dependent feature learning. However, the nature of the emergent representations, which we call the `coding scheme', is still unclear. To understand the emergent coding scheme, we investigate fully-connected, wide neural networks learning classification tasks using the Bayesian framework where learning shapes the posterior distribution of the network weights. Consistent with previous find"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16689","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.16689/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.16689","created_at":"2026-07-05T11:00:59.678682+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.16689v1","created_at":"2026-07-05T11:00:59.678682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16689","created_at":"2026-07-05T11:00:59.678682+00:00"},{"alias_kind":"pith_short_12","alias_value":"OC2WHAMU3C2C","created_at":"2026-07-05T11:00:59.678682+00:00"},{"alias_kind":"pith_short_16","alias_value":"OC2WHAMU3C2CXVXW","created_at":"2026-07-05T11:00:59.678682+00:00"},{"alias_kind":"pith_short_8","alias_value":"OC2WHAMU","created_at":"2026-07-05T11:00:59.678682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07998","citing_title":"Adaptive kernel predictors from feature-learning infinite limits of neural networks","ref_index":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OC2WHAMU3C2CXVXWJIY5T6WTSC","json":"https://pith.science/pith/OC2WHAMU3C2CXVXWJIY5T6WTSC.json","graph_json":"https://pith.science/api/pith-number/OC2WHAMU3C2CXVXWJIY5T6WTSC/graph.json","events_json":"https://pith.science/api/pith-number/OC2WHAMU3C2CXVXWJIY5T6WTSC/events.json","paper":"https://pith.science/paper/OC2WHAMU"},"agent_actions":{"view_html":"https://pith.science/pith/OC2WHAMU3C2CXVXWJIY5T6WTSC","download_json":"https://pith.science/pith/OC2WHAMU3C2CXVXWJIY5T6WTSC.json","view_paper":"https://pith.science/paper/OC2WHAMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.16689&json=true","fetch_graph":"https://pith.science/api/pith-number/OC2WHAMU3C2CXVXWJIY5T6WTSC/graph.json","fetch_events":"https://pith.science/api/pith-number/OC2WHAMU3C2CXVXWJIY5T6WTSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OC2WHAMU3C2CXVXWJIY5T6WTSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OC2WHAMU3C2CXVXWJIY5T6WTSC/action/storage_attestation","attest_author":"https://pith.science/pith/OC2WHAMU3C2CXVXWJIY5T6WTSC/action/author_attestation","sign_citation":"https://pith.science/pith/OC2WHAMU3C2CXVXWJIY5T6WTSC/action/citation_signature","submit_replication":"https://pith.science/pith/OC2WHAMU3C2CXVXWJIY5T6WTSC/action/replication_record"}},"created_at":"2026-07-05T11:00:59.678682+00:00","updated_at":"2026-07-05T11:00:59.678682+00:00"}