{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EDIDQMQ4E76L2TJESCGA4ME3RB","short_pith_number":"pith:EDIDQMQ4","canonical_record":{"source":{"id":"1412.8005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-27T00:23:47Z","cross_cats_sorted":[],"title_canon_sha256":"b661f4de351b3fd029e13fbf4daec8c81dd4361cdd02b0d69893b18ac9aa3b00","abstract_canon_sha256":"3b75902e40ad74deb427eea8044a044da73423f85ccfc423e19693094c58fed8"},"schema_version":"1.0"},"canonical_sha256":"20d038321c27fcbd4d24908c0e309b88502e0890016b8381f07671c33aedf494","source":{"kind":"arxiv","id":"1412.8005","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8005","created_at":"2026-05-18T02:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8005v1","created_at":"2026-05-18T02:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8005","created_at":"2026-05-18T02:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"EDIDQMQ4E76L","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EDIDQMQ4E76L2TJE","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EDIDQMQ4","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EDIDQMQ4E76L2TJESCGA4ME3RB","target":"record","payload":{"canonical_record":{"source":{"id":"1412.8005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-27T00:23:47Z","cross_cats_sorted":[],"title_canon_sha256":"b661f4de351b3fd029e13fbf4daec8c81dd4361cdd02b0d69893b18ac9aa3b00","abstract_canon_sha256":"3b75902e40ad74deb427eea8044a044da73423f85ccfc423e19693094c58fed8"},"schema_version":"1.0"},"canonical_sha256":"20d038321c27fcbd4d24908c0e309b88502e0890016b8381f07671c33aedf494","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:24.419013Z","signature_b64":"k1hjfxrw1rmChR/rf+AC128N7AyuH/2aHuh4Wf3XJf+USYEoQSxfHeFwupHOkNQqAbMC3YGoeRBwINMmDPMnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20d038321c27fcbd4d24908c0e309b88502e0890016b8381f07671c33aedf494","last_reissued_at":"2026-05-18T02:30:24.418535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:24.418535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.8005","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-18T02:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EmPdsvkU2WUuMQayVaive2gZFJ8b4B/YPVPFp7ZOsGYVwURuvqiIKrRsG9at7lw6p+FgSlM7N5yW1sjb0Cp+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:30:28.004754Z"},"content_sha256":"df97cdc35c3b94304d8bf82d3885965c9b1f68de7d9a66fce9f207321b4c8020","schema_version":"1.0","event_id":"sha256:df97cdc35c3b94304d8bf82d3885965c9b1f68de7d9a66fce9f207321b4c8020"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EDIDQMQ4E76L2TJESCGA4ME3RB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Algorithms for Interval Scheduling on a Single Machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alex Gavryushkin, Bakhadyr Khoussainov, Jiamou Liu, Mikhail Kokho","submitted_at":"2014-12-27T00:23:47Z","abstract_excerpt":"We investigate dynamic algorithms for the interval scheduling problem. Our algorithm runs in amortised time $O(\\log n)$ for query operation and $O(d\\log^2 n)$ for insertion and removal operations, where $n$ and $d$ are the maximal numbers of intervals and pairwise overlapping intervals respectively. We also show that for a monotonic set, that is when no interval properly contains another interval, the amortised complexity is $O(\\log n)$ for both query and update operations. We compare the two algorithms for the monotonic interval sets using experiments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8005","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-18T02:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9jSi6bb/nO3EXhAnTLtFsjlNi7TXVnogAxn0uHelYFGJCpxfWjsBomrc0Qolf/bQg3Db+b17990qSAal/ubmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:30:28.005738Z"},"content_sha256":"a322e5335f18a2637b851ca736ddae78f4ac53d7ad1723cc8c6a6eda146a7422","schema_version":"1.0","event_id":"sha256:a322e5335f18a2637b851ca736ddae78f4ac53d7ad1723cc8c6a6eda146a7422"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EDIDQMQ4E76L2TJESCGA4ME3RB/bundle.json","state_url":"https://pith.science/pith/EDIDQMQ4E76L2TJESCGA4ME3RB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EDIDQMQ4E76L2TJESCGA4ME3RB/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-31T15:30:28Z","links":{"resolver":"https://pith.science/pith/EDIDQMQ4E76L2TJESCGA4ME3RB","bundle":"https://pith.science/pith/EDIDQMQ4E76L2TJESCGA4ME3RB/bundle.json","state":"https://pith.science/pith/EDIDQMQ4E76L2TJESCGA4ME3RB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EDIDQMQ4E76L2TJESCGA4ME3RB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EDIDQMQ4E76L2TJESCGA4ME3RB","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":"3b75902e40ad74deb427eea8044a044da73423f85ccfc423e19693094c58fed8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-27T00:23:47Z","title_canon_sha256":"b661f4de351b3fd029e13fbf4daec8c81dd4361cdd02b0d69893b18ac9aa3b00"},"schema_version":"1.0","source":{"id":"1412.8005","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8005","created_at":"2026-05-18T02:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8005v1","created_at":"2026-05-18T02:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8005","created_at":"2026-05-18T02:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"EDIDQMQ4E76L","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EDIDQMQ4E76L2TJE","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EDIDQMQ4","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:a322e5335f18a2637b851ca736ddae78f4ac53d7ad1723cc8c6a6eda146a7422","target":"graph","created_at":"2026-05-18T02:30:24Z","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":"We investigate dynamic algorithms for the interval scheduling problem. Our algorithm runs in amortised time $O(\\log n)$ for query operation and $O(d\\log^2 n)$ for insertion and removal operations, where $n$ and $d$ are the maximal numbers of intervals and pairwise overlapping intervals respectively. We also show that for a monotonic set, that is when no interval properly contains another interval, the amortised complexity is $O(\\log n)$ for both query and update operations. We compare the two algorithms for the monotonic interval sets using experiments.","authors_text":"Alex Gavryushkin, Bakhadyr Khoussainov, Jiamou Liu, Mikhail Kokho","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-27T00:23:47Z","title":"Dynamic Algorithms for Interval Scheduling on a Single Machine"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8005","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:df97cdc35c3b94304d8bf82d3885965c9b1f68de7d9a66fce9f207321b4c8020","target":"record","created_at":"2026-05-18T02:30:24Z","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":"3b75902e40ad74deb427eea8044a044da73423f85ccfc423e19693094c58fed8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-27T00:23:47Z","title_canon_sha256":"b661f4de351b3fd029e13fbf4daec8c81dd4361cdd02b0d69893b18ac9aa3b00"},"schema_version":"1.0","source":{"id":"1412.8005","kind":"arxiv","version":1}},"canonical_sha256":"20d038321c27fcbd4d24908c0e309b88502e0890016b8381f07671c33aedf494","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20d038321c27fcbd4d24908c0e309b88502e0890016b8381f07671c33aedf494","first_computed_at":"2026-05-18T02:30:24.418535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:24.418535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k1hjfxrw1rmChR/rf+AC128N7AyuH/2aHuh4Wf3XJf+USYEoQSxfHeFwupHOkNQqAbMC3YGoeRBwINMmDPMnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:24.419013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.8005","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df97cdc35c3b94304d8bf82d3885965c9b1f68de7d9a66fce9f207321b4c8020","sha256:a322e5335f18a2637b851ca736ddae78f4ac53d7ad1723cc8c6a6eda146a7422"],"state_sha256":"3ee95313adfb7687b8a95c1fe635ce85a11c1aeaabf3d48df3c894bea5d1c234"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZTY1AYUrMxk239rLLi3L2EH3UeRAcX73fBwdhVPH9TtDbcoyHhpr5wx1QwHt4mlFA3PQlC0o8wD54F00K5kCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:30:28.011441Z","bundle_sha256":"4819a8ad82a4aac9d1a8d9fe289782196736f050409d1cda0ac0af878c09269a"}}