{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DDC3Z6ZI4NN6M4VMW2VJBZBFQ3","short_pith_number":"pith:DDC3Z6ZI","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"},"canonical_sha256":"18c5bcfb28e35be672acb6aa90e42586ec5bfbd8cfc7705adf6431d7260419fb","source":{"kind":"arxiv","id":"1408.7033","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.7033","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"1408.7033v3","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.7033","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"DDC3Z6ZI4NN6","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DDC3Z6ZI4NN6M4VM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DDC3Z6ZI","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DDC3Z6ZI4NN6M4VMW2VJBZBFQ3","target":"record","payload":{"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"},"canonical_sha256":"18c5bcfb28e35be672acb6aa90e42586ec5bfbd8cfc7705adf6431d7260419fb","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"},"source_kind":"arxiv","source_id":"1408.7033","source_version":3,"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-18T01:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y0ANp8QsgOoGuklXqUuHION5Ab6hmT2ARWzX9JVCmV3Bv4dDYqxW+ji0sYYvlEnGbeUNSWV1KMxkgFjnb7IcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:39:21.284484Z"},"content_sha256":"7a53ec4b0aac82852823c5d85907ce5a78ba0d61970de0e8caa713cf7b0af82f","schema_version":"1.0","event_id":"sha256:7a53ec4b0aac82852823c5d85907ce5a78ba0d61970de0e8caa713cf7b0af82f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DDC3Z6ZI4NN6M4VMW2VJBZBFQ3","target":"graph","payload":{"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"},"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-18T01:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MRlBIGY7m8W0htSSJDRjxN78h5prKCA8RfTXHbRX+LU0SGqT3DPfp6//HHOjw8djAiH9ZpS7bvquM9q42Q2iAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:39:21.284921Z"},"content_sha256":"11c070ef79ee3e249bee97e5dafc3e8102471e9fa5820b8d98e47a9a557e29af","schema_version":"1.0","event_id":"sha256:11c070ef79ee3e249bee97e5dafc3e8102471e9fa5820b8d98e47a9a557e29af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/bundle.json","state_url":"https://pith.science/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/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-27T03:39:21Z","links":{"resolver":"https://pith.science/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3","bundle":"https://pith.science/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/bundle.json","state":"https://pith.science/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDC3Z6ZI4NN6M4VMW2VJBZBFQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DDC3Z6ZI4NN6M4VMW2VJBZBFQ3","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":"9e5b0a78a87b6e16864abf6433f03149e4ef6d069a37c6bbf13b7cb49f796e2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-29T14:28:55Z","title_canon_sha256":"1856bbc7e635d688cbc1fdad4f70c3b1baf37ef79659d6d8f5b6826eaa698371"},"schema_version":"1.0","source":{"id":"1408.7033","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.7033","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"1408.7033v3","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.7033","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"DDC3Z6ZI4NN6","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DDC3Z6ZI4NN6M4VM","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DDC3Z6ZI","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:11c070ef79ee3e249bee97e5dafc3e8102471e9fa5820b8d98e47a9a557e29af","target":"graph","created_at":"2026-05-18T01:13:45Z","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":"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","authors_text":"Christian Kudahl, Jesper W. Mikkelsen, Joan Boyar, Lene M. Favrholdt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-29T14:28:55Z","title":"The Advice Complexity of a Class of Hard Online Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.7033","kind":"arxiv","version":3},"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:7a53ec4b0aac82852823c5d85907ce5a78ba0d61970de0e8caa713cf7b0af82f","target":"record","created_at":"2026-05-18T01:13:45Z","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":"9e5b0a78a87b6e16864abf6433f03149e4ef6d069a37c6bbf13b7cb49f796e2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-29T14:28:55Z","title_canon_sha256":"1856bbc7e635d688cbc1fdad4f70c3b1baf37ef79659d6d8f5b6826eaa698371"},"schema_version":"1.0","source":{"id":"1408.7033","kind":"arxiv","version":3}},"canonical_sha256":"18c5bcfb28e35be672acb6aa90e42586ec5bfbd8cfc7705adf6431d7260419fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18c5bcfb28e35be672acb6aa90e42586ec5bfbd8cfc7705adf6431d7260419fb","first_computed_at":"2026-05-18T01:13:45.060398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:45.060398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YYSxt9hotJ57Va61XcqT1FhO2E7QMPyeA7T5EKceDrbuRtoOvaiTVOmb3u+FJxK+UDhu+TGaS138EfXAxdRqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:45.061050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.7033","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a53ec4b0aac82852823c5d85907ce5a78ba0d61970de0e8caa713cf7b0af82f","sha256:11c070ef79ee3e249bee97e5dafc3e8102471e9fa5820b8d98e47a9a557e29af"],"state_sha256":"095fff503fdc11ffd2701249af31495f5542a30e5c97aeb53a366ff1ce5b8518"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7bylpTaWTxaM0ChHbqOj20mbxRilZzKp4IKLtCZIfb6tnpn4vXsy8jZ033duhqE1FDwryfMh+2vk3YGpC8leDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:39:21.288230Z","bundle_sha256":"7462fd9d9f9378f5159f8526c2038327263c10c9bf02f2512ef9ca63f187592f"}}