{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MB5LX6Z6I2H6KYWUQDXQDHM6S4","short_pith_number":"pith:MB5LX6Z6","schema_version":"1.0","canonical_sha256":"607abbfb3e468fe562d480ef019d9e970c96aafedec8b6238af4f7d4aa7416b3","source":{"kind":"arxiv","id":"1910.12625","version":2},"attestation_state":"computed","paper":{"title":"LUTNet: Learning FPGA Configurations for Highly Efficient Neural Network Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","eess.SP","stat.ML"],"primary_cat":"cs.LG","authors_text":"Erwei Wang, George A. Constantinides, James J. Davis, Peter Y. K. Cheung","submitted_at":"2019-10-24T00:04:56Z","abstract_excerpt":"Research has shown that deep neural networks contain significant redundancy, and thus that high classification accuracy can be achieved even when weights and activations are quantized down to binary values. Network binarization on FPGAs greatly increases area efficiency by replacing resource-hungry multipliers with lightweight XNOR gates. However, an FPGA's fundamental building block, the K-LUT, is capable of implementing far more than an XNOR: it can perform any K-input Boolean operation. Inspired by this observation, we propose LUTNet, an end-to-end hardware-software framework for the constr"},"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":"1910.12625","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-24T00:04:56Z","cross_cats_sorted":["cs.CV","eess.SP","stat.ML"],"title_canon_sha256":"55713a78272b020467d1781015f0c0bd5a5f5f7ecda839c2685c75cfa96d6c36","abstract_canon_sha256":"291fda529ad4f1b2ea100b7dc90baa4f051722314e575174190e91fcd2923c5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:45:12.743225Z","signature_b64":"rL67M7pK/MC1BI24rSEzrcZbBc6vZ16N4JOgKo0XUfFroUdZalratcLPhsPt6cZRgYihP4kGCnPVWeOo98axCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"607abbfb3e468fe562d480ef019d9e970c96aafedec8b6238af4f7d4aa7416b3","last_reissued_at":"2026-07-05T00:45:12.742859Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:45:12.742859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LUTNet: Learning FPGA Configurations for Highly Efficient Neural Network Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","eess.SP","stat.ML"],"primary_cat":"cs.LG","authors_text":"Erwei Wang, George A. Constantinides, James J. Davis, Peter Y. K. Cheung","submitted_at":"2019-10-24T00:04:56Z","abstract_excerpt":"Research has shown that deep neural networks contain significant redundancy, and thus that high classification accuracy can be achieved even when weights and activations are quantized down to binary values. Network binarization on FPGAs greatly increases area efficiency by replacing resource-hungry multipliers with lightweight XNOR gates. However, an FPGA's fundamental building block, the K-LUT, is capable of implementing far more than an XNOR: it can perform any K-input Boolean operation. Inspired by this observation, we propose LUTNet, an end-to-end hardware-software framework for the constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.12625","kind":"arxiv","version":2},"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/1910.12625/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":"1910.12625","created_at":"2026-07-05T00:45:12.742929+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.12625v2","created_at":"2026-07-05T00:45:12.742929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.12625","created_at":"2026-07-05T00:45:12.742929+00:00"},{"alias_kind":"pith_short_12","alias_value":"MB5LX6Z6I2H6","created_at":"2026-07-05T00:45:12.742929+00:00"},{"alias_kind":"pith_short_16","alias_value":"MB5LX6Z6I2H6KYWU","created_at":"2026-07-05T00:45:12.742929+00:00"},{"alias_kind":"pith_short_8","alias_value":"MB5LX6Z6","created_at":"2026-07-05T00:45:12.742929+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.09399","citing_title":"Fully Trainable Deep Differentiable Logic Gate Networks and Lookup Table Networks","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MB5LX6Z6I2H6KYWUQDXQDHM6S4","json":"https://pith.science/pith/MB5LX6Z6I2H6KYWUQDXQDHM6S4.json","graph_json":"https://pith.science/api/pith-number/MB5LX6Z6I2H6KYWUQDXQDHM6S4/graph.json","events_json":"https://pith.science/api/pith-number/MB5LX6Z6I2H6KYWUQDXQDHM6S4/events.json","paper":"https://pith.science/paper/MB5LX6Z6"},"agent_actions":{"view_html":"https://pith.science/pith/MB5LX6Z6I2H6KYWUQDXQDHM6S4","download_json":"https://pith.science/pith/MB5LX6Z6I2H6KYWUQDXQDHM6S4.json","view_paper":"https://pith.science/paper/MB5LX6Z6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.12625&json=true","fetch_graph":"https://pith.science/api/pith-number/MB5LX6Z6I2H6KYWUQDXQDHM6S4/graph.json","fetch_events":"https://pith.science/api/pith-number/MB5LX6Z6I2H6KYWUQDXQDHM6S4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MB5LX6Z6I2H6KYWUQDXQDHM6S4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MB5LX6Z6I2H6KYWUQDXQDHM6S4/action/storage_attestation","attest_author":"https://pith.science/pith/MB5LX6Z6I2H6KYWUQDXQDHM6S4/action/author_attestation","sign_citation":"https://pith.science/pith/MB5LX6Z6I2H6KYWUQDXQDHM6S4/action/citation_signature","submit_replication":"https://pith.science/pith/MB5LX6Z6I2H6KYWUQDXQDHM6S4/action/replication_record"}},"created_at":"2026-07-05T00:45:12.742929+00:00","updated_at":"2026-07-05T00:45:12.742929+00:00"}