{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:73OMAVH6FFANRX7W5SBBBDKTNS","short_pith_number":"pith:73OMAVH6","canonical_record":{"source":{"id":"1508.07820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-31T13:33:36Z","cross_cats_sorted":[],"title_canon_sha256":"8da095c459b84b1df1b1b886a99fa550c0b2318730824f91f1e0d6a93e221d00","abstract_canon_sha256":"ebee796ba0de80edf9c24a8107c032ec5bbf9cb6e0cc65a9a91464e4c78642ac"},"schema_version":"1.0"},"canonical_sha256":"fedcc054fe2940d8dff6ec82108d536cb46cedcdbfb7586d4957d5066e76ea79","source":{"kind":"arxiv","id":"1508.07820","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07820","created_at":"2026-05-18T01:28:25Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07820v2","created_at":"2026-05-18T01:28:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07820","created_at":"2026-05-18T01:28:25Z"},{"alias_kind":"pith_short_12","alias_value":"73OMAVH6FFAN","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"73OMAVH6FFANRX7W","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"73OMAVH6","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:73OMAVH6FFANRX7W5SBBBDKTNS","target":"record","payload":{"canonical_record":{"source":{"id":"1508.07820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-31T13:33:36Z","cross_cats_sorted":[],"title_canon_sha256":"8da095c459b84b1df1b1b886a99fa550c0b2318730824f91f1e0d6a93e221d00","abstract_canon_sha256":"ebee796ba0de80edf9c24a8107c032ec5bbf9cb6e0cc65a9a91464e4c78642ac"},"schema_version":"1.0"},"canonical_sha256":"fedcc054fe2940d8dff6ec82108d536cb46cedcdbfb7586d4957d5066e76ea79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:25.158061Z","signature_b64":"mNVFkQcMCJljA5zL2/aLsUlimafvouaaHYyAiFBJIkajSbMRVVCh+/WPpZrrXwAo81Z97YQXnXVHJpfzL8BFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fedcc054fe2940d8dff6ec82108d536cb46cedcdbfb7586d4957d5066e76ea79","last_reissued_at":"2026-05-18T01:28:25.157401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:25.157401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.07820","source_version":2,"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-18T01:28:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h8eGVi2jpFVB3IY1+Ocn53JB8xHJ0RVEDPbz96CvnAlrlrNfItm1m5dlvtH+5qZVx9hTyHu+8sIiox4V09WrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:28:19.818828Z"},"content_sha256":"18191e4c1048ea3e0cd78a46ee2e040d208c531955d993dea664fa471f79f7f7","schema_version":"1.0","event_id":"sha256:18191e4c1048ea3e0cd78a46ee2e040d208c531955d993dea664fa471f79f7f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:73OMAVH6FFANRX7W5SBBBDKTNS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interval scheduling maximizing minimum coverage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru Tomescu, Daniel Valenzuela, Valeria Staneva, Veli M\\\"akinen","submitted_at":"2015-08-31T13:33:36Z","abstract_excerpt":"In the classical interval scheduling type of problems, a set of $n$ jobs, characterized by their start and end time, need to be executed by a set of machines, under various constraints. In this paper we study a new variant in which the jobs need to be assigned to at most $k$ identical machines, such that the minimum number of machines that are busy at the same time is maximized. This is relevant in the context of genome sequencing and haplotyping, specifically when a set of DNA reads aligned to a genome needs to be pruned so that no more than $k$ reads overlap, while maintaining as much read c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07820","kind":"arxiv","version":2},"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-18T01:28:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+O57NCFzzhIkjTM1Pj1Th6gEUPmQPU91dUaubuIcv8BgptC/GSuJ08NNOI0QqsS2zIa27b9CIklOvQ9wQaclBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:28:19.819183Z"},"content_sha256":"68f8e33432d7a0db9e02ec55d22123314e564e3f98be73c0c928c86b645d48c9","schema_version":"1.0","event_id":"sha256:68f8e33432d7a0db9e02ec55d22123314e564e3f98be73c0c928c86b645d48c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73OMAVH6FFANRX7W5SBBBDKTNS/bundle.json","state_url":"https://pith.science/pith/73OMAVH6FFANRX7W5SBBBDKTNS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73OMAVH6FFANRX7W5SBBBDKTNS/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-31T00:28:19Z","links":{"resolver":"https://pith.science/pith/73OMAVH6FFANRX7W5SBBBDKTNS","bundle":"https://pith.science/pith/73OMAVH6FFANRX7W5SBBBDKTNS/bundle.json","state":"https://pith.science/pith/73OMAVH6FFANRX7W5SBBBDKTNS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73OMAVH6FFANRX7W5SBBBDKTNS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:73OMAVH6FFANRX7W5SBBBDKTNS","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":"ebee796ba0de80edf9c24a8107c032ec5bbf9cb6e0cc65a9a91464e4c78642ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-31T13:33:36Z","title_canon_sha256":"8da095c459b84b1df1b1b886a99fa550c0b2318730824f91f1e0d6a93e221d00"},"schema_version":"1.0","source":{"id":"1508.07820","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.07820","created_at":"2026-05-18T01:28:25Z"},{"alias_kind":"arxiv_version","alias_value":"1508.07820v2","created_at":"2026-05-18T01:28:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07820","created_at":"2026-05-18T01:28:25Z"},{"alias_kind":"pith_short_12","alias_value":"73OMAVH6FFAN","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"73OMAVH6FFANRX7W","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"73OMAVH6","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:68f8e33432d7a0db9e02ec55d22123314e564e3f98be73c0c928c86b645d48c9","target":"graph","created_at":"2026-05-18T01:28:25Z","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 the classical interval scheduling type of problems, a set of $n$ jobs, characterized by their start and end time, need to be executed by a set of machines, under various constraints. In this paper we study a new variant in which the jobs need to be assigned to at most $k$ identical machines, such that the minimum number of machines that are busy at the same time is maximized. This is relevant in the context of genome sequencing and haplotyping, specifically when a set of DNA reads aligned to a genome needs to be pruned so that no more than $k$ reads overlap, while maintaining as much read c","authors_text":"Alexandru Tomescu, Daniel Valenzuela, Valeria Staneva, Veli M\\\"akinen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-31T13:33:36Z","title":"Interval scheduling maximizing minimum coverage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07820","kind":"arxiv","version":2},"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:18191e4c1048ea3e0cd78a46ee2e040d208c531955d993dea664fa471f79f7f7","target":"record","created_at":"2026-05-18T01:28:25Z","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":"ebee796ba0de80edf9c24a8107c032ec5bbf9cb6e0cc65a9a91464e4c78642ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-31T13:33:36Z","title_canon_sha256":"8da095c459b84b1df1b1b886a99fa550c0b2318730824f91f1e0d6a93e221d00"},"schema_version":"1.0","source":{"id":"1508.07820","kind":"arxiv","version":2}},"canonical_sha256":"fedcc054fe2940d8dff6ec82108d536cb46cedcdbfb7586d4957d5066e76ea79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fedcc054fe2940d8dff6ec82108d536cb46cedcdbfb7586d4957d5066e76ea79","first_computed_at":"2026-05-18T01:28:25.157401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:25.157401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mNVFkQcMCJljA5zL2/aLsUlimafvouaaHYyAiFBJIkajSbMRVVCh+/WPpZrrXwAo81Z97YQXnXVHJpfzL8BFAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:25.158061Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.07820","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18191e4c1048ea3e0cd78a46ee2e040d208c531955d993dea664fa471f79f7f7","sha256:68f8e33432d7a0db9e02ec55d22123314e564e3f98be73c0c928c86b645d48c9"],"state_sha256":"0ec30b6f65a15aa523b93065aa1fde804495280d89a0d185f67747fbaba7a78c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1GqSBuLp7+pPBbUxoqi6KNuN2B6AgvG56xgD7eK6lKAjQX90OzGuHEJF0hbnpGPIm/P7rgrK8cqNYVgYPyrHAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:28:19.821310Z","bundle_sha256":"db8e8da2d766324818a4d1a04c1b28ffe38aa62e7694dff790d698200c009728"}}