{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O3FXX6XSSCDDQW26M4B62YH2AQ","short_pith_number":"pith:O3FXX6XS","schema_version":"1.0","canonical_sha256":"76cb7bfaf29086385b5e6703ed60fa04348c66a08175d7baf07aded7ba613ddf","source":{"kind":"arxiv","id":"1801.01554","version":1},"attestation_state":"computed","paper":{"title":"An Implementation of Back-Propagation Learning on GF11, a Large SIMD Parallel Computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NE"],"primary_cat":"cs.LG","authors_text":"Marco Zagha, Michael Witbrock","submitted_at":"2018-01-04T21:52:28Z","abstract_excerpt":"Current connectionist simulations require huge computational resources. We describe a neural network simulator for the IBM GF11, an experimental SIMD machine with 566 processors and a peak arithmetic performance of 11 Gigaflops. We present our parallel implementation of the backpropagation learning algorithm, techniques for increasing efficiency, performance measurements on the NetTalk text-to-speech benchmark, and a performance model for the simulator. Our simulator currently runs the back-propagation learning algorithm at 900 million connections per second, where each \"connection per second\""},"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":"1801.01554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-04T21:52:28Z","cross_cats_sorted":["cs.DC","cs.NE"],"title_canon_sha256":"e9c8d31d121205336ebf1e6b45d376e7d8ce7f8fd018abb3cf57351d0d453f42","abstract_canon_sha256":"7489e3d23f2d872441c3a7a9c289d3f4be1a47ae18256c9faa61fb47553b925f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:41.842753Z","signature_b64":"uYijcHfi9Fyeev5rHd5rVUqtMzVNpExjWQl51jC+cv6D4Sk+mewvjid/plVbceDVlimMFaMLmwDyT/lI9curCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76cb7bfaf29086385b5e6703ed60fa04348c66a08175d7baf07aded7ba613ddf","last_reissued_at":"2026-05-18T00:26:41.842309Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:41.842309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Implementation of Back-Propagation Learning on GF11, a Large SIMD Parallel Computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NE"],"primary_cat":"cs.LG","authors_text":"Marco Zagha, Michael Witbrock","submitted_at":"2018-01-04T21:52:28Z","abstract_excerpt":"Current connectionist simulations require huge computational resources. We describe a neural network simulator for the IBM GF11, an experimental SIMD machine with 566 processors and a peak arithmetic performance of 11 Gigaflops. We present our parallel implementation of the backpropagation learning algorithm, techniques for increasing efficiency, performance measurements on the NetTalk text-to-speech benchmark, and a performance model for the simulator. Our simulator currently runs the back-propagation learning algorithm at 900 million connections per second, where each \"connection per second\""},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01554","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":"1801.01554","created_at":"2026-05-18T00:26:41.842375+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01554v1","created_at":"2026-05-18T00:26:41.842375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01554","created_at":"2026-05-18T00:26:41.842375+00:00"},{"alias_kind":"pith_short_12","alias_value":"O3FXX6XSSCDD","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"O3FXX6XSSCDDQW26","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"O3FXX6XS","created_at":"2026-05-18T12:32:40.477152+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/O3FXX6XSSCDDQW26M4B62YH2AQ","json":"https://pith.science/pith/O3FXX6XSSCDDQW26M4B62YH2AQ.json","graph_json":"https://pith.science/api/pith-number/O3FXX6XSSCDDQW26M4B62YH2AQ/graph.json","events_json":"https://pith.science/api/pith-number/O3FXX6XSSCDDQW26M4B62YH2AQ/events.json","paper":"https://pith.science/paper/O3FXX6XS"},"agent_actions":{"view_html":"https://pith.science/pith/O3FXX6XSSCDDQW26M4B62YH2AQ","download_json":"https://pith.science/pith/O3FXX6XSSCDDQW26M4B62YH2AQ.json","view_paper":"https://pith.science/paper/O3FXX6XS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01554&json=true","fetch_graph":"https://pith.science/api/pith-number/O3FXX6XSSCDDQW26M4B62YH2AQ/graph.json","fetch_events":"https://pith.science/api/pith-number/O3FXX6XSSCDDQW26M4B62YH2AQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O3FXX6XSSCDDQW26M4B62YH2AQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O3FXX6XSSCDDQW26M4B62YH2AQ/action/storage_attestation","attest_author":"https://pith.science/pith/O3FXX6XSSCDDQW26M4B62YH2AQ/action/author_attestation","sign_citation":"https://pith.science/pith/O3FXX6XSSCDDQW26M4B62YH2AQ/action/citation_signature","submit_replication":"https://pith.science/pith/O3FXX6XSSCDDQW26M4B62YH2AQ/action/replication_record"}},"created_at":"2026-05-18T00:26:41.842375+00:00","updated_at":"2026-05-18T00:26:41.842375+00:00"}