{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:I5UYV7GVEOQT276WHGLF4VKEMI","short_pith_number":"pith:I5UYV7GV","schema_version":"1.0","canonical_sha256":"47698afcd523a13d7fd639965e554462385058fbe432351cf0fcc4dba686b16d","source":{"kind":"arxiv","id":"2606.25166","version":1},"attestation_state":"computed","paper":{"title":"Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas S. Schulz, Felix Buld","submitted_at":"2026-06-23T20:54:44Z","abstract_excerpt":"We study scheduling with testing on a single machine and on identical parallel machines to minimize the total \\emph{weighted} completion time in the adversarial model. In this setting, each job is equipped with a weight, an upper bound on its processing time, and a testing time. An algorithm can either execute a job for an amount of time equal to the upper bound or test it first to reveal a potentially lower processing time used to schedule the job later. We establish the first constant-competitive algorithms for this problem with job-dependent weights that reflect each job's relative importan"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.25166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-06-23T20:54:44Z","cross_cats_sorted":[],"title_canon_sha256":"ca87c5261a2e4e938b6b9c5dc1430a4072992ee10fd83397d5c1f54810673d00","abstract_canon_sha256":"cafb945b37b520292ec6d19ab30fda88be609c06dd38e3c6888839d9fc266871"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T00:18:19.793741Z","signature_b64":"LV4l+MmNxU0Fbuo1rTwQnXXMfR4Zf5f1u1W2RDh0vUjPSY2s5zNZtYJ0k5iOCJ3LPRP4V39thT58Ht9trpj2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47698afcd523a13d7fd639965e554462385058fbe432351cf0fcc4dba686b16d","last_reissued_at":"2026-06-25T00:18:19.793358Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T00:18:19.793358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas S. Schulz, Felix Buld","submitted_at":"2026-06-23T20:54:44Z","abstract_excerpt":"We study scheduling with testing on a single machine and on identical parallel machines to minimize the total \\emph{weighted} completion time in the adversarial model. In this setting, each job is equipped with a weight, an upper bound on its processing time, and a testing time. An algorithm can either execute a job for an amount of time equal to the upper bound or test it first to reveal a potentially lower processing time used to schedule the job later. We establish the first constant-competitive algorithms for this problem with job-dependent weights that reflect each job's relative importan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.25166","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.25166/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.25166","created_at":"2026-06-25T00:18:19.793420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.25166v1","created_at":"2026-06-25T00:18:19.793420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.25166","created_at":"2026-06-25T00:18:19.793420+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5UYV7GVEOQT","created_at":"2026-06-25T00:18:19.793420+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5UYV7GVEOQT276W","created_at":"2026-06-25T00:18:19.793420+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5UYV7GV","created_at":"2026-06-25T00:18:19.793420+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I5UYV7GVEOQT276WHGLF4VKEMI","json":"https://pith.science/pith/I5UYV7GVEOQT276WHGLF4VKEMI.json","graph_json":"https://pith.science/api/pith-number/I5UYV7GVEOQT276WHGLF4VKEMI/graph.json","events_json":"https://pith.science/api/pith-number/I5UYV7GVEOQT276WHGLF4VKEMI/events.json","paper":"https://pith.science/paper/I5UYV7GV"},"agent_actions":{"view_html":"https://pith.science/pith/I5UYV7GVEOQT276WHGLF4VKEMI","download_json":"https://pith.science/pith/I5UYV7GVEOQT276WHGLF4VKEMI.json","view_paper":"https://pith.science/paper/I5UYV7GV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.25166&json=true","fetch_graph":"https://pith.science/api/pith-number/I5UYV7GVEOQT276WHGLF4VKEMI/graph.json","fetch_events":"https://pith.science/api/pith-number/I5UYV7GVEOQT276WHGLF4VKEMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5UYV7GVEOQT276WHGLF4VKEMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5UYV7GVEOQT276WHGLF4VKEMI/action/storage_attestation","attest_author":"https://pith.science/pith/I5UYV7GVEOQT276WHGLF4VKEMI/action/author_attestation","sign_citation":"https://pith.science/pith/I5UYV7GVEOQT276WHGLF4VKEMI/action/citation_signature","submit_replication":"https://pith.science/pith/I5UYV7GVEOQT276WHGLF4VKEMI/action/replication_record"}},"created_at":"2026-06-25T00:18:19.793420+00:00","updated_at":"2026-06-25T00:18:19.793420+00:00"}