{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DDC3Z6ZI4NN6M4VMW2VJBZBFQ3","short_pith_number":"pith:DDC3Z6ZI","schema_version":"1.0","canonical_sha256":"18c5bcfb28e35be672acb6aa90e42586ec5bfbd8cfc7705adf6431d7260419fb","source":{"kind":"arxiv","id":"1408.7033","version":3},"attestation_state":"computed","paper":{"title":"The Advice Complexity of a Class of Hard Online Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Kudahl, Jesper W. Mikkelsen, Joan Boyar, Lene M. Favrholdt","submitted_at":"2014-08-29T14:28:55Z","abstract_excerpt":"The advice complexity of an online problem is a measure of how much knowledge of the future an online algorithm needs in order to achieve a certain competitive ratio. Using advice complexity, we define the first online complexity class, AOC. The class includes independent set, vertex cover, dominating set, and several others as complete problems. AOC-complete problems are hard, since a single wrong answer by the online algorithm can have devastating consequences. For each of these problems, we show that $\\log\\left(1+(c-1)^{c-1}/c^{c}\\right)n=\\Theta (n/c)$ bits of advice are necessary and suffi"},"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":"1408.7033","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-29T14:28:55Z","cross_cats_sorted":[],"title_canon_sha256":"1856bbc7e635d688cbc1fdad4f70c3b1baf37ef79659d6d8f5b6826eaa698371","abstract_canon_sha256":"9e5b0a78a87b6e16864abf6433f03149e4ef6d069a37c6bbf13b7cb49f796e2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:45.061050Z","signature_b64":"YYSxt9hotJ57Va61XcqT1FhO2E7QMPyeA7T5EKceDrbuRtoOvaiTVOmb3u+FJxK+UDhu+TGaS138EfXAxdRqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18c5bcfb28e35be672acb6aa90e42586ec5bfbd8cfc7705adf6431d7260419fb","last_reissued_at":"2026-05-18T01:13:45.060398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:45.060398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Advice Complexity of a Class of Hard Online Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Kudahl, Jesper W. Mikkelsen, Joan Boyar, Lene M. Favrholdt","submitted_at":"2014-08-29T14:28:55Z","abstract_excerpt":"The advice complexity of an online problem is a measure of how much knowledge of the future an online algorithm needs in order to achieve a certain competitive ratio. Using advice complexity, we define the first online complexity class, AOC. The class includes independent set, vertex cover, dominating set, and several others as complete problems. AOC-complete problems are hard, since a single wrong answer by the online algorithm can have devastating consequences. For each of these problems, we show that $\\log\\left(1+(c-1)^{c-1}/c^{c}\\right)n=\\Theta (n/c)$ bits of advice are necessary and suffi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.7033","kind":"arxiv","version":3},"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":"1408.7033","created_at":"2026-05-18T01:13:45.060505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.7033v3","created_at":"2026-05-18T01:13:45.060505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.7033","created_at":"2026-05-18T01:13:45.060505+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDC3Z6ZI4NN6","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDC3Z6ZI4NN6M4VM","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDC3Z6ZI","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/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3","json":"https://pith.science/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3.json","graph_json":"https://pith.science/api/pith-number/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/graph.json","events_json":"https://pith.science/api/pith-number/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/events.json","paper":"https://pith.science/paper/DDC3Z6ZI"},"agent_actions":{"view_html":"https://pith.science/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3","download_json":"https://pith.science/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3.json","view_paper":"https://pith.science/paper/DDC3Z6ZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.7033&json=true","fetch_graph":"https://pith.science/api/pith-number/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/action/storage_attestation","attest_author":"https://pith.science/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/action/author_attestation","sign_citation":"https://pith.science/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/action/citation_signature","submit_replication":"https://pith.science/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/action/replication_record"}},"created_at":"2026-05-18T01:13:45.060505+00:00","updated_at":"2026-05-18T01:13:45.060505+00:00"}