{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VMZMDLQ4FVFKNKEIV3Y7DUTH32","short_pith_number":"pith:VMZMDLQ4","schema_version":"1.0","canonical_sha256":"ab32c1ae1c2d4aa6a888aef1f1d267deb55df7c1de5d80689f0b2c91a2194bef","source":{"kind":"arxiv","id":"1407.7998","version":3},"attestation_state":"computed","paper":{"title":"New Results on Online Resource Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kevin Schewior, Lin Chen, Nicole Megow","submitted_at":"2014-07-30T11:03:11Z","abstract_excerpt":"We consider the online resource minimization problem in which jobs with hard deadlines arrive online over time at their release dates. The task is to determine a feasible schedule on a minimum number of machines. We rigorously study this problem and derive various algorithms with small constant competitive ratios for interesting restricted problem variants. As the most important special case, we consider scheduling jobs with agreeable deadlines. We provide the first constant ratio competitive algorithm for the non-preemptive setting, which is of particular interest with regard to the known str"},"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":"1407.7998","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-30T11:03:11Z","cross_cats_sorted":[],"title_canon_sha256":"2a83485a87fde4858a354e1034d0f2cb1afcd65b753c0c12c9f4c92770411e94","abstract_canon_sha256":"87853167f1c7695ccfade059d0672bd8af0d561f0fdc2881d03038cd4233f536"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:03.296508Z","signature_b64":"8uktf/xSdGEZXlcKyEWE7O8pNtqKoaTZi0uabtyHGXpRTHNM+oGXaYDLisTkPxQE4zghplGijhRObenIXYDfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab32c1ae1c2d4aa6a888aef1f1d267deb55df7c1de5d80689f0b2c91a2194bef","last_reissued_at":"2026-05-18T01:25:03.295745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:03.295745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Results on Online Resource Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kevin Schewior, Lin Chen, Nicole Megow","submitted_at":"2014-07-30T11:03:11Z","abstract_excerpt":"We consider the online resource minimization problem in which jobs with hard deadlines arrive online over time at their release dates. The task is to determine a feasible schedule on a minimum number of machines. We rigorously study this problem and derive various algorithms with small constant competitive ratios for interesting restricted problem variants. As the most important special case, we consider scheduling jobs with agreeable deadlines. We provide the first constant ratio competitive algorithm for the non-preemptive setting, which is of particular interest with regard to the known str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7998","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.7998","created_at":"2026-05-18T01:25:03.295865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7998v3","created_at":"2026-05-18T01:25:03.295865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7998","created_at":"2026-05-18T01:25:03.295865+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMZMDLQ4FVFK","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMZMDLQ4FVFKNKEI","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMZMDLQ4","created_at":"2026-05-18T12:28:54.890064+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/VMZMDLQ4FVFKNKEIV3Y7DUTH32","json":"https://pith.science/pith/VMZMDLQ4FVFKNKEIV3Y7DUTH32.json","graph_json":"https://pith.science/api/pith-number/VMZMDLQ4FVFKNKEIV3Y7DUTH32/graph.json","events_json":"https://pith.science/api/pith-number/VMZMDLQ4FVFKNKEIV3Y7DUTH32/events.json","paper":"https://pith.science/paper/VMZMDLQ4"},"agent_actions":{"view_html":"https://pith.science/pith/VMZMDLQ4FVFKNKEIV3Y7DUTH32","download_json":"https://pith.science/pith/VMZMDLQ4FVFKNKEIV3Y7DUTH32.json","view_paper":"https://pith.science/paper/VMZMDLQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7998&json=true","fetch_graph":"https://pith.science/api/pith-number/VMZMDLQ4FVFKNKEIV3Y7DUTH32/graph.json","fetch_events":"https://pith.science/api/pith-number/VMZMDLQ4FVFKNKEIV3Y7DUTH32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMZMDLQ4FVFKNKEIV3Y7DUTH32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMZMDLQ4FVFKNKEIV3Y7DUTH32/action/storage_attestation","attest_author":"https://pith.science/pith/VMZMDLQ4FVFKNKEIV3Y7DUTH32/action/author_attestation","sign_citation":"https://pith.science/pith/VMZMDLQ4FVFKNKEIV3Y7DUTH32/action/citation_signature","submit_replication":"https://pith.science/pith/VMZMDLQ4FVFKNKEIV3Y7DUTH32/action/replication_record"}},"created_at":"2026-05-18T01:25:03.295865+00:00","updated_at":"2026-05-18T01:25:03.295865+00:00"}