{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EDIDQMQ4E76L2TJESCGA4ME3RB","short_pith_number":"pith:EDIDQMQ4","schema_version":"1.0","canonical_sha256":"20d038321c27fcbd4d24908c0e309b88502e0890016b8381f07671c33aedf494","source":{"kind":"arxiv","id":"1412.8005","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.8005","created_at":"2026-05-18T02:30:24.418609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8005v1","created_at":"2026-05-18T02:30:24.418609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8005","created_at":"2026-05-18T02:30:24.418609+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDIDQMQ4E76L","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDIDQMQ4E76L2TJE","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDIDQMQ4","created_at":"2026-05-18T12:28:25.294606+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/EDIDQMQ4E76L2TJESCGA4ME3RB","json":"https://pith.science/pith/EDIDQMQ4E76L2TJESCGA4ME3RB.json","graph_json":"https://pith.science/api/pith-number/EDIDQMQ4E76L2TJESCGA4ME3RB/graph.json","events_json":"https://pith.science/api/pith-number/EDIDQMQ4E76L2TJESCGA4ME3RB/events.json","paper":"https://pith.science/paper/EDIDQMQ4"},"agent_actions":{"view_html":"https://pith.science/pith/EDIDQMQ4E76L2TJESCGA4ME3RB","download_json":"https://pith.science/pith/EDIDQMQ4E76L2TJESCGA4ME3RB.json","view_paper":"https://pith.science/paper/EDIDQMQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8005&json=true","fetch_graph":"https://pith.science/api/pith-number/EDIDQMQ4E76L2TJESCGA4ME3RB/graph.json","fetch_events":"https://pith.science/api/pith-number/EDIDQMQ4E76L2TJESCGA4ME3RB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDIDQMQ4E76L2TJESCGA4ME3RB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDIDQMQ4E76L2TJESCGA4ME3RB/action/storage_attestation","attest_author":"https://pith.science/pith/EDIDQMQ4E76L2TJESCGA4ME3RB/action/author_attestation","sign_citation":"https://pith.science/pith/EDIDQMQ4E76L2TJESCGA4ME3RB/action/citation_signature","submit_replication":"https://pith.science/pith/EDIDQMQ4E76L2TJESCGA4ME3RB/action/replication_record"}},"created_at":"2026-05-18T02:30:24.418609+00:00","updated_at":"2026-05-18T02:30:24.418609+00:00"}