{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UVR5Q6AZMBVEPLPCFUX2KAKHLS","short_pith_number":"pith:UVR5Q6AZ","canonical_record":{"source":{"id":"2606.02029","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-01T10:17:47Z","cross_cats_sorted":[],"title_canon_sha256":"dee412d63a974f25a3391e86b5291e916fe62ca63bccec4283e3391a672c2f01","abstract_canon_sha256":"7f46781d1c0259e7f4a482dc95d16bd47b358075f55934efe1b8287e77a00f12"},"schema_version":"1.0"},"canonical_sha256":"a563d87819606a47ade22d2fa501475cb8dd713438d3a38110bc4ae4ab489d3b","source":{"kind":"arxiv","id":"2606.02029","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02029","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02029v1","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02029","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"UVR5Q6AZMBVE","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"UVR5Q6AZMBVEPLPC","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"UVR5Q6AZ","created_at":"2026-06-02T02:05:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UVR5Q6AZMBVEPLPCFUX2KAKHLS","target":"record","payload":{"canonical_record":{"source":{"id":"2606.02029","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-01T10:17:47Z","cross_cats_sorted":[],"title_canon_sha256":"dee412d63a974f25a3391e86b5291e916fe62ca63bccec4283e3391a672c2f01","abstract_canon_sha256":"7f46781d1c0259e7f4a482dc95d16bd47b358075f55934efe1b8287e77a00f12"},"schema_version":"1.0"},"canonical_sha256":"a563d87819606a47ade22d2fa501475cb8dd713438d3a38110bc4ae4ab489d3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:05:03.958520Z","signature_b64":"2AZZwuFw0HW6Ji1UBZMxzHuAXKwJ1ArFtsaVfmjowHH9WnwOMNk9vd0oP4NARlLSEhdnzFq7M9vwghfjk1iGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a563d87819606a47ade22d2fa501475cb8dd713438d3a38110bc4ae4ab489d3b","last_reissued_at":"2026-06-02T02:05:03.957983Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:05:03.957983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.02029","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-06-02T02:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pFRWk46qFMzB83MhZ1slcTt/kplLEaWRhDG85TXxuF8cqkvWufnhesdJ3zjjn1oVkeJ7PJsFQxu+ay3yH5AlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T07:14:17.991286Z"},"content_sha256":"ad54c1aadb94887dcf57aa1840278f061b935b9d511c71ca7824af206a35ebb9","schema_version":"1.0","event_id":"sha256:ad54c1aadb94887dcf57aa1840278f061b935b9d511c71ca7824af206a35ebb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UVR5Q6AZMBVEPLPCFUX2KAKHLS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Completion-Threshold Framework for Obligatory-Test Scheduling on Multiple Machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kao-Chuan Liang, Ya-Chun Liang","submitted_at":"2026-06-01T10:17:47Z","abstract_excerpt":"We study online scheduling with obligatory testing on $m$ identical machines with the objective of minimizing the sum of completion times. In this model, every job must undergo a test before its actual processing time is revealed. Consequently, the central algorithmic challenge is no longer whether to acquire information, but how to optimally balance machine capacity between revealing unknown jobs and processing currently known ones. While this tradeoff becomes structurally richer in the multiple-machine setting, the only prior explicit deterministic lower bound for this objective was $\\sqrt{2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02029","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/2606.02029/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-06-02T02:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kPYtP+un5NzeTbi8T2mkU0ze/XpjL3xI3IIbog3BViJXVSVUsZTcmOr8pMIajglR0Rkw/IoukzvgGz/pDOZYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T07:14:17.991690Z"},"content_sha256":"b57b921f356c6ffaf1af33b212bddd19b448994bc73fcea892b98fa1a5412b68","schema_version":"1.0","event_id":"sha256:b57b921f356c6ffaf1af33b212bddd19b448994bc73fcea892b98fa1a5412b68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVR5Q6AZMBVEPLPCFUX2KAKHLS/bundle.json","state_url":"https://pith.science/pith/UVR5Q6AZMBVEPLPCFUX2KAKHLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVR5Q6AZMBVEPLPCFUX2KAKHLS/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-29T07:14:17Z","links":{"resolver":"https://pith.science/pith/UVR5Q6AZMBVEPLPCFUX2KAKHLS","bundle":"https://pith.science/pith/UVR5Q6AZMBVEPLPCFUX2KAKHLS/bundle.json","state":"https://pith.science/pith/UVR5Q6AZMBVEPLPCFUX2KAKHLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVR5Q6AZMBVEPLPCFUX2KAKHLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UVR5Q6AZMBVEPLPCFUX2KAKHLS","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":"7f46781d1c0259e7f4a482dc95d16bd47b358075f55934efe1b8287e77a00f12","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-01T10:17:47Z","title_canon_sha256":"dee412d63a974f25a3391e86b5291e916fe62ca63bccec4283e3391a672c2f01"},"schema_version":"1.0","source":{"id":"2606.02029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02029","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02029v1","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02029","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"UVR5Q6AZMBVE","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"UVR5Q6AZMBVEPLPC","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"UVR5Q6AZ","created_at":"2026-06-02T02:05:03Z"}],"graph_snapshots":[{"event_id":"sha256:b57b921f356c6ffaf1af33b212bddd19b448994bc73fcea892b98fa1a5412b68","target":"graph","created_at":"2026-06-02T02:05:03Z","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/2606.02029/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study online scheduling with obligatory testing on $m$ identical machines with the objective of minimizing the sum of completion times. In this model, every job must undergo a test before its actual processing time is revealed. Consequently, the central algorithmic challenge is no longer whether to acquire information, but how to optimally balance machine capacity between revealing unknown jobs and processing currently known ones. While this tradeoff becomes structurally richer in the multiple-machine setting, the only prior explicit deterministic lower bound for this objective was $\\sqrt{2","authors_text":"Kao-Chuan Liang, Ya-Chun Liang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-01T10:17:47Z","title":"The Completion-Threshold Framework for Obligatory-Test Scheduling on Multiple Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02029","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:ad54c1aadb94887dcf57aa1840278f061b935b9d511c71ca7824af206a35ebb9","target":"record","created_at":"2026-06-02T02:05:03Z","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":"7f46781d1c0259e7f4a482dc95d16bd47b358075f55934efe1b8287e77a00f12","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-01T10:17:47Z","title_canon_sha256":"dee412d63a974f25a3391e86b5291e916fe62ca63bccec4283e3391a672c2f01"},"schema_version":"1.0","source":{"id":"2606.02029","kind":"arxiv","version":1}},"canonical_sha256":"a563d87819606a47ade22d2fa501475cb8dd713438d3a38110bc4ae4ab489d3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a563d87819606a47ade22d2fa501475cb8dd713438d3a38110bc4ae4ab489d3b","first_computed_at":"2026-06-02T02:05:03.957983Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:05:03.957983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2AZZwuFw0HW6Ji1UBZMxzHuAXKwJ1ArFtsaVfmjowHH9WnwOMNk9vd0oP4NARlLSEhdnzFq7M9vwghfjk1iGBw==","signature_status":"signed_v1","signed_at":"2026-06-02T02:05:03.958520Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad54c1aadb94887dcf57aa1840278f061b935b9d511c71ca7824af206a35ebb9","sha256:b57b921f356c6ffaf1af33b212bddd19b448994bc73fcea892b98fa1a5412b68"],"state_sha256":"eb338b6622b7797c697cb7bdc1897b5bed76bfe78e71190fb8460fa2539343e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8l9HA5n45jIZn5jdmycrYsTrPCasrVD8PtfikiysJKL/qR4xSyn9Nbrfrr8D9t4Kyig8pTawB3sRXisRBC9zBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T07:14:17.993692Z","bundle_sha256":"6a7f878c377872c713e881c56d6332edd5977cafbc8ae062a4699077c0d1f8e6"}}