{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SYXWTITXYCYTB5E2JHQUKDPYAA","short_pith_number":"pith:SYXWTITX","canonical_record":{"source":{"id":"1711.01912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-06T14:44:05Z","cross_cats_sorted":[],"title_canon_sha256":"b14ac30a3ee228d93ec329336e4a281cf33e09b631b1413f20040f16d5b22e4f","abstract_canon_sha256":"318103f527e96518073cfc3b25446f51f9ea94e7e0792c10c3ca797834332888"},"schema_version":"1.0"},"canonical_sha256":"962f69a277c0b130f49a49e1450df800093f636fcb3103de3d867dad0c58c6fb","source":{"kind":"arxiv","id":"1711.01912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01912","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01912v1","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01912","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"pith_short_12","alias_value":"SYXWTITXYCYT","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SYXWTITXYCYTB5E2","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SYXWTITX","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SYXWTITXYCYTB5E2JHQUKDPYAA","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-06T14:44:05Z","cross_cats_sorted":[],"title_canon_sha256":"b14ac30a3ee228d93ec329336e4a281cf33e09b631b1413f20040f16d5b22e4f","abstract_canon_sha256":"318103f527e96518073cfc3b25446f51f9ea94e7e0792c10c3ca797834332888"},"schema_version":"1.0"},"canonical_sha256":"962f69a277c0b130f49a49e1450df800093f636fcb3103de3d867dad0c58c6fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:16.580265Z","signature_b64":"Mi04c/dm8D59WmjIzxmGMlSrVjV90r3SNQL7u7td3tZjVOjZYylGERl0ptVSQ7RSGORIhPTwqqSBbo0ejxNaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"962f69a277c0b130f49a49e1450df800093f636fcb3103de3d867dad0c58c6fb","last_reissued_at":"2026-05-18T00:31:16.579825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:16.579825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01912","source_version":1,"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-05-18T00:31:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q9xPmoRsJxupUVqyc01Kk20I1mEJKw+yJihSlZdnCvaXNU2JoKfgCbz0/f9oWZCUdKvDZ61xXgpWpLnHPR4FDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:30:16.659062Z"},"content_sha256":"c1bad1fa59a0c8286a5b62afcdef724b6162d03899161f217c0c0be50eea1f3a","schema_version":"1.0","event_id":"sha256:c1bad1fa59a0c8286a5b62afcdef724b6162d03899161f217c0c0be50eea1f3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SYXWTITXYCYTB5E2JHQUKDPYAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The TensorFlow Partitioning and Scheduling Problem: It's the Critical Path!","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Mayer, Larissa Laich, Ruben Mayer","submitted_at":"2017-11-06T14:44:05Z","abstract_excerpt":"State-of-the-art data flow systems such as TensorFlow impose iterative calculations on large graphs that need to be partitioned on heterogeneous devices such as CPUs, GPUs, and TPUs. However, partitioning can not be viewed in isolation. Each device has to select the next graph vertex to be executed, i.e., perform local scheduling decisions. Both problems, partitioning and scheduling, are NP-complete by themselves but have to be solved in combination in order to minimize overall execution time of an iteration. In this paper, we propose several heuristic strategies to solve the partitioning and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01912","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":""},"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-05-18T00:31:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOOpP4eQ0uFBrpGtj33cLOPIzOX8RCHV+XaLyTOt3sw1EkEyTjfC8oBc3GvinOdPFrniJIOqawrJBuPzVI7VDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T23:30:16.659427Z"},"content_sha256":"7511128c6115b091730ae90b97cbc7ef0acd0d56f6dc78870341ce67fa8724d7","schema_version":"1.0","event_id":"sha256:7511128c6115b091730ae90b97cbc7ef0acd0d56f6dc78870341ce67fa8724d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SYXWTITXYCYTB5E2JHQUKDPYAA/bundle.json","state_url":"https://pith.science/pith/SYXWTITXYCYTB5E2JHQUKDPYAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SYXWTITXYCYTB5E2JHQUKDPYAA/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-06-23T23:30:16Z","links":{"resolver":"https://pith.science/pith/SYXWTITXYCYTB5E2JHQUKDPYAA","bundle":"https://pith.science/pith/SYXWTITXYCYTB5E2JHQUKDPYAA/bundle.json","state":"https://pith.science/pith/SYXWTITXYCYTB5E2JHQUKDPYAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SYXWTITXYCYTB5E2JHQUKDPYAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SYXWTITXYCYTB5E2JHQUKDPYAA","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":"318103f527e96518073cfc3b25446f51f9ea94e7e0792c10c3ca797834332888","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-06T14:44:05Z","title_canon_sha256":"b14ac30a3ee228d93ec329336e4a281cf33e09b631b1413f20040f16d5b22e4f"},"schema_version":"1.0","source":{"id":"1711.01912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01912","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01912v1","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01912","created_at":"2026-05-18T00:31:16Z"},{"alias_kind":"pith_short_12","alias_value":"SYXWTITXYCYT","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SYXWTITXYCYTB5E2","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SYXWTITX","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:7511128c6115b091730ae90b97cbc7ef0acd0d56f6dc78870341ce67fa8724d7","target":"graph","created_at":"2026-05-18T00:31:16Z","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"},"paper":{"abstract_excerpt":"State-of-the-art data flow systems such as TensorFlow impose iterative calculations on large graphs that need to be partitioned on heterogeneous devices such as CPUs, GPUs, and TPUs. However, partitioning can not be viewed in isolation. Each device has to select the next graph vertex to be executed, i.e., perform local scheduling decisions. Both problems, partitioning and scheduling, are NP-complete by themselves but have to be solved in combination in order to minimize overall execution time of an iteration. In this paper, we propose several heuristic strategies to solve the partitioning and ","authors_text":"Christian Mayer, Larissa Laich, Ruben Mayer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-06T14:44:05Z","title":"The TensorFlow Partitioning and Scheduling Problem: It's the Critical Path!"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01912","kind":"arxiv","version":1},"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:c1bad1fa59a0c8286a5b62afcdef724b6162d03899161f217c0c0be50eea1f3a","target":"record","created_at":"2026-05-18T00:31:16Z","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":"318103f527e96518073cfc3b25446f51f9ea94e7e0792c10c3ca797834332888","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-06T14:44:05Z","title_canon_sha256":"b14ac30a3ee228d93ec329336e4a281cf33e09b631b1413f20040f16d5b22e4f"},"schema_version":"1.0","source":{"id":"1711.01912","kind":"arxiv","version":1}},"canonical_sha256":"962f69a277c0b130f49a49e1450df800093f636fcb3103de3d867dad0c58c6fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"962f69a277c0b130f49a49e1450df800093f636fcb3103de3d867dad0c58c6fb","first_computed_at":"2026-05-18T00:31:16.579825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:16.579825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mi04c/dm8D59WmjIzxmGMlSrVjV90r3SNQL7u7td3tZjVOjZYylGERl0ptVSQ7RSGORIhPTwqqSBbo0ejxNaBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:16.580265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1bad1fa59a0c8286a5b62afcdef724b6162d03899161f217c0c0be50eea1f3a","sha256:7511128c6115b091730ae90b97cbc7ef0acd0d56f6dc78870341ce67fa8724d7"],"state_sha256":"890c562cb3caeb25332ba440e8d323ce35f81c021efda6c4e746ac8d79820fe6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbQr5X+9oViCIIjphVH8TBopv3WWC0RqaQpyHDeatBJjfk7bb6o4heZFTEnWIQpWpDamgERNlGVfRVp4kg7GCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T23:30:16.661371Z","bundle_sha256":"9ec46581435403ce429b6a81cbace5ddab109d020ca577c574b4f700770e515e"}}