{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7NZQH4A4RQIJJWZ2QI7EVV2BCM","short_pith_number":"pith:7NZQH4A4","schema_version":"1.0","canonical_sha256":"fb7303f01c8c1094db3a823e4ad741131f705cd5ac13e3fe6b69c88c19e81763","source":{"kind":"arxiv","id":"1702.03536","version":2},"attestation_state":"computed","paper":{"title":"A new lower bound for the on-line coloring of intervals with bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Patryk Mikos","submitted_at":"2017-02-12T16:07:32Z","abstract_excerpt":"The on-line interval coloring and its variants are important combinatorial problems with many applications in network multiplexing, resource allocation and job scheduling. In this paper we present a new lower bound of $4.1626$ for the competitive ratio for the on-line coloring of intervals with bandwidth which improves the best known lower bound of $\\frac{24}{7}$. For the on-line coloring of unit intervals with bandwidth we improve the lower bound of $1.831$ to $2$."},"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":"1702.03536","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-12T16:07:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fa8315467a512edb72b7f77ebb4fe498f7ec7c7fd9fd29221aa224a01c21b3bf","abstract_canon_sha256":"37b540110d1bc377ce2b269c90a31540bff4ffb4e65b1a0900dc91ee15fdd5ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:18.507034Z","signature_b64":"BRnwkdNoPNWUnvMZlaqPHeMt9K56k7AQg0qhTf7/Rq459OUq6fAduQ2M+hlwERYECOKBHxx291dbPLel924bDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb7303f01c8c1094db3a823e4ad741131f705cd5ac13e3fe6b69c88c19e81763","last_reissued_at":"2026-05-18T00:46:18.506685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:18.506685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new lower bound for the on-line coloring of intervals with bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Patryk Mikos","submitted_at":"2017-02-12T16:07:32Z","abstract_excerpt":"The on-line interval coloring and its variants are important combinatorial problems with many applications in network multiplexing, resource allocation and job scheduling. In this paper we present a new lower bound of $4.1626$ for the competitive ratio for the on-line coloring of intervals with bandwidth which improves the best known lower bound of $\\frac{24}{7}$. For the on-line coloring of unit intervals with bandwidth we improve the lower bound of $1.831$ to $2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03536","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.03536","created_at":"2026-05-18T00:46:18.506740+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03536v2","created_at":"2026-05-18T00:46:18.506740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03536","created_at":"2026-05-18T00:46:18.506740+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NZQH4A4RQIJ","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NZQH4A4RQIJJWZ2","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NZQH4A4","created_at":"2026-05-18T12:31:05.417338+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/7NZQH4A4RQIJJWZ2QI7EVV2BCM","json":"https://pith.science/pith/7NZQH4A4RQIJJWZ2QI7EVV2BCM.json","graph_json":"https://pith.science/api/pith-number/7NZQH4A4RQIJJWZ2QI7EVV2BCM/graph.json","events_json":"https://pith.science/api/pith-number/7NZQH4A4RQIJJWZ2QI7EVV2BCM/events.json","paper":"https://pith.science/paper/7NZQH4A4"},"agent_actions":{"view_html":"https://pith.science/pith/7NZQH4A4RQIJJWZ2QI7EVV2BCM","download_json":"https://pith.science/pith/7NZQH4A4RQIJJWZ2QI7EVV2BCM.json","view_paper":"https://pith.science/paper/7NZQH4A4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03536&json=true","fetch_graph":"https://pith.science/api/pith-number/7NZQH4A4RQIJJWZ2QI7EVV2BCM/graph.json","fetch_events":"https://pith.science/api/pith-number/7NZQH4A4RQIJJWZ2QI7EVV2BCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NZQH4A4RQIJJWZ2QI7EVV2BCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NZQH4A4RQIJJWZ2QI7EVV2BCM/action/storage_attestation","attest_author":"https://pith.science/pith/7NZQH4A4RQIJJWZ2QI7EVV2BCM/action/author_attestation","sign_citation":"https://pith.science/pith/7NZQH4A4RQIJJWZ2QI7EVV2BCM/action/citation_signature","submit_replication":"https://pith.science/pith/7NZQH4A4RQIJJWZ2QI7EVV2BCM/action/replication_record"}},"created_at":"2026-05-18T00:46:18.506740+00:00","updated_at":"2026-05-18T00:46:18.506740+00:00"}