{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZXY3MV7EGW2S6FTRWZ2FTYL6XM","short_pith_number":"pith:ZXY3MV7E","schema_version":"1.0","canonical_sha256":"cdf1b657e435b52f1671b67459e17ebb38e3747f71ee3d288b123b12631e9740","source":{"kind":"arxiv","id":"2406.03088","version":1},"attestation_state":"computed","paper":{"title":"HASS: Hardware-Aware Sparsity Search for Dataflow DNN Accelerator","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AR","authors_text":"Alexander Montgomerie-Corcoran, Cheng Zhang, Christos-Savvas Bouganis, Jianyi Cheng, Junyi Wu, Krish Agrawal, Sudarshan Sreeram, Yiren Zhao, Zhewen Yu","submitted_at":"2024-06-05T09:25:18Z","abstract_excerpt":"Deep Neural Networks (DNNs) excel in learning hierarchical representations from raw data, such as images, audio, and text. To compute these DNN models with high performance and energy efficiency, these models are usually deployed onto customized hardware accelerators. Among various accelerator designs, dataflow architecture has shown promising performance due to its layer-pipelined structure and its scalability in data parallelism.\n  Exploiting weights and activations sparsity can further enhance memory storage and computation efficiency. However, existing approaches focus on exploiting sparsi"},"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":"2406.03088","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2024-06-05T09:25:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7e9ad4b073d1ac7467e4c8df20d27b7da399e907e62b23b9246a2565ed1c525c","abstract_canon_sha256":"8e299dc88ee79459a68b3f1e2a2508b9dde761b3e4ba238a0c1362f8fca040bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:51.232080Z","signature_b64":"/Cv1kIMMUNG4Pzg6BA0+0oQFhNkE05OriP6QHAwKWdj2dumsI8PKufjCJCn2hEjc4ruGev7ByuUhLcPH8fh7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdf1b657e435b52f1671b67459e17ebb38e3747f71ee3d288b123b12631e9740","last_reissued_at":"2026-07-05T08:27:51.231698Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:51.231698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HASS: Hardware-Aware Sparsity Search for Dataflow DNN Accelerator","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AR","authors_text":"Alexander Montgomerie-Corcoran, Cheng Zhang, Christos-Savvas Bouganis, Jianyi Cheng, Junyi Wu, Krish Agrawal, Sudarshan Sreeram, Yiren Zhao, Zhewen Yu","submitted_at":"2024-06-05T09:25:18Z","abstract_excerpt":"Deep Neural Networks (DNNs) excel in learning hierarchical representations from raw data, such as images, audio, and text. To compute these DNN models with high performance and energy efficiency, these models are usually deployed onto customized hardware accelerators. Among various accelerator designs, dataflow architecture has shown promising performance due to its layer-pipelined structure and its scalability in data parallelism.\n  Exploiting weights and activations sparsity can further enhance memory storage and computation efficiency. However, existing approaches focus on exploiting sparsi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.03088","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/2406.03088/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":"2406.03088","created_at":"2026-07-05T08:27:51.231755+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.03088v1","created_at":"2026-07-05T08:27:51.231755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.03088","created_at":"2026-07-05T08:27:51.231755+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZXY3MV7EGW2S","created_at":"2026-07-05T08:27:51.231755+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZXY3MV7EGW2S6FTR","created_at":"2026-07-05T08:27:51.231755+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZXY3MV7E","created_at":"2026-07-05T08:27:51.231755+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.08981","citing_title":"ITERA-LLM: Boosting Sub-8-Bit Large Language Model Inference via Iterative Tensor Decomposition","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZXY3MV7EGW2S6FTRWZ2FTYL6XM","json":"https://pith.science/pith/ZXY3MV7EGW2S6FTRWZ2FTYL6XM.json","graph_json":"https://pith.science/api/pith-number/ZXY3MV7EGW2S6FTRWZ2FTYL6XM/graph.json","events_json":"https://pith.science/api/pith-number/ZXY3MV7EGW2S6FTRWZ2FTYL6XM/events.json","paper":"https://pith.science/paper/ZXY3MV7E"},"agent_actions":{"view_html":"https://pith.science/pith/ZXY3MV7EGW2S6FTRWZ2FTYL6XM","download_json":"https://pith.science/pith/ZXY3MV7EGW2S6FTRWZ2FTYL6XM.json","view_paper":"https://pith.science/paper/ZXY3MV7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.03088&json=true","fetch_graph":"https://pith.science/api/pith-number/ZXY3MV7EGW2S6FTRWZ2FTYL6XM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZXY3MV7EGW2S6FTRWZ2FTYL6XM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZXY3MV7EGW2S6FTRWZ2FTYL6XM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZXY3MV7EGW2S6FTRWZ2FTYL6XM/action/storage_attestation","attest_author":"https://pith.science/pith/ZXY3MV7EGW2S6FTRWZ2FTYL6XM/action/author_attestation","sign_citation":"https://pith.science/pith/ZXY3MV7EGW2S6FTRWZ2FTYL6XM/action/citation_signature","submit_replication":"https://pith.science/pith/ZXY3MV7EGW2S6FTRWZ2FTYL6XM/action/replication_record"}},"created_at":"2026-07-05T08:27:51.231755+00:00","updated_at":"2026-07-05T08:27:51.231755+00:00"}