{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RFAK43XYP4XEIJEAFMZCRSNUQJ","short_pith_number":"pith:RFAK43XY","schema_version":"1.0","canonical_sha256":"8940ae6ef87f2e4424802b3228c9b4824621ce957be8f8edd144d4d0748a10cb","source":{"kind":"arxiv","id":"1911.07967","version":3},"attestation_state":"computed","paper":{"title":"DLBricks: Composable Benchmark Generation to Reduce Deep Learning Benchmarking Effort on CPUs (Extended)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PF","cs.SE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abdul Dakkak, Cheng Li, Jinjun Xiong, Wen-Mei Hwu","submitted_at":"2019-11-18T21:42:36Z","abstract_excerpt":"The past few years have seen a surge of applying Deep Learning (DL) models for a wide array of tasks such as image classification, object detection, machine translation, etc. While DL models provide an opportunity to solve otherwise intractable tasks, their adoption relies on them being optimized to meet latency and resource requirements. Benchmarking is a key step in this process but has been hampered in part due to the lack of representative and up-to-date benchmarking suites. This is exacerbated by the fast-evolving pace of DL models.\n  This paper proposes DLBricks, a composable benchmark g"},"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":"1911.07967","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-11-18T21:42:36Z","cross_cats_sorted":["cs.PF","cs.SE","stat.ML"],"title_canon_sha256":"979bb8af238db894a666870e42ef566aaebf87b1333c51160ffbd1f8a721224f","abstract_canon_sha256":"9c9c1b55c71b1de9064fd3fa8b922ee87ac9a6ca3cff21a13a7cb238611ab19c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:18:49.723767Z","signature_b64":"v9fZXqSxi2DcZUJkxKDE4pSHlkLzuZODz5zRKF59wuC1fij31JPIQCTuBjsRCile1nafsseLvI2cYQlRDXASAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8940ae6ef87f2e4424802b3228c9b4824621ce957be8f8edd144d4d0748a10cb","last_reissued_at":"2026-07-05T02:18:49.723220Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:18:49.723220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DLBricks: Composable Benchmark Generation to Reduce Deep Learning Benchmarking Effort on CPUs (Extended)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PF","cs.SE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abdul Dakkak, Cheng Li, Jinjun Xiong, Wen-Mei Hwu","submitted_at":"2019-11-18T21:42:36Z","abstract_excerpt":"The past few years have seen a surge of applying Deep Learning (DL) models for a wide array of tasks such as image classification, object detection, machine translation, etc. While DL models provide an opportunity to solve otherwise intractable tasks, their adoption relies on them being optimized to meet latency and resource requirements. Benchmarking is a key step in this process but has been hampered in part due to the lack of representative and up-to-date benchmarking suites. This is exacerbated by the fast-evolving pace of DL models.\n  This paper proposes DLBricks, a composable benchmark g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.07967","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/1911.07967/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":"1911.07967","created_at":"2026-07-05T02:18:49.723322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.07967v3","created_at":"2026-07-05T02:18:49.723322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.07967","created_at":"2026-07-05T02:18:49.723322+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFAK43XYP4XE","created_at":"2026-07-05T02:18:49.723322+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFAK43XYP4XEIJEA","created_at":"2026-07-05T02:18:49.723322+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFAK43XY","created_at":"2026-07-05T02:18:49.723322+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RFAK43XYP4XEIJEAFMZCRSNUQJ","json":"https://pith.science/pith/RFAK43XYP4XEIJEAFMZCRSNUQJ.json","graph_json":"https://pith.science/api/pith-number/RFAK43XYP4XEIJEAFMZCRSNUQJ/graph.json","events_json":"https://pith.science/api/pith-number/RFAK43XYP4XEIJEAFMZCRSNUQJ/events.json","paper":"https://pith.science/paper/RFAK43XY"},"agent_actions":{"view_html":"https://pith.science/pith/RFAK43XYP4XEIJEAFMZCRSNUQJ","download_json":"https://pith.science/pith/RFAK43XYP4XEIJEAFMZCRSNUQJ.json","view_paper":"https://pith.science/paper/RFAK43XY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.07967&json=true","fetch_graph":"https://pith.science/api/pith-number/RFAK43XYP4XEIJEAFMZCRSNUQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RFAK43XYP4XEIJEAFMZCRSNUQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFAK43XYP4XEIJEAFMZCRSNUQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFAK43XYP4XEIJEAFMZCRSNUQJ/action/storage_attestation","attest_author":"https://pith.science/pith/RFAK43XYP4XEIJEAFMZCRSNUQJ/action/author_attestation","sign_citation":"https://pith.science/pith/RFAK43XYP4XEIJEAFMZCRSNUQJ/action/citation_signature","submit_replication":"https://pith.science/pith/RFAK43XYP4XEIJEAFMZCRSNUQJ/action/replication_record"}},"created_at":"2026-07-05T02:18:49.723322+00:00","updated_at":"2026-07-05T02:18:49.723322+00:00"}