{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SVWVJL3E3KCV2UGJGJFEWEFINZ","short_pith_number":"pith:SVWVJL3E","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"},"canonical_sha256":"956d54af64da855d50c9324a4b10a86e6bec853a5015694f499f8f894a8b16cc","source":{"kind":"arxiv","id":"1305.6555","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6555","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6555v1","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6555","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"SVWVJL3E3KCV","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SVWVJL3E3KCV2UGJ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SVWVJL3E","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SVWVJL3E3KCV2UGJGJFEWEFINZ","target":"record","payload":{"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"},"canonical_sha256":"956d54af64da855d50c9324a4b10a86e6bec853a5015694f499f8f894a8b16cc","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"},"source_kind":"arxiv","source_id":"1305.6555","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-05-18T03:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"plq42BzdAMUxC9PObAj8PcO5ocyCJZcZD3N3aJ4cHcE48oImTZflzLWIcbV2qDFepjcEHLShBW0reLNDtzzOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:29:07.579563Z"},"content_sha256":"7aed7f41318e3622d3ea9b642aca720a95d0a739c43ca9ae4d05d2079db005af","schema_version":"1.0","event_id":"sha256:7aed7f41318e3622d3ea9b642aca720a95d0a739c43ca9ae4d05d2079db005af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SVWVJL3E3KCV2UGJGJFEWEFINZ","target":"graph","payload":{"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"},"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-05-18T03:24:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VleO/ZjTqU+IIZJQjBs18t+cZZ3n42RVy+Y5aWypO4Cbth4BpxMPO6HtJyExpsPlr/m18Kk3gQ0BOpWGSLEJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:29:07.579911Z"},"content_sha256":"0486d339ddfb3e55670d02a51aada06b649a44d86b4bf5e08e368835ea96586e","schema_version":"1.0","event_id":"sha256:0486d339ddfb3e55670d02a51aada06b649a44d86b4bf5e08e368835ea96586e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ/bundle.json","state_url":"https://pith.science/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ/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-05-28T04:29:07Z","links":{"resolver":"https://pith.science/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ","bundle":"https://pith.science/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ/bundle.json","state":"https://pith.science/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SVWVJL3E3KCV2UGJGJFEWEFINZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SVWVJL3E3KCV2UGJGJFEWEFINZ","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":"e47165f075b546f7e385eb3c31ac536fccb03d79bc8be5fdcf65fdd55839fefe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-28T16:34:44Z","title_canon_sha256":"3bb0797ccb7bc9f23114f0af7265ddfa1ab91123bc03629f97ff3fe27def24e0"},"schema_version":"1.0","source":{"id":"1305.6555","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6555","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6555v1","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6555","created_at":"2026-05-18T03:24:40Z"},{"alias_kind":"pith_short_12","alias_value":"SVWVJL3E3KCV","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SVWVJL3E3KCV2UGJ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SVWVJL3E","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:0486d339ddfb3e55670d02a51aada06b649a44d86b4bf5e08e368835ea96586e","target":"graph","created_at":"2026-05-18T03:24:40Z","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"},"paper":{"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","authors_text":"Jeremy T. Fineman, Martin Farach-Colton, Michael A. Bender, S\\'andor P. Fekete, Seth Gilbert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-28T16:34:44Z","title":"Reallocation Problems in Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6555","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:7aed7f41318e3622d3ea9b642aca720a95d0a739c43ca9ae4d05d2079db005af","target":"record","created_at":"2026-05-18T03:24:40Z","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":"e47165f075b546f7e385eb3c31ac536fccb03d79bc8be5fdcf65fdd55839fefe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-28T16:34:44Z","title_canon_sha256":"3bb0797ccb7bc9f23114f0af7265ddfa1ab91123bc03629f97ff3fe27def24e0"},"schema_version":"1.0","source":{"id":"1305.6555","kind":"arxiv","version":1}},"canonical_sha256":"956d54af64da855d50c9324a4b10a86e6bec853a5015694f499f8f894a8b16cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"956d54af64da855d50c9324a4b10a86e6bec853a5015694f499f8f894a8b16cc","first_computed_at":"2026-05-18T03:24:40.446976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:24:40.446976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XQJRu6BlffJj0SihNlMrBmlfgSPuSPYdGGGB0LEKeWidXBApA11ILHsrYONOWO5ErRbQ4dPJ1Df70tKGj74hAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:24:40.447609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6555","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7aed7f41318e3622d3ea9b642aca720a95d0a739c43ca9ae4d05d2079db005af","sha256:0486d339ddfb3e55670d02a51aada06b649a44d86b4bf5e08e368835ea96586e"],"state_sha256":"6bd78124135fd6944b8bcec6aaf988b0bf89c8b2692eb8c611a8eb142cee3d5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mTRAaSJyqcqOmYpe0lP/B9fgkXStFbp0PDRql0PEX+1aZft1r1IoBxheSbv1w7oPI8NEWEaqKlWWUIyQ95zoAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:29:07.581897Z","bundle_sha256":"8e1a4cf9c869a48127cf6e0d5f0f7df688aee6e9ca195b40377fdd4eb3491baf"}}