{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3K4BSEISS5OR2B4RE4U3GGNLXT","short_pith_number":"pith:3K4BSEIS","schema_version":"1.0","canonical_sha256":"dab8191112975d1d07912729b319abbcd786617f98e8768fbfe555ceb87982bb","source":{"kind":"arxiv","id":"1602.06708","version":2},"attestation_state":"computed","paper":{"title":"Online Bounded Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asaf Levin, Joan Boyar, Kim S. Larsen, Leah Epstein, Lene M. Favrholdt","submitted_at":"2016-02-22T10:28:27Z","abstract_excerpt":"Though competitive analysis is often a very good tool for the analysis of online algorithms, sometimes it does not give any insight and sometimes it gives counter-intuitive results. Much work has gone into exploring other performance measures, in particular targeted at what seems to be the core problem with competitive analysis: the comparison of the performance of an online algorithm is made to a too powerful adversary. We consider a new approach to restricting the power of the adversary, by requiring that when judging a given online algorithm, the optimal offline algorithm must perform as we"},"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":"1602.06708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-22T10:28:27Z","cross_cats_sorted":[],"title_canon_sha256":"df5d019c5f4cdc7f72d2088e873862c5bdc8b2acfc29c58f427e16c4f3557b9f","abstract_canon_sha256":"bcbe572e685f6440e7db4b41dcebc5b17c1fccb242966550dc80a68fde44a419"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:33.108095Z","signature_b64":"iVWlXNzS71nTu3ozy9fr/ikzl1RYG67MBL8T7kVU3VnI2ktnpENKNNIHfgBDFmvU2xmO6LNBK/PizqayCac6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dab8191112975d1d07912729b319abbcd786617f98e8768fbfe555ceb87982bb","last_reissued_at":"2026-05-18T00:42:33.107569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:33.107569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Bounded Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asaf Levin, Joan Boyar, Kim S. Larsen, Leah Epstein, Lene M. Favrholdt","submitted_at":"2016-02-22T10:28:27Z","abstract_excerpt":"Though competitive analysis is often a very good tool for the analysis of online algorithms, sometimes it does not give any insight and sometimes it gives counter-intuitive results. Much work has gone into exploring other performance measures, in particular targeted at what seems to be the core problem with competitive analysis: the comparison of the performance of an online algorithm is made to a too powerful adversary. We consider a new approach to restricting the power of the adversary, by requiring that when judging a given online algorithm, the optimal offline algorithm must perform as we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06708","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":"1602.06708","created_at":"2026-05-18T00:42:33.107650+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.06708v2","created_at":"2026-05-18T00:42:33.107650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06708","created_at":"2026-05-18T00:42:33.107650+00:00"},{"alias_kind":"pith_short_12","alias_value":"3K4BSEISS5OR","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3K4BSEISS5OR2B4R","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3K4BSEIS","created_at":"2026-05-18T12:29:55.572404+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/3K4BSEISS5OR2B4RE4U3GGNLXT","json":"https://pith.science/pith/3K4BSEISS5OR2B4RE4U3GGNLXT.json","graph_json":"https://pith.science/api/pith-number/3K4BSEISS5OR2B4RE4U3GGNLXT/graph.json","events_json":"https://pith.science/api/pith-number/3K4BSEISS5OR2B4RE4U3GGNLXT/events.json","paper":"https://pith.science/paper/3K4BSEIS"},"agent_actions":{"view_html":"https://pith.science/pith/3K4BSEISS5OR2B4RE4U3GGNLXT","download_json":"https://pith.science/pith/3K4BSEISS5OR2B4RE4U3GGNLXT.json","view_paper":"https://pith.science/paper/3K4BSEIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.06708&json=true","fetch_graph":"https://pith.science/api/pith-number/3K4BSEISS5OR2B4RE4U3GGNLXT/graph.json","fetch_events":"https://pith.science/api/pith-number/3K4BSEISS5OR2B4RE4U3GGNLXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3K4BSEISS5OR2B4RE4U3GGNLXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3K4BSEISS5OR2B4RE4U3GGNLXT/action/storage_attestation","attest_author":"https://pith.science/pith/3K4BSEISS5OR2B4RE4U3GGNLXT/action/author_attestation","sign_citation":"https://pith.science/pith/3K4BSEISS5OR2B4RE4U3GGNLXT/action/citation_signature","submit_replication":"https://pith.science/pith/3K4BSEISS5OR2B4RE4U3GGNLXT/action/replication_record"}},"created_at":"2026-05-18T00:42:33.107650+00:00","updated_at":"2026-05-18T00:42:33.107650+00:00"}