{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:YGEPZG6QZJOADSSA5HLQ43TXLY","short_pith_number":"pith:YGEPZG6Q","schema_version":"1.0","canonical_sha256":"c188fc9bd0ca5c01ca40e9d70e6e775e0ca2b67015d7beec22dfa28c4baf6459","source":{"kind":"arxiv","id":"cond-mat/9611130","version":1},"attestation_state":"computed","paper":{"title":"Learning by dilution in a Neural Network","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"B. Lopez, W. Kinzel","submitted_at":"1996-11-18T11:54:30Z","abstract_excerpt":"A perceptron with N random weights can store of the order of N patterns by removing a fraction of the weights without changing their strengths. The critical storage capacity as a function of the concentration of the remaining bonds for random outputs and for outputs given by a teacher perceptron is calculated. A simple Hebb-like dilution algorithm is presented which in the teacher case reaches the optimal generalization ability."},"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":"cond-mat/9611130","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"1996-11-18T11:54:30Z","cross_cats_sorted":[],"title_canon_sha256":"388fb12398313231107992bbfac176b22473c74e61476d4fe85b948164bd7420","abstract_canon_sha256":"bb69465496cd08b6b09262e3d2c2f644529366d1f3ec82448acc912a0b06386b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:09.059398Z","signature_b64":"zxG5YNE8cRi8QogCJ8BcS0OXnRvKhROq8XAQ3Mftbxn04B4WlD581Y/cW56VB5mW9ht1R7Qw5Y2vFdK/+K4oCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c188fc9bd0ca5c01ca40e9d70e6e775e0ca2b67015d7beec22dfa28c4baf6459","last_reissued_at":"2026-05-18T01:07:09.058999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:09.058999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning by dilution in a Neural Network","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"B. Lopez, W. Kinzel","submitted_at":"1996-11-18T11:54:30Z","abstract_excerpt":"A perceptron with N random weights can store of the order of N patterns by removing a fraction of the weights without changing their strengths. The critical storage capacity as a function of the concentration of the remaining bonds for random outputs and for outputs given by a teacher perceptron is calculated. A simple Hebb-like dilution algorithm is presented which in the teacher case reaches the optimal generalization ability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/9611130","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":"cond-mat/9611130","created_at":"2026-05-18T01:07:09.059051+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/9611130v1","created_at":"2026-05-18T01:07:09.059051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/9611130","created_at":"2026-05-18T01:07:09.059051+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGEPZG6QZJOA","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGEPZG6QZJOADSSA","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGEPZG6Q","created_at":"2026-05-18T12:25:48.327863+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/YGEPZG6QZJOADSSA5HLQ43TXLY","json":"https://pith.science/pith/YGEPZG6QZJOADSSA5HLQ43TXLY.json","graph_json":"https://pith.science/api/pith-number/YGEPZG6QZJOADSSA5HLQ43TXLY/graph.json","events_json":"https://pith.science/api/pith-number/YGEPZG6QZJOADSSA5HLQ43TXLY/events.json","paper":"https://pith.science/paper/YGEPZG6Q"},"agent_actions":{"view_html":"https://pith.science/pith/YGEPZG6QZJOADSSA5HLQ43TXLY","download_json":"https://pith.science/pith/YGEPZG6QZJOADSSA5HLQ43TXLY.json","view_paper":"https://pith.science/paper/YGEPZG6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/9611130&json=true","fetch_graph":"https://pith.science/api/pith-number/YGEPZG6QZJOADSSA5HLQ43TXLY/graph.json","fetch_events":"https://pith.science/api/pith-number/YGEPZG6QZJOADSSA5HLQ43TXLY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGEPZG6QZJOADSSA5HLQ43TXLY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGEPZG6QZJOADSSA5HLQ43TXLY/action/storage_attestation","attest_author":"https://pith.science/pith/YGEPZG6QZJOADSSA5HLQ43TXLY/action/author_attestation","sign_citation":"https://pith.science/pith/YGEPZG6QZJOADSSA5HLQ43TXLY/action/citation_signature","submit_replication":"https://pith.science/pith/YGEPZG6QZJOADSSA5HLQ43TXLY/action/replication_record"}},"created_at":"2026-05-18T01:07:09.059051+00:00","updated_at":"2026-05-18T01:07:09.059051+00:00"}