{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MBQZJJ66WSQBOXI4ZAAHANXFCW","short_pith_number":"pith:MBQZJJ66","canonical_record":{"source":{"id":"1701.08800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-30T19:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"fd319595c2c5d5a85bc0088c2ad20a745d545f938f71941a51944e277cebbd23","abstract_canon_sha256":"ed8ef9ee143368f05f3c6ec9f413ef96a8c3ba7526d7223b30be960a4ac59dc9"},"schema_version":"1.0"},"canonical_sha256":"606194a7deb4a0175d1cc8007036e515ba97070c841f31bb13d61864c2b21a53","source":{"kind":"arxiv","id":"1701.08800","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08800","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08800v1","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08800","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"pith_short_12","alias_value":"MBQZJJ66WSQB","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MBQZJJ66WSQBOXI4","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MBQZJJ66","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MBQZJJ66WSQBOXI4ZAAHANXFCW","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-30T19:54:01Z","cross_cats_sorted":[],"title_canon_sha256":"fd319595c2c5d5a85bc0088c2ad20a745d545f938f71941a51944e277cebbd23","abstract_canon_sha256":"ed8ef9ee143368f05f3c6ec9f413ef96a8c3ba7526d7223b30be960a4ac59dc9"},"schema_version":"1.0"},"canonical_sha256":"606194a7deb4a0175d1cc8007036e515ba97070c841f31bb13d61864c2b21a53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:39.160282Z","signature_b64":"zZxIa0j4AjPoHk8rH66j0mYPbBXci1zm6A0XfVzoAjRI3c9C5Vhnf0P93NBT8777xcvPi2PwWbwXDMFJdeMSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"606194a7deb4a0175d1cc8007036e515ba97070c841f31bb13d61864c2b21a53","last_reissued_at":"2026-05-18T00:51:39.159907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:39.159907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08800","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:51:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUXA7rh4tHoEPRuGC4dG48IEJ01vboG4e1Gv3pFkTejs49Hw6Ft2t+EKe/hNU9W5yG5bebaJjdfu0oxiXGGsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:44:59.503391Z"},"content_sha256":"e3a304748dc1538626df25a5349a7463ab5fd1cebabe1bef50eb685a88a1dfd1","schema_version":"1.0","event_id":"sha256:e3a304748dc1538626df25a5349a7463ab5fd1cebabe1bef50eb685a88a1dfd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MBQZJJ66WSQBOXI4ZAAHANXFCW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mutual Inclusivity of the Critical Path and its Partial Schedule on Heterogeneous Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aravind Vasudevan, David Gregg","submitted_at":"2017-01-30T19:54:01Z","abstract_excerpt":"The critical path of a group of tasks is an important measure that is commonly used to guide task allocation and scheduling on parallel computers. The critical path is the longest chain of dependencies in an acyclic task dependence graph. A problem arises on heterogeneous parallel machines where computation and communication costs can vary between different types of processor. Existing solutions for heterogeneous machines attempt to estimate the critical path using average values of computation and communication costs. However, this ignores opportunities to match specific tasks to specific cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08800","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:51:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QAwo6ilrZJdR+1el3ES2JcQTw8jeLv5MFrpmILsN+/l8t7ceqlYDbyrSsnPbj5a4hjo4gjXwkIqGDpqOQsaAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:44:59.503774Z"},"content_sha256":"572eebbf871a60a5a3725470c504c01b95936f94b4f2ddb3a4e0a8d848c9de6d","schema_version":"1.0","event_id":"sha256:572eebbf871a60a5a3725470c504c01b95936f94b4f2ddb3a4e0a8d848c9de6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBQZJJ66WSQBOXI4ZAAHANXFCW/bundle.json","state_url":"https://pith.science/pith/MBQZJJ66WSQBOXI4ZAAHANXFCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBQZJJ66WSQBOXI4ZAAHANXFCW/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-01T03:44:59Z","links":{"resolver":"https://pith.science/pith/MBQZJJ66WSQBOXI4ZAAHANXFCW","bundle":"https://pith.science/pith/MBQZJJ66WSQBOXI4ZAAHANXFCW/bundle.json","state":"https://pith.science/pith/MBQZJJ66WSQBOXI4ZAAHANXFCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBQZJJ66WSQBOXI4ZAAHANXFCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MBQZJJ66WSQBOXI4ZAAHANXFCW","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":"ed8ef9ee143368f05f3c6ec9f413ef96a8c3ba7526d7223b30be960a4ac59dc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-30T19:54:01Z","title_canon_sha256":"fd319595c2c5d5a85bc0088c2ad20a745d545f938f71941a51944e277cebbd23"},"schema_version":"1.0","source":{"id":"1701.08800","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08800","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08800v1","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08800","created_at":"2026-05-18T00:51:39Z"},{"alias_kind":"pith_short_12","alias_value":"MBQZJJ66WSQB","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MBQZJJ66WSQBOXI4","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MBQZJJ66","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:572eebbf871a60a5a3725470c504c01b95936f94b4f2ddb3a4e0a8d848c9de6d","target":"graph","created_at":"2026-05-18T00:51:39Z","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":"The critical path of a group of tasks is an important measure that is commonly used to guide task allocation and scheduling on parallel computers. The critical path is the longest chain of dependencies in an acyclic task dependence graph. A problem arises on heterogeneous parallel machines where computation and communication costs can vary between different types of processor. Existing solutions for heterogeneous machines attempt to estimate the critical path using average values of computation and communication costs. However, this ignores opportunities to match specific tasks to specific cla","authors_text":"Aravind Vasudevan, David Gregg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-30T19:54:01Z","title":"Mutual Inclusivity of the Critical Path and its Partial Schedule on Heterogeneous Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08800","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:e3a304748dc1538626df25a5349a7463ab5fd1cebabe1bef50eb685a88a1dfd1","target":"record","created_at":"2026-05-18T00:51:39Z","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":"ed8ef9ee143368f05f3c6ec9f413ef96a8c3ba7526d7223b30be960a4ac59dc9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-30T19:54:01Z","title_canon_sha256":"fd319595c2c5d5a85bc0088c2ad20a745d545f938f71941a51944e277cebbd23"},"schema_version":"1.0","source":{"id":"1701.08800","kind":"arxiv","version":1}},"canonical_sha256":"606194a7deb4a0175d1cc8007036e515ba97070c841f31bb13d61864c2b21a53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"606194a7deb4a0175d1cc8007036e515ba97070c841f31bb13d61864c2b21a53","first_computed_at":"2026-05-18T00:51:39.159907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:39.159907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zZxIa0j4AjPoHk8rH66j0mYPbBXci1zm6A0XfVzoAjRI3c9C5Vhnf0P93NBT8777xcvPi2PwWbwXDMFJdeMSAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:39.160282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08800","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3a304748dc1538626df25a5349a7463ab5fd1cebabe1bef50eb685a88a1dfd1","sha256:572eebbf871a60a5a3725470c504c01b95936f94b4f2ddb3a4e0a8d848c9de6d"],"state_sha256":"dabed03d9d2b7366e0cab2a49f45c872a6d2be30e4e9f4267d73e9501497eb37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4V2cSuenvOMq1+mhScQYZAFNHCfrBUYUWAdtrWnjkBjSqrNQnRnQ+dExtasnL9xBlbBfWOFpwStDGIRDRcphBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:44:59.505976Z","bundle_sha256":"fb59edfa9787c62e528277f1734fa9f2d09d86a41b5fbe7717d0681474327528"}}