{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5BYJ2SCVENPNRO3L3DFX7A5WFZ","short_pith_number":"pith:5BYJ2SCV","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"},"canonical_sha256":"e8709d4855235ed8bb6bd8cb7f83b62e621cc015859c43e760204cbbf99617ed","source":{"kind":"arxiv","id":"1805.05436","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05436","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05436v1","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05436","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"5BYJ2SCVENPN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5BYJ2SCVENPNRO3L","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5BYJ2SCV","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5BYJ2SCVENPNRO3L3DFX7A5WFZ","target":"record","payload":{"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"},"canonical_sha256":"e8709d4855235ed8bb6bd8cb7f83b62e621cc015859c43e760204cbbf99617ed","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"},"source_kind":"arxiv","source_id":"1805.05436","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-18T00:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BjfZOtyrSaGGjs+ib26xoE2pt5zgShPr4rx0qvbwfTWcimMMEhonQ/GJ3VI+twmnmBSkWJFNITxnprOjthU5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:12:38.236645Z"},"content_sha256":"ee5490c9cd538d5e38eb7bc96b86118d0a594573a0df532f19cb0f1f8d3996fe","schema_version":"1.0","event_id":"sha256:ee5490c9cd538d5e38eb7bc96b86118d0a594573a0df532f19cb0f1f8d3996fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5BYJ2SCVENPNRO3L3DFX7A5WFZ","target":"graph","payload":{"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"},"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-18T00:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bQF/8SDH2zw+VyBoJCOrL1z6gqz+LLhDCEoB0uMD+Tg1go7ylHLLhSknORUXImshydxBCRiEdonuql0VT7IWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:12:38.236999Z"},"content_sha256":"dd51d54fc9b6f10cca41093b8c14ef31fce661e4d16e9d913fe7be903e2b1c97","schema_version":"1.0","event_id":"sha256:dd51d54fc9b6f10cca41093b8c14ef31fce661e4d16e9d913fe7be903e2b1c97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ/bundle.json","state_url":"https://pith.science/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ/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-06-02T01:12:38Z","links":{"resolver":"https://pith.science/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ","bundle":"https://pith.science/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ/bundle.json","state":"https://pith.science/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BYJ2SCVENPNRO3L3DFX7A5WFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5BYJ2SCVENPNRO3L3DFX7A5WFZ","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":"cfd16e6b7748acef7a7ed42a5d14ffddf1b98eb43c121502dfaff7b3ce9e34ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-14T20:48:32Z","title_canon_sha256":"095d396fb839b08fc89232a01c462ffe50c90d402a24b7beaff5f3662e8ea3de"},"schema_version":"1.0","source":{"id":"1805.05436","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05436","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05436v1","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05436","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"5BYJ2SCVENPN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5BYJ2SCVENPNRO3L","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5BYJ2SCV","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:dd51d54fc9b6f10cca41093b8c14ef31fce661e4d16e9d913fe7be903e2b1c97","target":"graph","created_at":"2026-05-18T00:16:02Z","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":"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 ","authors_text":"Koji M. Kobayashi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-14T20:48:32Z","title":"Online interval scheduling to maximize total satisfaction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05436","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:ee5490c9cd538d5e38eb7bc96b86118d0a594573a0df532f19cb0f1f8d3996fe","target":"record","created_at":"2026-05-18T00:16:02Z","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":"cfd16e6b7748acef7a7ed42a5d14ffddf1b98eb43c121502dfaff7b3ce9e34ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-14T20:48:32Z","title_canon_sha256":"095d396fb839b08fc89232a01c462ffe50c90d402a24b7beaff5f3662e8ea3de"},"schema_version":"1.0","source":{"id":"1805.05436","kind":"arxiv","version":1}},"canonical_sha256":"e8709d4855235ed8bb6bd8cb7f83b62e621cc015859c43e760204cbbf99617ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8709d4855235ed8bb6bd8cb7f83b62e621cc015859c43e760204cbbf99617ed","first_computed_at":"2026-05-18T00:16:02.317903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:02.317903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RsPVgc+RzvtvXP7f7TPZG3WdWmAfKmnD5FDOPiWU5O3KcIX/lHxxCUg1qY/ugZ40/zQ4GrulCos55iklfTv/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:02.318439Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05436","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee5490c9cd538d5e38eb7bc96b86118d0a594573a0df532f19cb0f1f8d3996fe","sha256:dd51d54fc9b6f10cca41093b8c14ef31fce661e4d16e9d913fe7be903e2b1c97"],"state_sha256":"0eeba1e58efa2b8765dd9388c8b2d68d0ad00bc5da1252295756616bba026c86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MkWinZfvw0aTUqwSJC7UDFLkJT3S+VhDoHmn9/MX10AwCcufmBX4DrPkRqc2DILwP3hqPvCfmjoEXXW8X8lGDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:12:38.238978Z","bundle_sha256":"10dffc6e6f7e4d5adda93e179d0a10b5c91d7c36d8bc8d6f6bd7d4f56105b7c1"}}