{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SVWVJL3E3KCV2UGJGJFEWEFINZ","short_pith_number":"pith:SVWVJL3E","schema_version":"1.0","canonical_sha256":"956d54af64da855d50c9324a4b10a86e6bec853a5015694f499f8f894a8b16cc","source":{"kind":"arxiv","id":"1305.6555","version":1},"attestation_state":"computed","paper":{"title":"Reallocation Problems in Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jeremy T. Fineman, Martin Farach-Colton, Michael A. Bender, S\\'andor P. Fekete, Seth Gilbert","submitted_at":"2013-05-28T16:34:44Z","abstract_excerpt":"In traditional on-line problems, such as scheduling, requests arrive over time, demanding available resources. As each request arrives, some resources may have to be irrevocably committed to servicing that request. In many situations, however, it may be possible or even necessary to reallocate previously allocated resources in order to satisfy a new request. This reallocation has a cost. This paper shows how to service the requests while minimizing the reallocation cost. We focus on the classic problem of scheduling jobs on a multiprocessor system. Each unit-size job has a time window in which"},"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":"1305.6555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-28T16:34:44Z","cross_cats_sorted":[],"title_canon_sha256":"3bb0797ccb7bc9f23114f0af7265ddfa1ab91123bc03629f97ff3fe27def24e0","abstract_canon_sha256":"e47165f075b546f7e385eb3c31ac536fccb03d79bc8be5fdcf65fdd55839fefe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:40.447609Z","signature_b64":"XQJRu6BlffJj0SihNlMrBmlfgSPuSPYdGGGB0LEKeWidXBApA11ILHsrYONOWO5ErRbQ4dPJ1Df70tKGj74hAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"956d54af64da855d50c9324a4b10a86e6bec853a5015694f499f8f894a8b16cc","last_reissued_at":"2026-05-18T03:24:40.446976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:40.446976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reallocation Problems in Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jeremy T. Fineman, Martin Farach-Colton, Michael A. Bender, S\\'andor P. Fekete, Seth Gilbert","submitted_at":"2013-05-28T16:34:44Z","abstract_excerpt":"In traditional on-line problems, such as scheduling, requests arrive over time, demanding available resources. As each request arrives, some resources may have to be irrevocably committed to servicing that request. In many situations, however, it may be possible or even necessary to reallocate previously allocated resources in order to satisfy a new request. This reallocation has a cost. This paper shows how to service the requests while minimizing the reallocation cost. We focus on the classic problem of scheduling jobs on a multiprocessor system. Each unit-size job has a time window in which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6555","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":"1305.6555","created_at":"2026-05-18T03:24:40.447080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.6555v1","created_at":"2026-05-18T03:24:40.447080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6555","created_at":"2026-05-18T03:24:40.447080+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVWVJL3E3KCV","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVWVJL3E3KCV2UGJ","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVWVJL3E","created_at":"2026-05-18T12:27:59.945178+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/SVWVJL3E3KCV2UGJGJFEWEFINZ","json":"https://pith.science/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ.json","graph_json":"https://pith.science/api/pith-number/SVWVJL3E3KCV2UGJGJFEWEFINZ/graph.json","events_json":"https://pith.science/api/pith-number/SVWVJL3E3KCV2UGJGJFEWEFINZ/events.json","paper":"https://pith.science/paper/SVWVJL3E"},"agent_actions":{"view_html":"https://pith.science/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ","download_json":"https://pith.science/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ.json","view_paper":"https://pith.science/paper/SVWVJL3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.6555&json=true","fetch_graph":"https://pith.science/api/pith-number/SVWVJL3E3KCV2UGJGJFEWEFINZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SVWVJL3E3KCV2UGJGJFEWEFINZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ/action/storage_attestation","attest_author":"https://pith.science/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ/action/author_attestation","sign_citation":"https://pith.science/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ/action/citation_signature","submit_replication":"https://pith.science/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ/action/replication_record"}},"created_at":"2026-05-18T03:24:40.447080+00:00","updated_at":"2026-05-18T03:24:40.447080+00:00"}