{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TB2EMKSDQPBULM6VJ2SH6LISD2","short_pith_number":"pith:TB2EMKSD","schema_version":"1.0","canonical_sha256":"9874462a4383c345b3d54ea47f2d121e82d8c276268a607e548dd92a1de6bc54","source":{"kind":"arxiv","id":"1606.05210","version":2},"attestation_state":"computed","paper":{"title":"Weighted Online Problems with Advice","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":"2016-06-16T14:47:04Z","abstract_excerpt":"Recently, the first online complexity class, AOC, was introduced. The class consists of many online problems where each request must be either accepted or rejected, and the aim is to either minimize or maximize the number of accepted requests, while maintaining a feasible solution. All AOC-complete problems (including Independent Set, Vertex Cover, Dominating Set, and Set Cover) have essentially the same advice complexity. In this paper, we study weighted versions of problems in AOC, i.e., each request comes with a weight and the aim is to either minimize or maximize the total weight of the ac"},"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":"1606.05210","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-16T14:47:04Z","cross_cats_sorted":[],"title_canon_sha256":"894302a08dc59a6fd6389251172f6bc831db3a585294aeb976e78d04d9b73c6d","abstract_canon_sha256":"9d8afe99bf7e9ccf491dc05f1db1f46e2ec2d7c96707956ea5181993452f5625"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:09.401922Z","signature_b64":"60ElY4IPvsljhzaKZ5UuStzZU7hC8jutnPF6xYqIEydZUPnzXwj2uyLVoXhUrJ7I0YtFch6JkG/6gKK3k5DgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9874462a4383c345b3d54ea47f2d121e82d8c276268a607e548dd92a1de6bc54","last_reissued_at":"2026-05-18T00:38:09.401433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:09.401433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted Online Problems with Advice","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":"2016-06-16T14:47:04Z","abstract_excerpt":"Recently, the first online complexity class, AOC, was introduced. The class consists of many online problems where each request must be either accepted or rejected, and the aim is to either minimize or maximize the number of accepted requests, while maintaining a feasible solution. All AOC-complete problems (including Independent Set, Vertex Cover, Dominating Set, and Set Cover) have essentially the same advice complexity. In this paper, we study weighted versions of problems in AOC, i.e., each request comes with a weight and the aim is to either minimize or maximize the total weight of the ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05210","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":"1606.05210","created_at":"2026-05-18T00:38:09.401512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05210v2","created_at":"2026-05-18T00:38:09.401512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05210","created_at":"2026-05-18T00:38:09.401512+00:00"},{"alias_kind":"pith_short_12","alias_value":"TB2EMKSDQPBU","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TB2EMKSDQPBULM6V","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TB2EMKSD","created_at":"2026-05-18T12:30:44.179134+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/TB2EMKSDQPBULM6VJ2SH6LISD2","json":"https://pith.science/pith/TB2EMKSDQPBULM6VJ2SH6LISD2.json","graph_json":"https://pith.science/api/pith-number/TB2EMKSDQPBULM6VJ2SH6LISD2/graph.json","events_json":"https://pith.science/api/pith-number/TB2EMKSDQPBULM6VJ2SH6LISD2/events.json","paper":"https://pith.science/paper/TB2EMKSD"},"agent_actions":{"view_html":"https://pith.science/pith/TB2EMKSDQPBULM6VJ2SH6LISD2","download_json":"https://pith.science/pith/TB2EMKSDQPBULM6VJ2SH6LISD2.json","view_paper":"https://pith.science/paper/TB2EMKSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05210&json=true","fetch_graph":"https://pith.science/api/pith-number/TB2EMKSDQPBULM6VJ2SH6LISD2/graph.json","fetch_events":"https://pith.science/api/pith-number/TB2EMKSDQPBULM6VJ2SH6LISD2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TB2EMKSDQPBULM6VJ2SH6LISD2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TB2EMKSDQPBULM6VJ2SH6LISD2/action/storage_attestation","attest_author":"https://pith.science/pith/TB2EMKSDQPBULM6VJ2SH6LISD2/action/author_attestation","sign_citation":"https://pith.science/pith/TB2EMKSDQPBULM6VJ2SH6LISD2/action/citation_signature","submit_replication":"https://pith.science/pith/TB2EMKSDQPBULM6VJ2SH6LISD2/action/replication_record"}},"created_at":"2026-05-18T00:38:09.401512+00:00","updated_at":"2026-05-18T00:38:09.401512+00:00"}