{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:SG3CBZTTH7SBSEWWHHT4ITEFGR","short_pith_number":"pith:SG3CBZTT","schema_version":"1.0","canonical_sha256":"91b620e6733fe41912d639e7c44c853445a3700e9c566295791dcfd267744712","source":{"kind":"arxiv","id":"cond-mat/9705259","version":1},"attestation_state":"computed","paper":{"title":"Bounds on learning in polynomial time","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"Anthea Bethge, Heinz Horner","submitted_at":"1997-05-26T14:06:00Z","abstract_excerpt":"The performance of large neural networks can be judged not only by their storage capacity but also by the time required for learning. A polynomial learning algorithm with learning time $\\sim N^2$ in a network with $N$ units might be practical whereas a learning time $\\sim e^N$ would allow rather small networks only. The question of absolute storage capacity $\\alpha_c$ and capacity for polynomial learning rules $\\alpha_p$ is discussed for several feed-forward architectures, the perceptron, the binary perceptron, the committee machine and a perceptron with fixed weights in the first layer and ad"},"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/9705259","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.dis-nn","submitted_at":"1997-05-26T14:06:00Z","cross_cats_sorted":[],"title_canon_sha256":"4d640b0021b217621273b785ac34153cb28a1ef5e6ce6f1ecb1a8c89b5a0a509","abstract_canon_sha256":"df105c1ea7e909fb7907b5d9dac88eebbb9999d32cf3d5df2856b4fed872bcf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:08.015301Z","signature_b64":"cMVZGeGiRFAPcrTu+iQ7CrpN3OOATasPPV3D0hjXLM35L0yJbKv9IZ8kyD/Bi34RfnVm6i6tBVGtbLDAfjTxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91b620e6733fe41912d639e7c44c853445a3700e9c566295791dcfd267744712","last_reissued_at":"2026-05-18T00:51:08.014817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:08.014817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on learning in polynomial time","license":"","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"Anthea Bethge, Heinz Horner","submitted_at":"1997-05-26T14:06:00Z","abstract_excerpt":"The performance of large neural networks can be judged not only by their storage capacity but also by the time required for learning. A polynomial learning algorithm with learning time $\\sim N^2$ in a network with $N$ units might be practical whereas a learning time $\\sim e^N$ would allow rather small networks only. The question of absolute storage capacity $\\alpha_c$ and capacity for polynomial learning rules $\\alpha_p$ is discussed for several feed-forward architectures, the perceptron, the binary perceptron, the committee machine and a perceptron with fixed weights in the first layer and ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/9705259","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/9705259","created_at":"2026-05-18T00:51:08.014894+00:00"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/9705259v1","created_at":"2026-05-18T00:51:08.014894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/9705259","created_at":"2026-05-18T00:51:08.014894+00:00"},{"alias_kind":"pith_short_12","alias_value":"SG3CBZTTH7SB","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_16","alias_value":"SG3CBZTTH7SBSEWW","created_at":"2026-05-18T12:25:48.327863+00:00"},{"alias_kind":"pith_short_8","alias_value":"SG3CBZTT","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/SG3CBZTTH7SBSEWWHHT4ITEFGR","json":"https://pith.science/pith/SG3CBZTTH7SBSEWWHHT4ITEFGR.json","graph_json":"https://pith.science/api/pith-number/SG3CBZTTH7SBSEWWHHT4ITEFGR/graph.json","events_json":"https://pith.science/api/pith-number/SG3CBZTTH7SBSEWWHHT4ITEFGR/events.json","paper":"https://pith.science/paper/SG3CBZTT"},"agent_actions":{"view_html":"https://pith.science/pith/SG3CBZTTH7SBSEWWHHT4ITEFGR","download_json":"https://pith.science/pith/SG3CBZTTH7SBSEWWHHT4ITEFGR.json","view_paper":"https://pith.science/paper/SG3CBZTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cond-mat/9705259&json=true","fetch_graph":"https://pith.science/api/pith-number/SG3CBZTTH7SBSEWWHHT4ITEFGR/graph.json","fetch_events":"https://pith.science/api/pith-number/SG3CBZTTH7SBSEWWHHT4ITEFGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SG3CBZTTH7SBSEWWHHT4ITEFGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SG3CBZTTH7SBSEWWHHT4ITEFGR/action/storage_attestation","attest_author":"https://pith.science/pith/SG3CBZTTH7SBSEWWHHT4ITEFGR/action/author_attestation","sign_citation":"https://pith.science/pith/SG3CBZTTH7SBSEWWHHT4ITEFGR/action/citation_signature","submit_replication":"https://pith.science/pith/SG3CBZTTH7SBSEWWHHT4ITEFGR/action/replication_record"}},"created_at":"2026-05-18T00:51:08.014894+00:00","updated_at":"2026-05-18T00:51:08.014894+00:00"}