{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:F2ROKMNNG3DSMCL7DQ27A24BKQ","short_pith_number":"pith:F2ROKMNN","canonical_record":{"source":{"id":"0802.2418","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-02-18T20:57:17Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"de1c72c413faa791e0d3332f9f2c2478542f606461b525526a94cc0780096e3e","abstract_canon_sha256":"5d352db20bebc85a9aa92e9f9b8e16d5ef94738d7c6f09068bff355504b7d7ef"},"schema_version":"1.0"},"canonical_sha256":"2ea2e531ad36c726097f1c35f06b8154039aec20bb6612968667b95f39d80635","source":{"kind":"arxiv","id":"0802.2418","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.2418","created_at":"2026-07-04T15:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"0802.2418v2","created_at":"2026-07-04T15:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.2418","created_at":"2026-07-04T15:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"F2ROKMNNG3DS","created_at":"2026-07-04T15:09:36Z"},{"alias_kind":"pith_short_16","alias_value":"F2ROKMNNG3DSMCL7","created_at":"2026-07-04T15:09:36Z"},{"alias_kind":"pith_short_8","alias_value":"F2ROKMNN","created_at":"2026-07-04T15:09:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:F2ROKMNNG3DSMCL7DQ27A24BKQ","target":"record","payload":{"canonical_record":{"source":{"id":"0802.2418","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-02-18T20:57:17Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"de1c72c413faa791e0d3332f9f2c2478542f606461b525526a94cc0780096e3e","abstract_canon_sha256":"5d352db20bebc85a9aa92e9f9b8e16d5ef94738d7c6f09068bff355504b7d7ef"},"schema_version":"1.0"},"canonical_sha256":"2ea2e531ad36c726097f1c35f06b8154039aec20bb6612968667b95f39d80635","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:09:36.790103Z","signature_b64":"Hq2g/LLIfVvnVsBh9Zt8V7y1h3qFFC/gFO4ztfndBAWIquVV1Qacr4MT3UzthVORLKWn1Z7rMFcmFKBa25/KDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ea2e531ad36c726097f1c35f06b8154039aec20bb6612968667b95f39d80635","last_reissued_at":"2026-07-04T15:09:36.789640Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:09:36.789640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0802.2418","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-04T15:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a8SQiis1qzpMwcheNoUUDrvUq7/uVha51OlZgOZgvKeXEnXRnYvQEg6iFCEOwynCzNzssrY+G2VtmmpVDdLMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:06:36.953955Z"},"content_sha256":"166259f0e328f1bfabced3c597b971f81261c8cddd62331fcdd8f18a9163817f","schema_version":"1.0","event_id":"sha256:166259f0e328f1bfabced3c597b971f81261c8cddd62331fcdd8f18a9163817f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:F2ROKMNNG3DSMCL7DQ27A24BKQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Approximations for Multiprocessor Scheduling Under Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Christopher Crutchfield, David R. Karger, Jacob Scott, Jeremy T. Fineman, Zoran Dzunic","submitted_at":"2008-02-18T20:57:17Z","abstract_excerpt":"This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty, or SUU, in which the execution of each job may fail probabilistically. This problem is motivated by the increasing use of distributed computing to handle large, computationally intensive tasks. In the SUU problem we are given n unit-length jobs and m machines, a directed acyclic graph G of precedence constraints among jobs, and unrelated failure probabilities q_{ij} for each job j when executed on machine i for a single timestep. Our goal is to find a schedule that minimizes th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.2418","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/0802.2418/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-04T15:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QmFoxg3RIoqF1XbHCY0lN4PgkRsT/enV6jhTYoAs9mqpgwjjrO5N+qftXEfAe/bpOUtVxFWpZVBmzGrmBbIkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:06:36.954454Z"},"content_sha256":"a07f888d3f1b249e90f3abf4b68311dacfeeb114a1c6d5a55c321d11675d97b0","schema_version":"1.0","event_id":"sha256:a07f888d3f1b249e90f3abf4b68311dacfeeb114a1c6d5a55c321d11675d97b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F2ROKMNNG3DSMCL7DQ27A24BKQ/bundle.json","state_url":"https://pith.science/pith/F2ROKMNNG3DSMCL7DQ27A24BKQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F2ROKMNNG3DSMCL7DQ27A24BKQ/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-08-06T09:06:36Z","links":{"resolver":"https://pith.science/pith/F2ROKMNNG3DSMCL7DQ27A24BKQ","bundle":"https://pith.science/pith/F2ROKMNNG3DSMCL7DQ27A24BKQ/bundle.json","state":"https://pith.science/pith/F2ROKMNNG3DSMCL7DQ27A24BKQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F2ROKMNNG3DSMCL7DQ27A24BKQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:F2ROKMNNG3DSMCL7DQ27A24BKQ","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":"5d352db20bebc85a9aa92e9f9b8e16d5ef94738d7c6f09068bff355504b7d7ef","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-02-18T20:57:17Z","title_canon_sha256":"de1c72c413faa791e0d3332f9f2c2478542f606461b525526a94cc0780096e3e"},"schema_version":"1.0","source":{"id":"0802.2418","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.2418","created_at":"2026-07-04T15:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"0802.2418v2","created_at":"2026-07-04T15:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.2418","created_at":"2026-07-04T15:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"F2ROKMNNG3DS","created_at":"2026-07-04T15:09:36Z"},{"alias_kind":"pith_short_16","alias_value":"F2ROKMNNG3DSMCL7","created_at":"2026-07-04T15:09:36Z"},{"alias_kind":"pith_short_8","alias_value":"F2ROKMNN","created_at":"2026-07-04T15:09:36Z"}],"graph_snapshots":[{"event_id":"sha256:a07f888d3f1b249e90f3abf4b68311dacfeeb114a1c6d5a55c321d11675d97b0","target":"graph","created_at":"2026-07-04T15:09:36Z","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/0802.2418/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty, or SUU, in which the execution of each job may fail probabilistically. This problem is motivated by the increasing use of distributed computing to handle large, computationally intensive tasks. In the SUU problem we are given n unit-length jobs and m machines, a directed acyclic graph G of precedence constraints among jobs, and unrelated failure probabilities q_{ij} for each job j when executed on machine i for a single timestep. Our goal is to find a schedule that minimizes th","authors_text":"Christopher Crutchfield, David R. Karger, Jacob Scott, Jeremy T. Fineman, Zoran Dzunic","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-02-18T20:57:17Z","title":"Improved Approximations for Multiprocessor Scheduling Under Uncertainty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.2418","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:166259f0e328f1bfabced3c597b971f81261c8cddd62331fcdd8f18a9163817f","target":"record","created_at":"2026-07-04T15:09:36Z","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":"5d352db20bebc85a9aa92e9f9b8e16d5ef94738d7c6f09068bff355504b7d7ef","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2008-02-18T20:57:17Z","title_canon_sha256":"de1c72c413faa791e0d3332f9f2c2478542f606461b525526a94cc0780096e3e"},"schema_version":"1.0","source":{"id":"0802.2418","kind":"arxiv","version":2}},"canonical_sha256":"2ea2e531ad36c726097f1c35f06b8154039aec20bb6612968667b95f39d80635","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ea2e531ad36c726097f1c35f06b8154039aec20bb6612968667b95f39d80635","first_computed_at":"2026-07-04T15:09:36.789640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:09:36.789640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hq2g/LLIfVvnVsBh9Zt8V7y1h3qFFC/gFO4ztfndBAWIquVV1Qacr4MT3UzthVORLKWn1Z7rMFcmFKBa25/KDQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:09:36.790103Z","signed_message":"canonical_sha256_bytes"},"source_id":"0802.2418","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:166259f0e328f1bfabced3c597b971f81261c8cddd62331fcdd8f18a9163817f","sha256:a07f888d3f1b249e90f3abf4b68311dacfeeb114a1c6d5a55c321d11675d97b0"],"state_sha256":"7317e7bb1fb0ca5fb38505a1bee282a946895d62541e3e08ff06eccc6d82705a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j1nUx96cMPtFOwFIwcJgIhDyd1y3+CdFx0Jxpwcck8XmFZgVgjSLjZ77UGSLvO++K1LLsizKvL0Kzl1y1EOaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T09:06:36.960176Z","bundle_sha256":"69b5594cec53050b7704e0aadabfa5ab0d9d43e1dde3b119c80e72d930cd46ed"}}