{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:O3OGAJBIIIIFCXG4G2WCD27E6P","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c530c3c3ee19cd34f5e0d5dee334165e17ec0bcd5671ee04eaf8c8e61e33554c","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2025-01-18T05:27:25Z","title_canon_sha256":"319ae51f51ae59eac4a20f024ad454e9b378325ebaef63f936c8f676b6d13fa3"},"schema_version":"1.0","source":{"id":"2501.10658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.10658","created_at":"2026-07-05T10:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"2501.10658v1","created_at":"2026-07-05T10:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.10658","created_at":"2026-07-05T10:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"O3OGAJBIIIIF","created_at":"2026-07-05T10:02:31Z"},{"alias_kind":"pith_short_16","alias_value":"O3OGAJBIIIIFCXG4","created_at":"2026-07-05T10:02:31Z"},{"alias_kind":"pith_short_8","alias_value":"O3OGAJBI","created_at":"2026-07-05T10:02:31Z"}],"graph_snapshots":[{"event_id":"sha256:982b954232de8820a59fffa3e5f63ab6888e32d889970128ab50414f0a482dc6","target":"graph","created_at":"2026-07-05T10:02:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.10658/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The emergence of neural network capabilities invariably leads to a significant surge in computational demands due to expanding model sizes and increased computational complexity. To reduce model size and lower inference costs, recent research has focused on simplifying models and designing hardware accelerators using low-bit quantization. However, due to numerical representation limits, scalar quantization cannot reduce bit width lower than 1-bit, diminishing its benefits. To break through these limitations, we introduce LUT-DLA, a Look-Up Table (LUT) Deep Learning Accelerator Framework that u","authors_text":"2), (2) Microsoft Research, (3) NTU Singapore), Cheng Liu (1), Chunyun Chen (3), Fan Yang (2), Guoyu Li (1, Mao Yang (2) ((1) University of Chinese Academy of Sciences, Mohamed M. Sabry (3), Shengyu Ye (2), Ting Cao (2), Yang Wang (2)","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2025-01-18T05:27:25Z","title":"LUT-DLA: Lookup Table as Efficient Extreme Low-Bit Deep Learning Accelerator"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.10658","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2a6a8aa49c086667f1362e4a6fa7cbf1da574bbb59b4d04cc37dc7e8641fa9cd","target":"record","created_at":"2026-07-05T10:02:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c530c3c3ee19cd34f5e0d5dee334165e17ec0bcd5671ee04eaf8c8e61e33554c","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2025-01-18T05:27:25Z","title_canon_sha256":"319ae51f51ae59eac4a20f024ad454e9b378325ebaef63f936c8f676b6d13fa3"},"schema_version":"1.0","source":{"id":"2501.10658","kind":"arxiv","version":1}},"canonical_sha256":"76dc6024284210515cdc36ac21ebe4f3df586a9a8c702bc70607fd331e85c240","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76dc6024284210515cdc36ac21ebe4f3df586a9a8c702bc70607fd331e85c240","first_computed_at":"2026-07-05T10:02:31.543238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:02:31.543238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xLuitWPmKYDOfjFYX0gu5zOKSNUX8MQhZ0IhuZwf2O0GzWPXN1YMCbd7auQ05HpnAtsY1uO/Xi2cKXblhu77Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:02:31.543793Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.10658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a6a8aa49c086667f1362e4a6fa7cbf1da574bbb59b4d04cc37dc7e8641fa9cd","sha256:982b954232de8820a59fffa3e5f63ab6888e32d889970128ab50414f0a482dc6"],"state_sha256":"53a9ae2972820afafdbe06d9ae3991bc622abceabf067cac2ccaa76d8598be90"}