{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7TMLYKPTTTU5YB2C5RZ6CUCFL4","short_pith_number":"pith:7TMLYKPT","canonical_record":{"source":{"id":"2505.03349","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-06T09:18:09Z","cross_cats_sorted":[],"title_canon_sha256":"e411c738c8626bb3c219ee1675ab16c379a015ed482f925bf01add106909fb25","abstract_canon_sha256":"3955f9a9adce391c0aa532d3ee77a6471f97b59f89371271e6bd0b86d469d4ba"},"schema_version":"1.0"},"canonical_sha256":"fcd8bc29f39ce9dc0742ec73e150455f32f2854706c0e0fa423f57c1cfe1048a","source":{"kind":"arxiv","id":"2505.03349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.03349","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"arxiv_version","alias_value":"2505.03349v1","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03349","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"pith_short_12","alias_value":"7TMLYKPTTTU5","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"pith_short_16","alias_value":"7TMLYKPTTTU5YB2C","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"pith_short_8","alias_value":"7TMLYKPT","created_at":"2026-07-05T10:59:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7TMLYKPTTTU5YB2C5RZ6CUCFL4","target":"record","payload":{"canonical_record":{"source":{"id":"2505.03349","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-06T09:18:09Z","cross_cats_sorted":[],"title_canon_sha256":"e411c738c8626bb3c219ee1675ab16c379a015ed482f925bf01add106909fb25","abstract_canon_sha256":"3955f9a9adce391c0aa532d3ee77a6471f97b59f89371271e6bd0b86d469d4ba"},"schema_version":"1.0"},"canonical_sha256":"fcd8bc29f39ce9dc0742ec73e150455f32f2854706c0e0fa423f57c1cfe1048a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:14.397573Z","signature_b64":"lzgWW5OALKlF8S5Wj0bDPIVuO3O0W9t/4kyn6nDfdhrYoqpTP7zwDkye3clzHppo3UBbqICkAysgOy9Q3UegDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcd8bc29f39ce9dc0742ec73e150455f32f2854706c0e0fa423f57c1cfe1048a","last_reissued_at":"2026-07-05T10:59:14.397041Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:14.397041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.03349","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-07-05T10:59:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+g/199jhIz9cfkxrXFPKYjAThuLhi7kE+QanzOsg5Nwnj7z4g0yeF64CYBNj+n9729TLddSXxHLlFcA4qnLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T11:04:14.129855Z"},"content_sha256":"00fc340fb723855a5880b63e654bb11530bf911a0d473ef4eede08842986f377","schema_version":"1.0","event_id":"sha256:00fc340fb723855a5880b63e654bb11530bf911a0d473ef4eede08842986f377"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7TMLYKPTTTU5YB2C5RZ6CUCFL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic scheduling with Bernoulli-type jobs through policy stratification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antonios Antoniadis, Kevin Schewior, Marc Uetz, Ruben Hoeksma","submitted_at":"2025-05-06T09:18:09Z","abstract_excerpt":"This paper addresses the problem of computing a scheduling policy that minimizes the total expected completion time of a set of $N$ jobs with stochastic processing times on $m$ parallel identical machines. When all processing times follow Bernoulli-type distributions, Gupta et al. (SODA '23) exhibited approximation algorithms with an approximation guarantee $\\tilde{\\text{O}}(\\sqrt{m})$, where $m$ is the number of machines and $\\tilde{\\text{O}}(\\cdot)$ suppresses polylogarithmic factors in $N$, improving upon an earlier ${\\text{O}}(m)$ approximation by Eberle et al. (OR Letters '19) for a speci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.03349","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.03349/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-05T10:59:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9IDYXVMaIdZbcSDrjAiJ9EXXMyOQw6DPVDvW8cKyMvyZn6rAxCAfKVHfRjbW8I/23PCLcM+2bFWZ63DpGzvwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T11:04:14.130391Z"},"content_sha256":"99f1db6e0dcc429a5db3aae27d9e4b32bd8ca532e0e6a81c60eb66f571349daf","schema_version":"1.0","event_id":"sha256:99f1db6e0dcc429a5db3aae27d9e4b32bd8ca532e0e6a81c60eb66f571349daf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7TMLYKPTTTU5YB2C5RZ6CUCFL4/bundle.json","state_url":"https://pith.science/pith/7TMLYKPTTTU5YB2C5RZ6CUCFL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7TMLYKPTTTU5YB2C5RZ6CUCFL4/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-15T11:04:14Z","links":{"resolver":"https://pith.science/pith/7TMLYKPTTTU5YB2C5RZ6CUCFL4","bundle":"https://pith.science/pith/7TMLYKPTTTU5YB2C5RZ6CUCFL4/bundle.json","state":"https://pith.science/pith/7TMLYKPTTTU5YB2C5RZ6CUCFL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7TMLYKPTTTU5YB2C5RZ6CUCFL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7TMLYKPTTTU5YB2C5RZ6CUCFL4","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":"3955f9a9adce391c0aa532d3ee77a6471f97b59f89371271e6bd0b86d469d4ba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-06T09:18:09Z","title_canon_sha256":"e411c738c8626bb3c219ee1675ab16c379a015ed482f925bf01add106909fb25"},"schema_version":"1.0","source":{"id":"2505.03349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.03349","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"arxiv_version","alias_value":"2505.03349v1","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.03349","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"pith_short_12","alias_value":"7TMLYKPTTTU5","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"pith_short_16","alias_value":"7TMLYKPTTTU5YB2C","created_at":"2026-07-05T10:59:14Z"},{"alias_kind":"pith_short_8","alias_value":"7TMLYKPT","created_at":"2026-07-05T10:59:14Z"}],"graph_snapshots":[{"event_id":"sha256:99f1db6e0dcc429a5db3aae27d9e4b32bd8ca532e0e6a81c60eb66f571349daf","target":"graph","created_at":"2026-07-05T10:59:14Z","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/2505.03349/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper addresses the problem of computing a scheduling policy that minimizes the total expected completion time of a set of $N$ jobs with stochastic processing times on $m$ parallel identical machines. When all processing times follow Bernoulli-type distributions, Gupta et al. (SODA '23) exhibited approximation algorithms with an approximation guarantee $\\tilde{\\text{O}}(\\sqrt{m})$, where $m$ is the number of machines and $\\tilde{\\text{O}}(\\cdot)$ suppresses polylogarithmic factors in $N$, improving upon an earlier ${\\text{O}}(m)$ approximation by Eberle et al. (OR Letters '19) for a speci","authors_text":"Antonios Antoniadis, Kevin Schewior, Marc Uetz, Ruben Hoeksma","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-06T09:18:09Z","title":"Stochastic scheduling with Bernoulli-type jobs through policy stratification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.03349","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:00fc340fb723855a5880b63e654bb11530bf911a0d473ef4eede08842986f377","target":"record","created_at":"2026-07-05T10:59:14Z","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":"3955f9a9adce391c0aa532d3ee77a6471f97b59f89371271e6bd0b86d469d4ba","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-06T09:18:09Z","title_canon_sha256":"e411c738c8626bb3c219ee1675ab16c379a015ed482f925bf01add106909fb25"},"schema_version":"1.0","source":{"id":"2505.03349","kind":"arxiv","version":1}},"canonical_sha256":"fcd8bc29f39ce9dc0742ec73e150455f32f2854706c0e0fa423f57c1cfe1048a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcd8bc29f39ce9dc0742ec73e150455f32f2854706c0e0fa423f57c1cfe1048a","first_computed_at":"2026-07-05T10:59:14.397041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:59:14.397041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lzgWW5OALKlF8S5Wj0bDPIVuO3O0W9t/4kyn6nDfdhrYoqpTP7zwDkye3clzHppo3UBbqICkAysgOy9Q3UegDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:59:14.397573Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.03349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00fc340fb723855a5880b63e654bb11530bf911a0d473ef4eede08842986f377","sha256:99f1db6e0dcc429a5db3aae27d9e4b32bd8ca532e0e6a81c60eb66f571349daf"],"state_sha256":"b52489912ec8609c732aef6824b7a0c471346b08bb01ebff166453b36c00702a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8d/Us0UhGWikTOSlyYzuXcOk/3oiqvoVZIcRff895Ip5mApGTeDUiHvDQRZFDOkdN3dFr/zx8N2joMfLL19fBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T11:04:14.134108Z","bundle_sha256":"2c5d363e1239716e022ba611229fd9f98335a33026d1c506bba025c5ba964804"}}