{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:G3CEEIDYLL4TO744YIHQS2YJRA","short_pith_number":"pith:G3CEEIDY","schema_version":"1.0","canonical_sha256":"36c44220785af9377f9cc20f096b09881327903b0c1b3606df30bf8665460cb2","source":{"kind":"arxiv","id":"2212.05344","version":4},"attestation_state":"computed","paper":{"title":"DeFiNES: Enabling Fast Exploration of the Depth-first Scheduling Space for DNN Accelerators through Analytical Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AR","authors_text":"Arne Symons, Koen Goetschalckx, Linyan Mei, Marian Verhelst","submitted_at":"2022-12-10T18:09:23Z","abstract_excerpt":"DNN workloads can be scheduled onto DNN accelerators in many different ways: from layer-by-layer scheduling to cross-layer depth-first scheduling (a.k.a. layer fusion, or cascaded execution). This results in a very broad scheduling space, with each schedule leading to varying hardware (HW) costs in terms of energy and latency. To rapidly explore this vast space for a wide variety of hardware architectures, analytical cost models are crucial to estimate scheduling effects on the HW level. However, state-of-the-art cost models are lacking support for exploring the complete depth-first scheduling"},"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":"2212.05344","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2022-12-10T18:09:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0e50c2d7e13df16096f3fb2f87cb5c8b61438c70b35bebf3f71f2b747d82d2df","abstract_canon_sha256":"21f27752b509118644d324d18e00c2e291111808434c2969b772743218b9b85f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:31:38.712932Z","signature_b64":"NxCnOlKwRj8NQRCRluCBy0STCA6y2FoEZAlbOBfotErGk9rs4d4mW5Rc2cDV1NWmhZQDe4Rqzf7rmuaPIVhXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36c44220785af9377f9cc20f096b09881327903b0c1b3606df30bf8665460cb2","last_reissued_at":"2026-07-05T08:31:38.712512Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:31:38.712512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DeFiNES: Enabling Fast Exploration of the Depth-first Scheduling Space for DNN Accelerators through Analytical Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AR","authors_text":"Arne Symons, Koen Goetschalckx, Linyan Mei, Marian Verhelst","submitted_at":"2022-12-10T18:09:23Z","abstract_excerpt":"DNN workloads can be scheduled onto DNN accelerators in many different ways: from layer-by-layer scheduling to cross-layer depth-first scheduling (a.k.a. layer fusion, or cascaded execution). This results in a very broad scheduling space, with each schedule leading to varying hardware (HW) costs in terms of energy and latency. To rapidly explore this vast space for a wide variety of hardware architectures, analytical cost models are crucial to estimate scheduling effects on the HW level. However, state-of-the-art cost models are lacking support for exploring the complete depth-first scheduling"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.05344","kind":"arxiv","version":4},"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/2212.05344/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":"2212.05344","created_at":"2026-07-05T08:31:38.712573+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.05344v4","created_at":"2026-07-05T08:31:38.712573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.05344","created_at":"2026-07-05T08:31:38.712573+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3CEEIDYLL4T","created_at":"2026-07-05T08:31:38.712573+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3CEEIDYLL4TO744","created_at":"2026-07-05T08:31:38.712573+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3CEEIDY","created_at":"2026-07-05T08:31:38.712573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.13736","citing_title":"An End-to-End DNN Inference Framework for the SpiNNaker2 Neuromorphic MPSoC","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G3CEEIDYLL4TO744YIHQS2YJRA","json":"https://pith.science/pith/G3CEEIDYLL4TO744YIHQS2YJRA.json","graph_json":"https://pith.science/api/pith-number/G3CEEIDYLL4TO744YIHQS2YJRA/graph.json","events_json":"https://pith.science/api/pith-number/G3CEEIDYLL4TO744YIHQS2YJRA/events.json","paper":"https://pith.science/paper/G3CEEIDY"},"agent_actions":{"view_html":"https://pith.science/pith/G3CEEIDYLL4TO744YIHQS2YJRA","download_json":"https://pith.science/pith/G3CEEIDYLL4TO744YIHQS2YJRA.json","view_paper":"https://pith.science/paper/G3CEEIDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.05344&json=true","fetch_graph":"https://pith.science/api/pith-number/G3CEEIDYLL4TO744YIHQS2YJRA/graph.json","fetch_events":"https://pith.science/api/pith-number/G3CEEIDYLL4TO744YIHQS2YJRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3CEEIDYLL4TO744YIHQS2YJRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3CEEIDYLL4TO744YIHQS2YJRA/action/storage_attestation","attest_author":"https://pith.science/pith/G3CEEIDYLL4TO744YIHQS2YJRA/action/author_attestation","sign_citation":"https://pith.science/pith/G3CEEIDYLL4TO744YIHQS2YJRA/action/citation_signature","submit_replication":"https://pith.science/pith/G3CEEIDYLL4TO744YIHQS2YJRA/action/replication_record"}},"created_at":"2026-07-05T08:31:38.712573+00:00","updated_at":"2026-07-05T08:31:38.712573+00:00"}