{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4U4YTELATC5LODZPXSQIL7WN3D","short_pith_number":"pith:4U4YTELA","schema_version":"1.0","canonical_sha256":"e53989916098bab70f2fbca085fecdd8ebe365736f0840c54acb1e3f0be61815","source":{"kind":"arxiv","id":"2302.03851","version":1},"attestation_state":"computed","paper":{"title":"ED-Batch: Efficient Automatic Batching of Dynamic Neural Networks via Learned Finite State Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LG","authors_text":"Phillip B. Gibbons, Pratik Fegade, Siyuan Chen, Tianqi Chen, Todd C. Mowry","submitted_at":"2023-02-08T02:56:36Z","abstract_excerpt":"Batching has a fundamental influence on the efficiency of deep neural network (DNN) execution. However, for dynamic DNNs, efficient batching is particularly challenging as the dataflow graph varies per input instance. As a result, state-of-the-art frameworks use heuristics that result in suboptimal batching decisions. Further, batching puts strict restrictions on memory adjacency and can lead to high data movement costs. In this paper, we provide an approach for batching dynamic DNNs based on finite state machines, which enables the automatic discovery of batching policies specialized for each"},"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":"2302.03851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-08T02:56:36Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"fd54610d1d9a10ea20dd92776a6eccabae1f904077383be6f8a9e9f4e718fe34","abstract_canon_sha256":"d1af7eba6b553590789316b07c3386991c3a8615ede223a6fa30d4067d20549f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:39:58.420691Z","signature_b64":"IWMqXod8ktJAM5eLT1k7Qy/eMehxhzh9VFDQdgKM3I3Gz7kCgcXvW0EQaBFl4zDVz2/dIJoTckHllYc16d6ACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e53989916098bab70f2fbca085fecdd8ebe365736f0840c54acb1e3f0be61815","last_reissued_at":"2026-07-05T05:39:58.420168Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:39:58.420168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ED-Batch: Efficient Automatic Batching of Dynamic Neural Networks via Learned Finite State Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LG","authors_text":"Phillip B. Gibbons, Pratik Fegade, Siyuan Chen, Tianqi Chen, Todd C. Mowry","submitted_at":"2023-02-08T02:56:36Z","abstract_excerpt":"Batching has a fundamental influence on the efficiency of deep neural network (DNN) execution. However, for dynamic DNNs, efficient batching is particularly challenging as the dataflow graph varies per input instance. As a result, state-of-the-art frameworks use heuristics that result in suboptimal batching decisions. Further, batching puts strict restrictions on memory adjacency and can lead to high data movement costs. In this paper, we provide an approach for batching dynamic DNNs based on finite state machines, which enables the automatic discovery of batching policies specialized for each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.03851","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/2302.03851/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":"2302.03851","created_at":"2026-07-05T05:39:58.420232+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.03851v1","created_at":"2026-07-05T05:39:58.420232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.03851","created_at":"2026-07-05T05:39:58.420232+00:00"},{"alias_kind":"pith_short_12","alias_value":"4U4YTELATC5L","created_at":"2026-07-05T05:39:58.420232+00:00"},{"alias_kind":"pith_short_16","alias_value":"4U4YTELATC5LODZP","created_at":"2026-07-05T05:39:58.420232+00:00"},{"alias_kind":"pith_short_8","alias_value":"4U4YTELA","created_at":"2026-07-05T05:39:58.420232+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/4U4YTELATC5LODZPXSQIL7WN3D","json":"https://pith.science/pith/4U4YTELATC5LODZPXSQIL7WN3D.json","graph_json":"https://pith.science/api/pith-number/4U4YTELATC5LODZPXSQIL7WN3D/graph.json","events_json":"https://pith.science/api/pith-number/4U4YTELATC5LODZPXSQIL7WN3D/events.json","paper":"https://pith.science/paper/4U4YTELA"},"agent_actions":{"view_html":"https://pith.science/pith/4U4YTELATC5LODZPXSQIL7WN3D","download_json":"https://pith.science/pith/4U4YTELATC5LODZPXSQIL7WN3D.json","view_paper":"https://pith.science/paper/4U4YTELA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.03851&json=true","fetch_graph":"https://pith.science/api/pith-number/4U4YTELATC5LODZPXSQIL7WN3D/graph.json","fetch_events":"https://pith.science/api/pith-number/4U4YTELATC5LODZPXSQIL7WN3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4U4YTELATC5LODZPXSQIL7WN3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4U4YTELATC5LODZPXSQIL7WN3D/action/storage_attestation","attest_author":"https://pith.science/pith/4U4YTELATC5LODZPXSQIL7WN3D/action/author_attestation","sign_citation":"https://pith.science/pith/4U4YTELATC5LODZPXSQIL7WN3D/action/citation_signature","submit_replication":"https://pith.science/pith/4U4YTELATC5LODZPXSQIL7WN3D/action/replication_record"}},"created_at":"2026-07-05T05:39:58.420232+00:00","updated_at":"2026-07-05T05:39:58.420232+00:00"}