{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:6AF7TN435NJDB5RQQ2QS5I5A7P","short_pith_number":"pith:6AF7TN43","canonical_record":{"source":{"id":"2008.08636","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2020-08-19T19:09:04Z","cross_cats_sorted":[],"title_canon_sha256":"d995f5d57c77c249e98d4aafe301bde4d3bd2ff6a872261192d4941a7758d6c1","abstract_canon_sha256":"1999e3e6999ba89337fc836c5dadb1f2eda7e87b2bbf1e1de2ab7877beb28387"},"schema_version":"1.0"},"canonical_sha256":"f00bf9b79beb5230f63086a12ea3a0fbfe7c5a6fb2faa51bf51d5d914fb11f1b","source":{"kind":"arxiv","id":"2008.08636","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.08636","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"2008.08636v2","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.08636","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"6AF7TN435NJD","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"pith_short_16","alias_value":"6AF7TN435NJDB5RQ","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"pith_short_8","alias_value":"6AF7TN43","created_at":"2026-07-05T02:37:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:6AF7TN435NJDB5RQQ2QS5I5A7P","target":"record","payload":{"canonical_record":{"source":{"id":"2008.08636","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2020-08-19T19:09:04Z","cross_cats_sorted":[],"title_canon_sha256":"d995f5d57c77c249e98d4aafe301bde4d3bd2ff6a872261192d4941a7758d6c1","abstract_canon_sha256":"1999e3e6999ba89337fc836c5dadb1f2eda7e87b2bbf1e1de2ab7877beb28387"},"schema_version":"1.0"},"canonical_sha256":"f00bf9b79beb5230f63086a12ea3a0fbfe7c5a6fb2faa51bf51d5d914fb11f1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:37:42.018046Z","signature_b64":"HNC46S5PAOKL0MyeqIHSqUVqPQZJDItwO7x8KsSCpusO3yJfBL+jm/TjzpadoZ70ErsHT01g0wcGP1e4IhR6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f00bf9b79beb5230f63086a12ea3a0fbfe7c5a6fb2faa51bf51d5d914fb11f1b","last_reissued_at":"2026-07-05T02:37:42.017568Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:37:42.017568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2008.08636","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EbpXD1pDAlM4VJUsXYY0DdheUDIbrkJdzlbFAYeLIybkdjuuZsHn19jOM5YxIjdTYEbCtBRWrIwaOcE0EK3CBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:16:33.771159Z"},"content_sha256":"69f39e83a30d1dc2f6e55494435f573851badc34d7c046ab23c5a35a91e4f7a4","schema_version":"1.0","event_id":"sha256:69f39e83a30d1dc2f6e55494435f573851badc34d7c046ab23c5a35a91e4f7a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:6AF7TN435NJDB5RQQ2QS5I5A7P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Computational-Graph Partitioning Method for Training Memory-Constrained DNNs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Didem Unat, Do\\u{g}a Dikbay{\\i}r, Fareed Qararyah, Mehmet Esat Belviranli, Mohamed Wahib","submitted_at":"2020-08-19T19:09:04Z","abstract_excerpt":"Many state-of-the-art Deep Neural Networks (DNNs) have substantial memory requirements. Limited device memory becomes a bottleneck when training those models. We propose ParDNN, an automatic, generic, and non-intrusive partitioning strategy for DNNs that are represented as computational graphs. ParDNN decides a placement of DNN's underlying computational graph operations across multiple devices so that the devices' memory constraints are met and the training time is minimized. ParDNN is completely independent of the deep learning aspects of a DNN. It requires no modification neither at the mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.08636","kind":"arxiv","version":2},"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/2008.08636/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:37:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3NvROVSNTWLVt48zLc51RPwvnSSM500GFuNmK9+VBbxDH/iEBifPKu+l1U+7O+W4ezuMVlNO0yxZKt+FQ3BSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:16:33.771546Z"},"content_sha256":"233a98a1134a609450457d93819784b8c5672d9aecda100ca27292601d33abd1","schema_version":"1.0","event_id":"sha256:233a98a1134a609450457d93819784b8c5672d9aecda100ca27292601d33abd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AF7TN435NJDB5RQQ2QS5I5A7P/bundle.json","state_url":"https://pith.science/pith/6AF7TN435NJDB5RQQ2QS5I5A7P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AF7TN435NJDB5RQQ2QS5I5A7P/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T12:16:33Z","links":{"resolver":"https://pith.science/pith/6AF7TN435NJDB5RQQ2QS5I5A7P","bundle":"https://pith.science/pith/6AF7TN435NJDB5RQQ2QS5I5A7P/bundle.json","state":"https://pith.science/pith/6AF7TN435NJDB5RQQ2QS5I5A7P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AF7TN435NJDB5RQQ2QS5I5A7P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:6AF7TN435NJDB5RQQ2QS5I5A7P","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1999e3e6999ba89337fc836c5dadb1f2eda7e87b2bbf1e1de2ab7877beb28387","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2020-08-19T19:09:04Z","title_canon_sha256":"d995f5d57c77c249e98d4aafe301bde4d3bd2ff6a872261192d4941a7758d6c1"},"schema_version":"1.0","source":{"id":"2008.08636","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.08636","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"2008.08636v2","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.08636","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"6AF7TN435NJD","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"pith_short_16","alias_value":"6AF7TN435NJDB5RQ","created_at":"2026-07-05T02:37:42Z"},{"alias_kind":"pith_short_8","alias_value":"6AF7TN43","created_at":"2026-07-05T02:37:42Z"}],"graph_snapshots":[{"event_id":"sha256:233a98a1134a609450457d93819784b8c5672d9aecda100ca27292601d33abd1","target":"graph","created_at":"2026-07-05T02:37:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2008.08636/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many state-of-the-art Deep Neural Networks (DNNs) have substantial memory requirements. Limited device memory becomes a bottleneck when training those models. We propose ParDNN, an automatic, generic, and non-intrusive partitioning strategy for DNNs that are represented as computational graphs. ParDNN decides a placement of DNN's underlying computational graph operations across multiple devices so that the devices' memory constraints are met and the training time is minimized. ParDNN is completely independent of the deep learning aspects of a DNN. It requires no modification neither at the mod","authors_text":"Didem Unat, Do\\u{g}a Dikbay{\\i}r, Fareed Qararyah, Mehmet Esat Belviranli, Mohamed Wahib","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2020-08-19T19:09:04Z","title":"A Computational-Graph Partitioning Method for Training Memory-Constrained DNNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.08636","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:69f39e83a30d1dc2f6e55494435f573851badc34d7c046ab23c5a35a91e4f7a4","target":"record","created_at":"2026-07-05T02:37:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1999e3e6999ba89337fc836c5dadb1f2eda7e87b2bbf1e1de2ab7877beb28387","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DC","submitted_at":"2020-08-19T19:09:04Z","title_canon_sha256":"d995f5d57c77c249e98d4aafe301bde4d3bd2ff6a872261192d4941a7758d6c1"},"schema_version":"1.0","source":{"id":"2008.08636","kind":"arxiv","version":2}},"canonical_sha256":"f00bf9b79beb5230f63086a12ea3a0fbfe7c5a6fb2faa51bf51d5d914fb11f1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f00bf9b79beb5230f63086a12ea3a0fbfe7c5a6fb2faa51bf51d5d914fb11f1b","first_computed_at":"2026-07-05T02:37:42.017568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:37:42.017568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HNC46S5PAOKL0MyeqIHSqUVqPQZJDItwO7x8KsSCpusO3yJfBL+jm/TjzpadoZ70ErsHT01g0wcGP1e4IhR6BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:37:42.018046Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.08636","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69f39e83a30d1dc2f6e55494435f573851badc34d7c046ab23c5a35a91e4f7a4","sha256:233a98a1134a609450457d93819784b8c5672d9aecda100ca27292601d33abd1"],"state_sha256":"a616a191a591a56aef0f086de31445d178e33a863d9a7176d24c46e12456ae45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TJ6e+9F07sht+kNEaaVVIs+I1pF47uW0vLuNPZx1vV+RRm/bDkyL8RMDl0b0CNGMkeF0nLc+ciyWcJBQiARCCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T12:16:33.773422Z","bundle_sha256":"ff12c89fad08191f7617bc4b9430868f17217281c3c2bad170f4eb096511d5c2"}}