{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3346VWAVS2YPSHV6E3GWCKEZDT","short_pith_number":"pith:3346VWAV","canonical_record":{"source":{"id":"1804.06468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T21:10:15Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"14e0bc340299f57d7a8e43f00a3475f9f51b922344ee3f245c656e4f59788d27","abstract_canon_sha256":"392a20e0898af1942cfba7b723a0614f6f43c3b186310cd1c8d5d6d1e258d469"},"schema_version":"1.0"},"canonical_sha256":"def9ead81596b0f91ebe26cd6128991cf763b3b5a711e07d0cd66bf38901aaaa","source":{"kind":"arxiv","id":"1804.06468","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06468","created_at":"2026-05-17T23:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06468v2","created_at":"2026-05-17T23:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06468","created_at":"2026-05-17T23:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"3346VWAVS2YP","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3346VWAVS2YPSHV6","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3346VWAV","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3346VWAVS2YPSHV6E3GWCKEZDT","target":"record","payload":{"canonical_record":{"source":{"id":"1804.06468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T21:10:15Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"14e0bc340299f57d7a8e43f00a3475f9f51b922344ee3f245c656e4f59788d27","abstract_canon_sha256":"392a20e0898af1942cfba7b723a0614f6f43c3b186310cd1c8d5d6d1e258d469"},"schema_version":"1.0"},"canonical_sha256":"def9ead81596b0f91ebe26cd6128991cf763b3b5a711e07d0cd66bf38901aaaa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:09.906108Z","signature_b64":"xzFvkRRs4rhFnHmteGO1WKqZ82Lq0htclRPS9TEVj/f5xQV8d/ySwIG2ZWlXPPTHCfq0/nncXEueOgiqC7NuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"def9ead81596b0f91ebe26cd6128991cf763b3b5a711e07d0cd66bf38901aaaa","last_reissued_at":"2026-05-17T23:45:09.905409Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:09.905409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.06468","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-05-17T23:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+XqOJ7fNDF41yzRv11uYJHcUpn81htkRZq8tsfrSLb64spX+tSLjk9/dbnU+tF7wI6Fm55wbSoIvJEgW2705Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T05:15:08.152768Z"},"content_sha256":"984e256095c6a934fc6d292b17eded1a1560d6343d3ecb580aa7990ad2d9d88b","schema_version":"1.0","event_id":"sha256:984e256095c6a934fc6d292b17eded1a1560d6343d3ecb580aa7990ad2d9d88b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3346VWAVS2YPSHV6E3GWCKEZDT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication-Aware Scheduling of Serial Tasks for Dispersed Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.DC","authors_text":"A. Salman Avestimehr, Chien-Sheng Yang, Ramtin Pedarsani","submitted_at":"2018-04-17T21:10:15Z","abstract_excerpt":"There is a growing interest in development of in-network dispersed computing paradigms that leverage the computing capabilities of heterogeneous resources dispersed across the network for processing massive amount of data is collected at the edge of the network. We consider the problem of task scheduling for such networks, in a dynamic setting in which arriving computation jobs are modeled as chains, with nodes representing tasks, and edges representing precedence constraints among tasks. In our proposed model, motivated by significant communication costs in dispersed computing environments, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06468","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":""},"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-17T23:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"be0kcz2qNXjwAYpraQie1G5j07MSW5378cHcrCWwN0cv/GPnlyWu9BL60OEur4ZnRpk5ffbGCNXPOpG8HejKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T05:15:08.153437Z"},"content_sha256":"9562b78f6f06c2380a82e03789836817a129d7557a97938fa1bb31a24bb9c2b0","schema_version":"1.0","event_id":"sha256:9562b78f6f06c2380a82e03789836817a129d7557a97938fa1bb31a24bb9c2b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3346VWAVS2YPSHV6E3GWCKEZDT/bundle.json","state_url":"https://pith.science/pith/3346VWAVS2YPSHV6E3GWCKEZDT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3346VWAVS2YPSHV6E3GWCKEZDT/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-05-22T05:15:08Z","links":{"resolver":"https://pith.science/pith/3346VWAVS2YPSHV6E3GWCKEZDT","bundle":"https://pith.science/pith/3346VWAVS2YPSHV6E3GWCKEZDT/bundle.json","state":"https://pith.science/pith/3346VWAVS2YPSHV6E3GWCKEZDT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3346VWAVS2YPSHV6E3GWCKEZDT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3346VWAVS2YPSHV6E3GWCKEZDT","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":"392a20e0898af1942cfba7b723a0614f6f43c3b186310cd1c8d5d6d1e258d469","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T21:10:15Z","title_canon_sha256":"14e0bc340299f57d7a8e43f00a3475f9f51b922344ee3f245c656e4f59788d27"},"schema_version":"1.0","source":{"id":"1804.06468","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06468","created_at":"2026-05-17T23:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06468v2","created_at":"2026-05-17T23:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06468","created_at":"2026-05-17T23:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"3346VWAVS2YP","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3346VWAVS2YPSHV6","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3346VWAV","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:9562b78f6f06c2380a82e03789836817a129d7557a97938fa1bb31a24bb9c2b0","target":"graph","created_at":"2026-05-17T23:45:09Z","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":"There is a growing interest in development of in-network dispersed computing paradigms that leverage the computing capabilities of heterogeneous resources dispersed across the network for processing massive amount of data is collected at the edge of the network. We consider the problem of task scheduling for such networks, in a dynamic setting in which arriving computation jobs are modeled as chains, with nodes representing tasks, and edges representing precedence constraints among tasks. In our proposed model, motivated by significant communication costs in dispersed computing environments, t","authors_text":"A. Salman Avestimehr, Chien-Sheng Yang, Ramtin Pedarsani","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T21:10:15Z","title":"Communication-Aware Scheduling of Serial Tasks for Dispersed Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06468","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:984e256095c6a934fc6d292b17eded1a1560d6343d3ecb580aa7990ad2d9d88b","target":"record","created_at":"2026-05-17T23:45:09Z","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":"392a20e0898af1942cfba7b723a0614f6f43c3b186310cd1c8d5d6d1e258d469","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-17T21:10:15Z","title_canon_sha256":"14e0bc340299f57d7a8e43f00a3475f9f51b922344ee3f245c656e4f59788d27"},"schema_version":"1.0","source":{"id":"1804.06468","kind":"arxiv","version":2}},"canonical_sha256":"def9ead81596b0f91ebe26cd6128991cf763b3b5a711e07d0cd66bf38901aaaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"def9ead81596b0f91ebe26cd6128991cf763b3b5a711e07d0cd66bf38901aaaa","first_computed_at":"2026-05-17T23:45:09.905409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:09.905409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xzFvkRRs4rhFnHmteGO1WKqZ82Lq0htclRPS9TEVj/f5xQV8d/ySwIG2ZWlXPPTHCfq0/nncXEueOgiqC7NuBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:09.906108Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06468","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:984e256095c6a934fc6d292b17eded1a1560d6343d3ecb580aa7990ad2d9d88b","sha256:9562b78f6f06c2380a82e03789836817a129d7557a97938fa1bb31a24bb9c2b0"],"state_sha256":"aedcdd6b637e63a985d47efd13d3ed7f0933d6d40a0332ba3a3df30a1e0fe287"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9MDST4QuygeUlAcTrVqlXVw4eTkxpSsp0VgJSqAB9UWjKojxJIKXI6FSplhBtejoMBpTc7TczYiIBsipz4RWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T05:15:08.156071Z","bundle_sha256":"f1f05d4e275ab780fa39f754e704d49ef1a17156f2b5ed4434f20dd047fb2c3a"}}