{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:2BASWYZKTNXAJZG2AYP7IFKN62","short_pith_number":"pith:2BASWYZK","schema_version":"1.0","canonical_sha256":"d0412b632a9b6e04e4da061ff4154df69462b2193cc117af738266063d70eff7","source":{"kind":"arxiv","id":"0806.0983","version":2},"attestation_state":"computed","paper":{"title":"A Comparison of Performance Measures for Online Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joan Boyar, Kim S. Larsen, Sandy Irani","submitted_at":"2008-06-05T14:50:08Z","abstract_excerpt":"This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear points. Even though the problem is simple, it encapsulates a core challenge in online algorithms which is to balance greediness and adaptability. We examine Competitive Analysis, the Max/Max Ratio, the Random Order Ratio, Bijective Analysis and Relative Worst Order Analysis, and determine how these measures compare the Greedy Algorithm, Double Coverage, and Lazy Double Coverage, commonly studied algorithms in the contex"},"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":"0806.0983","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-06-05T14:50:08Z","cross_cats_sorted":[],"title_canon_sha256":"a43b3fa5b52dddfbf564fb75606138acc3b178b746fca51cbb847fb0d9aedd0c","abstract_canon_sha256":"541051d2b9cd158ec7e6421f9cb4a4614656aff0b038968a109d0c6dc72312ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:27.617162Z","signature_b64":"YATMMlpfC2uwtR+AxF66ph+noYuN3MpCCPR9GqdEeOj/GgCluIOxyUN2BMJf5Se0NNreaSDcBXAK2ZLyaJ9XDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0412b632a9b6e04e4da061ff4154df69462b2193cc117af738266063d70eff7","last_reissued_at":"2026-05-18T03:43:27.616519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:27.616519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comparison of Performance Measures for Online Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joan Boyar, Kim S. Larsen, Sandy Irani","submitted_at":"2008-06-05T14:50:08Z","abstract_excerpt":"This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear points. Even though the problem is simple, it encapsulates a core challenge in online algorithms which is to balance greediness and adaptability. We examine Competitive Analysis, the Max/Max Ratio, the Random Order Ratio, Bijective Analysis and Relative Worst Order Analysis, and determine how these measures compare the Greedy Algorithm, Double Coverage, and Lazy Double Coverage, commonly studied algorithms in the contex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.0983","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":"0806.0983","created_at":"2026-05-18T03:43:27.616617+00:00"},{"alias_kind":"arxiv_version","alias_value":"0806.0983v2","created_at":"2026-05-18T03:43:27.616617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.0983","created_at":"2026-05-18T03:43:27.616617+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BASWYZKTNXA","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BASWYZKTNXAJZG2","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BASWYZK","created_at":"2026-05-18T12:25:56.245647+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/2BASWYZKTNXAJZG2AYP7IFKN62","json":"https://pith.science/pith/2BASWYZKTNXAJZG2AYP7IFKN62.json","graph_json":"https://pith.science/api/pith-number/2BASWYZKTNXAJZG2AYP7IFKN62/graph.json","events_json":"https://pith.science/api/pith-number/2BASWYZKTNXAJZG2AYP7IFKN62/events.json","paper":"https://pith.science/paper/2BASWYZK"},"agent_actions":{"view_html":"https://pith.science/pith/2BASWYZKTNXAJZG2AYP7IFKN62","download_json":"https://pith.science/pith/2BASWYZKTNXAJZG2AYP7IFKN62.json","view_paper":"https://pith.science/paper/2BASWYZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0806.0983&json=true","fetch_graph":"https://pith.science/api/pith-number/2BASWYZKTNXAJZG2AYP7IFKN62/graph.json","fetch_events":"https://pith.science/api/pith-number/2BASWYZKTNXAJZG2AYP7IFKN62/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BASWYZKTNXAJZG2AYP7IFKN62/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BASWYZKTNXAJZG2AYP7IFKN62/action/storage_attestation","attest_author":"https://pith.science/pith/2BASWYZKTNXAJZG2AYP7IFKN62/action/author_attestation","sign_citation":"https://pith.science/pith/2BASWYZKTNXAJZG2AYP7IFKN62/action/citation_signature","submit_replication":"https://pith.science/pith/2BASWYZKTNXAJZG2AYP7IFKN62/action/replication_record"}},"created_at":"2026-05-18T03:43:27.616617+00:00","updated_at":"2026-05-18T03:43:27.616617+00:00"}