{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5BYJ2SCVENPNRO3L3DFX7A5WFZ","short_pith_number":"pith:5BYJ2SCV","schema_version":"1.0","canonical_sha256":"e8709d4855235ed8bb6bd8cb7f83b62e621cc015859c43e760204cbbf99617ed","source":{"kind":"arxiv","id":"1805.05436","version":1},"attestation_state":"computed","paper":{"title":"Online interval scheduling to maximize total satisfaction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Koji M. Kobayashi","submitted_at":"2018-05-14T20:48:32Z","abstract_excerpt":"The interval scheduling problem is one variant of the scheduling problem. In this paper, we propose a novel variant of the interval scheduling problem, whose definition is as follows: given jobs are specified by their {\\em release times}, {\\em deadlines} and {\\em profits}. An algorithm must start a job at its release time on one of $m$ identical machines, and continue processing until its deadline on the machine to complete the job. All the jobs must be completed and the algorithm can obtain the profit of a completed job as a user's satisfaction. It is possible to process more than one job at "},"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":"1805.05436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-14T20:48:32Z","cross_cats_sorted":[],"title_canon_sha256":"095d396fb839b08fc89232a01c462ffe50c90d402a24b7beaff5f3662e8ea3de","abstract_canon_sha256":"cfd16e6b7748acef7a7ed42a5d14ffddf1b98eb43c121502dfaff7b3ce9e34ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:02.318439Z","signature_b64":"RsPVgc+RzvtvXP7f7TPZG3WdWmAfKmnD5FDOPiWU5O3KcIX/lHxxCUg1qY/ugZ40/zQ4GrulCos55iklfTv/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8709d4855235ed8bb6bd8cb7f83b62e621cc015859c43e760204cbbf99617ed","last_reissued_at":"2026-05-18T00:16:02.317903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:02.317903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online interval scheduling to maximize total satisfaction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Koji M. Kobayashi","submitted_at":"2018-05-14T20:48:32Z","abstract_excerpt":"The interval scheduling problem is one variant of the scheduling problem. In this paper, we propose a novel variant of the interval scheduling problem, whose definition is as follows: given jobs are specified by their {\\em release times}, {\\em deadlines} and {\\em profits}. An algorithm must start a job at its release time on one of $m$ identical machines, and continue processing until its deadline on the machine to complete the job. All the jobs must be completed and the algorithm can obtain the profit of a completed job as a user's satisfaction. It is possible to process more than one job at "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05436","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":"1805.05436","created_at":"2026-05-18T00:16:02.317996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.05436v1","created_at":"2026-05-18T00:16:02.317996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05436","created_at":"2026-05-18T00:16:02.317996+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BYJ2SCVENPN","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BYJ2SCVENPNRO3L","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BYJ2SCV","created_at":"2026-05-18T12:32:08.215937+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/5BYJ2SCVENPNRO3L3DFX7A5WFZ","json":"https://pith.science/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ.json","graph_json":"https://pith.science/api/pith-number/5BYJ2SCVENPNRO3L3DFX7A5WFZ/graph.json","events_json":"https://pith.science/api/pith-number/5BYJ2SCVENPNRO3L3DFX7A5WFZ/events.json","paper":"https://pith.science/paper/5BYJ2SCV"},"agent_actions":{"view_html":"https://pith.science/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ","download_json":"https://pith.science/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ.json","view_paper":"https://pith.science/paper/5BYJ2SCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.05436&json=true","fetch_graph":"https://pith.science/api/pith-number/5BYJ2SCVENPNRO3L3DFX7A5WFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/5BYJ2SCVENPNRO3L3DFX7A5WFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ/action/storage_attestation","attest_author":"https://pith.science/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ/action/author_attestation","sign_citation":"https://pith.science/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ/action/citation_signature","submit_replication":"https://pith.science/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ/action/replication_record"}},"created_at":"2026-05-18T00:16:02.317996+00:00","updated_at":"2026-05-18T00:16:02.317996+00:00"}