{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XXJFISHLOM3S4VFTVCF3473D5P","short_pith_number":"pith:XXJFISHL","canonical_record":{"source":{"id":"2409.05227","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-08T21:45:12Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"561a58693f46027447247209dddb9213c8459e246c0003d215798d03b1a4d53a","abstract_canon_sha256":"9687efdbfa4b42ed963a151734d10d47593a44142d32ebe59b9e919f2df7e218"},"schema_version":"1.0"},"canonical_sha256":"bdd25448eb73372e54b3a88bbe7f63ebc5b8a8c374cfa4bede6ff38706edde8e","source":{"kind":"arxiv","id":"2409.05227","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.05227","created_at":"2026-07-05T09:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"2409.05227v1","created_at":"2026-07-05T09:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.05227","created_at":"2026-07-05T09:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"XXJFISHLOM3S","created_at":"2026-07-05T09:04:46Z"},{"alias_kind":"pith_short_16","alias_value":"XXJFISHLOM3S4VFT","created_at":"2026-07-05T09:04:46Z"},{"alias_kind":"pith_short_8","alias_value":"XXJFISHL","created_at":"2026-07-05T09:04:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XXJFISHLOM3S4VFTVCF3473D5P","target":"record","payload":{"canonical_record":{"source":{"id":"2409.05227","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-08T21:45:12Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"561a58693f46027447247209dddb9213c8459e246c0003d215798d03b1a4d53a","abstract_canon_sha256":"9687efdbfa4b42ed963a151734d10d47593a44142d32ebe59b9e919f2df7e218"},"schema_version":"1.0"},"canonical_sha256":"bdd25448eb73372e54b3a88bbe7f63ebc5b8a8c374cfa4bede6ff38706edde8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:46.167728Z","signature_b64":"6apkPwiLN/McvZoQBpPF/Z45aaHSU/0WeNaRwAXty/3GVAdyG+DYve8pv6687WOqSzcWU4STqFCHsvlJRh6eCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdd25448eb73372e54b3a88bbe7f63ebc5b8a8c374cfa4bede6ff38706edde8e","last_reissued_at":"2026-07-05T09:04:46.167322Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:46.167322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.05227","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pw5oQSWSNjCzhAZ/pSUdkcyWa6KWL4iNHhx0qy+S5wLgmLl/3somuG5ONJ7sQPMFVTd9w05R+GkRAnGAdyEeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T17:21:10.942639Z"},"content_sha256":"936cddc77d63d380d355ebb4616c02f4f73706b44904019cf897847efe695703","schema_version":"1.0","event_id":"sha256:936cddc77d63d380d355ebb4616c02f4f73706b44904019cf897847efe695703"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XXJFISHLOM3S4VFTVCF3473D5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BBS: Bi-directional Bit-level Sparsity for Deep Learning Acceleration","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Jae-sun Seo, Jian Meng, Mohamed S. Abdelfattah, Yuzong Chen","submitted_at":"2024-09-08T21:45:12Z","abstract_excerpt":"Bit-level sparsity methods skip ineffectual zero-bit operations and are typically applicable within bit-serial deep learning accelerators. This type of sparsity at the bit-level is especially interesting because it is both orthogonal and compatible with other deep neural network (DNN) efficiency methods such as quantization and pruning. In this work, we improve the practicality and efficiency of bitlevel sparsity through a novel algorithmic bit-pruning, averaging, and compression method, and a co-designed efficient bit-serial hardware accelerator. On the algorithmic side, we introduce bidirect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.05227","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.05227/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:04:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZh0/zd11qgwn/0lfzVdDI164ZJoAPOcxRKpRun4rSUKDZ+wPBs7SOCWnXqy+lXEmQm6BYs/RLiTKEki/rqWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T17:21:10.943138Z"},"content_sha256":"18bacd0c82e9ab566014aa117ad07e94c4cb7aa64e9d971bbda4415102eeb7a5","schema_version":"1.0","event_id":"sha256:18bacd0c82e9ab566014aa117ad07e94c4cb7aa64e9d971bbda4415102eeb7a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XXJFISHLOM3S4VFTVCF3473D5P/bundle.json","state_url":"https://pith.science/pith/XXJFISHLOM3S4VFTVCF3473D5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XXJFISHLOM3S4VFTVCF3473D5P/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-19T17:21:10Z","links":{"resolver":"https://pith.science/pith/XXJFISHLOM3S4VFTVCF3473D5P","bundle":"https://pith.science/pith/XXJFISHLOM3S4VFTVCF3473D5P/bundle.json","state":"https://pith.science/pith/XXJFISHLOM3S4VFTVCF3473D5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XXJFISHLOM3S4VFTVCF3473D5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XXJFISHLOM3S4VFTVCF3473D5P","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":"9687efdbfa4b42ed963a151734d10d47593a44142d32ebe59b9e919f2df7e218","cross_cats_sorted":["cs.AR"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-08T21:45:12Z","title_canon_sha256":"561a58693f46027447247209dddb9213c8459e246c0003d215798d03b1a4d53a"},"schema_version":"1.0","source":{"id":"2409.05227","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.05227","created_at":"2026-07-05T09:04:46Z"},{"alias_kind":"arxiv_version","alias_value":"2409.05227v1","created_at":"2026-07-05T09:04:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.05227","created_at":"2026-07-05T09:04:46Z"},{"alias_kind":"pith_short_12","alias_value":"XXJFISHLOM3S","created_at":"2026-07-05T09:04:46Z"},{"alias_kind":"pith_short_16","alias_value":"XXJFISHLOM3S4VFT","created_at":"2026-07-05T09:04:46Z"},{"alias_kind":"pith_short_8","alias_value":"XXJFISHL","created_at":"2026-07-05T09:04:46Z"}],"graph_snapshots":[{"event_id":"sha256:18bacd0c82e9ab566014aa117ad07e94c4cb7aa64e9d971bbda4415102eeb7a5","target":"graph","created_at":"2026-07-05T09:04:46Z","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/2409.05227/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bit-level sparsity methods skip ineffectual zero-bit operations and are typically applicable within bit-serial deep learning accelerators. This type of sparsity at the bit-level is especially interesting because it is both orthogonal and compatible with other deep neural network (DNN) efficiency methods such as quantization and pruning. In this work, we improve the practicality and efficiency of bitlevel sparsity through a novel algorithmic bit-pruning, averaging, and compression method, and a co-designed efficient bit-serial hardware accelerator. On the algorithmic side, we introduce bidirect","authors_text":"Jae-sun Seo, Jian Meng, Mohamed S. Abdelfattah, Yuzong Chen","cross_cats":["cs.AR"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-08T21:45:12Z","title":"BBS: Bi-directional Bit-level Sparsity for Deep Learning Acceleration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.05227","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:936cddc77d63d380d355ebb4616c02f4f73706b44904019cf897847efe695703","target":"record","created_at":"2026-07-05T09:04:46Z","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":"9687efdbfa4b42ed963a151734d10d47593a44142d32ebe59b9e919f2df7e218","cross_cats_sorted":["cs.AR"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-09-08T21:45:12Z","title_canon_sha256":"561a58693f46027447247209dddb9213c8459e246c0003d215798d03b1a4d53a"},"schema_version":"1.0","source":{"id":"2409.05227","kind":"arxiv","version":1}},"canonical_sha256":"bdd25448eb73372e54b3a88bbe7f63ebc5b8a8c374cfa4bede6ff38706edde8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdd25448eb73372e54b3a88bbe7f63ebc5b8a8c374cfa4bede6ff38706edde8e","first_computed_at":"2026-07-05T09:04:46.167322Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:04:46.167322Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6apkPwiLN/McvZoQBpPF/Z45aaHSU/0WeNaRwAXty/3GVAdyG+DYve8pv6687WOqSzcWU4STqFCHsvlJRh6eCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:04:46.167728Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.05227","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:936cddc77d63d380d355ebb4616c02f4f73706b44904019cf897847efe695703","sha256:18bacd0c82e9ab566014aa117ad07e94c4cb7aa64e9d971bbda4415102eeb7a5"],"state_sha256":"e578e9101f826e715f59ffd45f97b9ad9a6755c67c0907a52b0b08e353dd6bd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i0Jh4CyQg6DwWHvO5jgMoQ+rKyeJfzThSo0AW0ZyUL05q5lbdpQ2Sl/0nUiTIyl8Cf09MWoVI5WcAt5ytiTTDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T17:21:10.947971Z","bundle_sha256":"c89b5aaca91ff8a4dfd73d1998b49efd9c250058f746f8c8ea982d18ac34ec2f"}}