{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XOW675X6PVVJVJSRCA4USR4FDR","short_pith_number":"pith:XOW675X6","canonical_record":{"source":{"id":"1901.09312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-27T04:10:01Z","cross_cats_sorted":[],"title_canon_sha256":"eb0bf04106d6d0089147b2ac4de0545804e70508d8a7331a7c4a165069e5f6de","abstract_canon_sha256":"52de273708a3a321ab10ee5546a99b9a9959a79fdce267b4629857bb4440489d"},"schema_version":"1.0"},"canonical_sha256":"bbadeff6fe7d6a9aa65110394947851c5fed280e823f261dfa5451b7f5544bcb","source":{"kind":"arxiv","id":"1901.09312","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09312","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09312v1","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09312","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"XOW675X6PVVJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XOW675X6PVVJVJSR","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XOW675X6","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XOW675X6PVVJVJSRCA4USR4FDR","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09312","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-27T04:10:01Z","cross_cats_sorted":[],"title_canon_sha256":"eb0bf04106d6d0089147b2ac4de0545804e70508d8a7331a7c4a165069e5f6de","abstract_canon_sha256":"52de273708a3a321ab10ee5546a99b9a9959a79fdce267b4629857bb4440489d"},"schema_version":"1.0"},"canonical_sha256":"bbadeff6fe7d6a9aa65110394947851c5fed280e823f261dfa5451b7f5544bcb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:25.148163Z","signature_b64":"jlP2xTCUYxfsxxyaycv5KIiU2tnOwhlibvugSdeo6ChA+vBRCGy/ezc5nZP7f9rJpHbdyUNK1wfWffHm9vmcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbadeff6fe7d6a9aa65110394947851c5fed280e823f261dfa5451b7f5544bcb","last_reissued_at":"2026-05-17T23:55:25.147656Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:25.147656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09312","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-17T23:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vjumps+7nE/ZOZqZBDboJBmp0L5KAPGpLSOGqfMgObGEG4KK/0iew6Rl7TilMgeu/IsiUkKKNWvoy74alS9mAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:17:00.498503Z"},"content_sha256":"6f7d77a5b27ff512c657f85823c3434940b0b6a3f585260ba99d54a405521c45","schema_version":"1.0","event_id":"sha256:6f7d77a5b27ff512c657f85823c3434940b0b6a3f585260ba99d54a405521c45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XOW675X6PVVJVJSRCA4USR4FDR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Dynamic Resource Allocation via Probabilistic Task Pruning in Heterogeneous Computing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chavit Denninnart, James Gentry, Mohsen Amini Salehi","submitted_at":"2019-01-27T04:10:01Z","abstract_excerpt":"In heterogeneous distributed computing (HC) systems, diversity can exist in both computational resources and arriving tasks. In an inconsistently heterogeneous computing system, task types have different execution times on heterogeneous machines. A method is required to map arriving tasks to machines based on machine availability and performance, maximizing the number of tasks meeting deadlines (defined as robustness). For tasks with hard deadlines (eg those in live video streaming), tasks that miss their deadlines are dropped. The problem investigated in this research is maximizing the robust"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09312","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-17T23:55:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIMO5/uTIBs5CkxFytObWKhCoZdo4SdycQJy2mZP0GEvm1WbF+nGKmZVpnA9w73X7FiajkJkhNwGjV/wuo4TDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:17:00.499203Z"},"content_sha256":"6f2764e9e4220cdcb3803c46f6efac8d04b3d900540b839edaf3fdc284f5fcef","schema_version":"1.0","event_id":"sha256:6f2764e9e4220cdcb3803c46f6efac8d04b3d900540b839edaf3fdc284f5fcef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XOW675X6PVVJVJSRCA4USR4FDR/bundle.json","state_url":"https://pith.science/pith/XOW675X6PVVJVJSRCA4USR4FDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XOW675X6PVVJVJSRCA4USR4FDR/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-31T22:17:00Z","links":{"resolver":"https://pith.science/pith/XOW675X6PVVJVJSRCA4USR4FDR","bundle":"https://pith.science/pith/XOW675X6PVVJVJSRCA4USR4FDR/bundle.json","state":"https://pith.science/pith/XOW675X6PVVJVJSRCA4USR4FDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XOW675X6PVVJVJSRCA4USR4FDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XOW675X6PVVJVJSRCA4USR4FDR","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":"52de273708a3a321ab10ee5546a99b9a9959a79fdce267b4629857bb4440489d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-27T04:10:01Z","title_canon_sha256":"eb0bf04106d6d0089147b2ac4de0545804e70508d8a7331a7c4a165069e5f6de"},"schema_version":"1.0","source":{"id":"1901.09312","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09312","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09312v1","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09312","created_at":"2026-05-17T23:55:25Z"},{"alias_kind":"pith_short_12","alias_value":"XOW675X6PVVJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XOW675X6PVVJVJSR","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XOW675X6","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:6f2764e9e4220cdcb3803c46f6efac8d04b3d900540b839edaf3fdc284f5fcef","target":"graph","created_at":"2026-05-17T23:55:25Z","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":"In heterogeneous distributed computing (HC) systems, diversity can exist in both computational resources and arriving tasks. In an inconsistently heterogeneous computing system, task types have different execution times on heterogeneous machines. A method is required to map arriving tasks to machines based on machine availability and performance, maximizing the number of tasks meeting deadlines (defined as robustness). For tasks with hard deadlines (eg those in live video streaming), tasks that miss their deadlines are dropped. The problem investigated in this research is maximizing the robust","authors_text":"Chavit Denninnart, James Gentry, Mohsen Amini Salehi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-27T04:10:01Z","title":"Robust Dynamic Resource Allocation via Probabilistic Task Pruning in Heterogeneous Computing Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09312","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:6f7d77a5b27ff512c657f85823c3434940b0b6a3f585260ba99d54a405521c45","target":"record","created_at":"2026-05-17T23:55:25Z","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":"52de273708a3a321ab10ee5546a99b9a9959a79fdce267b4629857bb4440489d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-27T04:10:01Z","title_canon_sha256":"eb0bf04106d6d0089147b2ac4de0545804e70508d8a7331a7c4a165069e5f6de"},"schema_version":"1.0","source":{"id":"1901.09312","kind":"arxiv","version":1}},"canonical_sha256":"bbadeff6fe7d6a9aa65110394947851c5fed280e823f261dfa5451b7f5544bcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbadeff6fe7d6a9aa65110394947851c5fed280e823f261dfa5451b7f5544bcb","first_computed_at":"2026-05-17T23:55:25.147656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:25.147656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jlP2xTCUYxfsxxyaycv5KIiU2tnOwhlibvugSdeo6ChA+vBRCGy/ezc5nZP7f9rJpHbdyUNK1wfWffHm9vmcCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:25.148163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09312","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f7d77a5b27ff512c657f85823c3434940b0b6a3f585260ba99d54a405521c45","sha256:6f2764e9e4220cdcb3803c46f6efac8d04b3d900540b839edaf3fdc284f5fcef"],"state_sha256":"552d0c71b63705bcd94d9d2c8fd4eea3e1b98a1c4e8e7d55d3cce640543bc18f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zPwoIY01UZQ2toUVSk//glInhgxsPwYTDHSyM4QBcXTrOVqFBX1i8zUTs1rogXsBNBEfXEpuF8HOtEq786z3Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:17:00.503146Z","bundle_sha256":"90a2881a31d121f781817b31083595483092132f21a00c577d28a293f7d2754a"}}