{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IYXIE5VUVQWDKHPEW5QU3DIBI7","short_pith_number":"pith:IYXIE5VU","schema_version":"1.0","canonical_sha256":"462e8276b4ac2c351de4b7614d8d0147eb5e260fc3b538fbf6a0b5fe91ab6efc","source":{"kind":"arxiv","id":"1605.04982","version":1},"attestation_state":"computed","paper":{"title":"Flexible Resource Allocation for Clouds and All-Optical Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baruch Schieber, Dmitriy Katz, Hadas Shachnai","submitted_at":"2016-05-16T23:17:06Z","abstract_excerpt":"Motivated by the cloud computing paradigm, and by key optimization problems in all-optical networks, we study two variants of the classic job interval scheduling problem, where a reusable resource is allocated to competing job intervals in a flexible manner. Each job, $J_i$, requires the use of up to $r_{max}(i)$ units of the resource, with a profit of $p_i \\geq 1$ accrued for each allocated unit. The goal is to feasibly schedule a subset of the jobs so as to maximize the total profit. The resource can be allocated either in contiguous or non-contiguous blocks. These problems can be viewed as "},"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":"1605.04982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-16T23:17:06Z","cross_cats_sorted":[],"title_canon_sha256":"f74ce724c6492ef0b2d51301df418b9277bfa309fa7544f1afa1f897f563e362","abstract_canon_sha256":"a7c63ed089e3a2447f2488a0d50e7a8d84161c5fda4eafb8c2547ca4f13aaf22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:37.812075Z","signature_b64":"LPQuti2n0QAYMalRreI2OcvVFbocs0njCuNYx0XReMy54WmnzFetKaZ7FPpuFt8pGXI8kBBZMhmEzwXW7q/qDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"462e8276b4ac2c351de4b7614d8d0147eb5e260fc3b538fbf6a0b5fe91ab6efc","last_reissued_at":"2026-05-18T01:14:37.811385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:37.811385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flexible Resource Allocation for Clouds and All-Optical Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baruch Schieber, Dmitriy Katz, Hadas Shachnai","submitted_at":"2016-05-16T23:17:06Z","abstract_excerpt":"Motivated by the cloud computing paradigm, and by key optimization problems in all-optical networks, we study two variants of the classic job interval scheduling problem, where a reusable resource is allocated to competing job intervals in a flexible manner. Each job, $J_i$, requires the use of up to $r_{max}(i)$ units of the resource, with a profit of $p_i \\geq 1$ accrued for each allocated unit. The goal is to feasibly schedule a subset of the jobs so as to maximize the total profit. The resource can be allocated either in contiguous or non-contiguous blocks. These problems can be viewed as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04982","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":""},"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":"1605.04982","created_at":"2026-05-18T01:14:37.811484+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04982v1","created_at":"2026-05-18T01:14:37.811484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04982","created_at":"2026-05-18T01:14:37.811484+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYXIE5VUVQWD","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYXIE5VUVQWDKHPE","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYXIE5VU","created_at":"2026-05-18T12:30:22.444734+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/IYXIE5VUVQWDKHPEW5QU3DIBI7","json":"https://pith.science/pith/IYXIE5VUVQWDKHPEW5QU3DIBI7.json","graph_json":"https://pith.science/api/pith-number/IYXIE5VUVQWDKHPEW5QU3DIBI7/graph.json","events_json":"https://pith.science/api/pith-number/IYXIE5VUVQWDKHPEW5QU3DIBI7/events.json","paper":"https://pith.science/paper/IYXIE5VU"},"agent_actions":{"view_html":"https://pith.science/pith/IYXIE5VUVQWDKHPEW5QU3DIBI7","download_json":"https://pith.science/pith/IYXIE5VUVQWDKHPEW5QU3DIBI7.json","view_paper":"https://pith.science/paper/IYXIE5VU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04982&json=true","fetch_graph":"https://pith.science/api/pith-number/IYXIE5VUVQWDKHPEW5QU3DIBI7/graph.json","fetch_events":"https://pith.science/api/pith-number/IYXIE5VUVQWDKHPEW5QU3DIBI7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYXIE5VUVQWDKHPEW5QU3DIBI7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYXIE5VUVQWDKHPEW5QU3DIBI7/action/storage_attestation","attest_author":"https://pith.science/pith/IYXIE5VUVQWDKHPEW5QU3DIBI7/action/author_attestation","sign_citation":"https://pith.science/pith/IYXIE5VUVQWDKHPEW5QU3DIBI7/action/citation_signature","submit_replication":"https://pith.science/pith/IYXIE5VUVQWDKHPEW5QU3DIBI7/action/replication_record"}},"created_at":"2026-05-18T01:14:37.811484+00:00","updated_at":"2026-05-18T01:14:37.811484+00:00"}