{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3RIVVELYEVWVGT7ZVXHM3JHY6I","short_pith_number":"pith:3RIVVELY","schema_version":"1.0","canonical_sha256":"dc515a9178256d534ff9adcecda4f8f2150831f5c3827bdf75f80ba44ec05d29","source":{"kind":"arxiv","id":"1412.8534","version":1},"attestation_state":"computed","paper":{"title":"Disjunctive Normal Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Mehdi Sajjadi, Mojtaba Seyedhosseini, Tolga Tasdizen","submitted_at":"2014-12-30T02:17:30Z","abstract_excerpt":"Artificial neural networks are powerful pattern classifiers; however, they have been surpassed in accuracy by methods such as support vector machines and random forests that are also easier to use and faster to train. Backpropagation, which is used to train artificial neural networks, suffers from the herd effect problem which leads to long training times and limit classification accuracy. We use the disjunctive normal form and approximate the boolean conjunction operations with products to construct a novel network architecture. The proposed model can be trained by minimizing an error functio"},"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":"1412.8534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-12-30T02:17:30Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"2af55a5ecc462a5520851b2f3633bcb340941de8a075a3b2d3669e4117703330","abstract_canon_sha256":"a0b50671e5c1437e521f840331054f42f033145d7a7f5c9f59313e714ddcfa67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:17.168745Z","signature_b64":"86DQRlIPU7ujREsn9TLtKmaAoB/XRSMxkxBv8SjSsy/zsJ0nXWZd9OUtWLW7S65tGBTWO/WlEtkHqDBdxNpHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc515a9178256d534ff9adcecda4f8f2150831f5c3827bdf75f80ba44ec05d29","last_reissued_at":"2026-05-18T02:30:17.168308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:17.168308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disjunctive Normal Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Mehdi Sajjadi, Mojtaba Seyedhosseini, Tolga Tasdizen","submitted_at":"2014-12-30T02:17:30Z","abstract_excerpt":"Artificial neural networks are powerful pattern classifiers; however, they have been surpassed in accuracy by methods such as support vector machines and random forests that are also easier to use and faster to train. Backpropagation, which is used to train artificial neural networks, suffers from the herd effect problem which leads to long training times and limit classification accuracy. We use the disjunctive normal form and approximate the boolean conjunction operations with products to construct a novel network architecture. The proposed model can be trained by minimizing an error functio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8534","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":"1412.8534","created_at":"2026-05-18T02:30:17.168394+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8534v1","created_at":"2026-05-18T02:30:17.168394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8534","created_at":"2026-05-18T02:30:17.168394+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RIVVELYEVWV","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RIVVELYEVWVGT7Z","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RIVVELY","created_at":"2026-05-18T12:28:11.866339+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/3RIVVELYEVWVGT7ZVXHM3JHY6I","json":"https://pith.science/pith/3RIVVELYEVWVGT7ZVXHM3JHY6I.json","graph_json":"https://pith.science/api/pith-number/3RIVVELYEVWVGT7ZVXHM3JHY6I/graph.json","events_json":"https://pith.science/api/pith-number/3RIVVELYEVWVGT7ZVXHM3JHY6I/events.json","paper":"https://pith.science/paper/3RIVVELY"},"agent_actions":{"view_html":"https://pith.science/pith/3RIVVELYEVWVGT7ZVXHM3JHY6I","download_json":"https://pith.science/pith/3RIVVELYEVWVGT7ZVXHM3JHY6I.json","view_paper":"https://pith.science/paper/3RIVVELY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8534&json=true","fetch_graph":"https://pith.science/api/pith-number/3RIVVELYEVWVGT7ZVXHM3JHY6I/graph.json","fetch_events":"https://pith.science/api/pith-number/3RIVVELYEVWVGT7ZVXHM3JHY6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RIVVELYEVWVGT7ZVXHM3JHY6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RIVVELYEVWVGT7ZVXHM3JHY6I/action/storage_attestation","attest_author":"https://pith.science/pith/3RIVVELYEVWVGT7ZVXHM3JHY6I/action/author_attestation","sign_citation":"https://pith.science/pith/3RIVVELYEVWVGT7ZVXHM3JHY6I/action/citation_signature","submit_replication":"https://pith.science/pith/3RIVVELYEVWVGT7ZVXHM3JHY6I/action/replication_record"}},"created_at":"2026-05-18T02:30:17.168394+00:00","updated_at":"2026-05-18T02:30:17.168394+00:00"}