{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:655VICBULUBFMV5DPTVGSFWTXS","short_pith_number":"pith:655VICBU","schema_version":"1.0","canonical_sha256":"f77b5408345d025657a37cea6916d3bcaec9d79245905214195f3c8a29827b72","source":{"kind":"arxiv","id":"2007.11360","version":3},"attestation_state":"computed","paper":{"title":"ZigZag: A Memory-Centric Rapid DNN Accelerator Design Space Exploration Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Linyan Mei, Marian Verhelst, Pouya Houshmand, Sebastian Giraldo, Vikram Jain","submitted_at":"2020-07-22T12:17:48Z","abstract_excerpt":"Building efficient embedded deep learning systems requires a tight co-design between DNN algorithms, memory hierarchy, and dataflow. However, owing to the large degrees of freedom in the design space, finding an optimal solution through the implementation of individual design points becomes infeasible. Recently, several estimation frameworks for fast design space exploration (DSE) have emerged, yet they either suffer from long runtimes or a limited exploration space. This work introduces ZigZag, a memory-centric rapid DNN accelerator DSE framework which extends the DSE with uneven mapping oppo"},"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":"2007.11360","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-07-22T12:17:48Z","cross_cats_sorted":[],"title_canon_sha256":"267152da78c695eb2bb997925495ee4ee1dec4cea459ff428a4403703dc5ebf7","abstract_canon_sha256":"f201ab6b158ac09c7a69cfd07bddc5281fcbed66fcbabe3d6f7cf62ecf97e41e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:26:22.197029Z","signature_b64":"mX4AAJBj+AK+N9ugYO8WQWYR5vsMLqOAfsUe0pFYc6xHy2tW0JXfz3sDoBeu8eFMhxl552kecA2HZNpp00BKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f77b5408345d025657a37cea6916d3bcaec9d79245905214195f3c8a29827b72","last_reissued_at":"2026-07-05T01:26:22.196472Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:26:22.196472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ZigZag: A Memory-Centric Rapid DNN Accelerator Design Space Exploration Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Linyan Mei, Marian Verhelst, Pouya Houshmand, Sebastian Giraldo, Vikram Jain","submitted_at":"2020-07-22T12:17:48Z","abstract_excerpt":"Building efficient embedded deep learning systems requires a tight co-design between DNN algorithms, memory hierarchy, and dataflow. However, owing to the large degrees of freedom in the design space, finding an optimal solution through the implementation of individual design points becomes infeasible. Recently, several estimation frameworks for fast design space exploration (DSE) have emerged, yet they either suffer from long runtimes or a limited exploration space. This work introduces ZigZag, a memory-centric rapid DNN accelerator DSE framework which extends the DSE with uneven mapping oppo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.11360","kind":"arxiv","version":3},"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/2007.11360/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":"2007.11360","created_at":"2026-07-05T01:26:22.196532+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.11360v3","created_at":"2026-07-05T01:26:22.196532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.11360","created_at":"2026-07-05T01:26:22.196532+00:00"},{"alias_kind":"pith_short_12","alias_value":"655VICBULUBF","created_at":"2026-07-05T01:26:22.196532+00:00"},{"alias_kind":"pith_short_16","alias_value":"655VICBULUBFMV5D","created_at":"2026-07-05T01:26:22.196532+00:00"},{"alias_kind":"pith_short_8","alias_value":"655VICBU","created_at":"2026-07-05T01:26:22.196532+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.12090","citing_title":"Evaluating Cross-Architecture Performance Modeling of Distributed ML Workloads Using StableHLO","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/655VICBULUBFMV5DPTVGSFWTXS","json":"https://pith.science/pith/655VICBULUBFMV5DPTVGSFWTXS.json","graph_json":"https://pith.science/api/pith-number/655VICBULUBFMV5DPTVGSFWTXS/graph.json","events_json":"https://pith.science/api/pith-number/655VICBULUBFMV5DPTVGSFWTXS/events.json","paper":"https://pith.science/paper/655VICBU"},"agent_actions":{"view_html":"https://pith.science/pith/655VICBULUBFMV5DPTVGSFWTXS","download_json":"https://pith.science/pith/655VICBULUBFMV5DPTVGSFWTXS.json","view_paper":"https://pith.science/paper/655VICBU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.11360&json=true","fetch_graph":"https://pith.science/api/pith-number/655VICBULUBFMV5DPTVGSFWTXS/graph.json","fetch_events":"https://pith.science/api/pith-number/655VICBULUBFMV5DPTVGSFWTXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/655VICBULUBFMV5DPTVGSFWTXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/655VICBULUBFMV5DPTVGSFWTXS/action/storage_attestation","attest_author":"https://pith.science/pith/655VICBULUBFMV5DPTVGSFWTXS/action/author_attestation","sign_citation":"https://pith.science/pith/655VICBULUBFMV5DPTVGSFWTXS/action/citation_signature","submit_replication":"https://pith.science/pith/655VICBULUBFMV5DPTVGSFWTXS/action/replication_record"}},"created_at":"2026-07-05T01:26:22.196532+00:00","updated_at":"2026-07-05T01:26:22.196532+00:00"}