{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FEHL2WJPZP2RQJMJHFXIZJWNSH","short_pith_number":"pith:FEHL2WJP","schema_version":"1.0","canonical_sha256":"290ebd592fcbf5182589396e8ca6cd91e2896f0218d2c726758b45dab4399f33","source":{"kind":"arxiv","id":"1806.01703","version":2},"attestation_state":"computed","paper":{"title":"Competing Prediction Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Moshe Tennenholtz, Omer Ben-Porat","submitted_at":"2018-06-05T14:12:26Z","abstract_excerpt":"Prediction is a well-studied machine learning task, and prediction algorithms are core ingredients in online products and services. Despite their centrality in the competition between online companies who offer prediction-based products, the strategic use of prediction algorithms remains unexplored. The goal of this paper is to examine strategic use of prediction algorithms. We introduce a novel game-theoretic setting that is based on the PAC learning framework, where each player (aka a prediction algorithm at competition) seeks to maximize the sum of points for which it produces an accurate p"},"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":"1806.01703","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-06-05T14:12:26Z","cross_cats_sorted":[],"title_canon_sha256":"7e5d62d0f942c4b49f5ff657a256155db80d61f3a404fb164967ce451913e4d4","abstract_canon_sha256":"2afecd0e9395d2158541df23e77320e944fd9648e5a1c53909539ef51c4d2feb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:46.335007Z","signature_b64":"Gcy5H6zMxuLi7tcreSbqNMzGAvzHLo9ZE5l+/4ryGSNYDe578h+bqH2ejHDEwHib/VfU5RKjbDiCRBTuzYjABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"290ebd592fcbf5182589396e8ca6cd91e2896f0218d2c726758b45dab4399f33","last_reissued_at":"2026-05-17T23:46:46.334559Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:46.334559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competing Prediction Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Moshe Tennenholtz, Omer Ben-Porat","submitted_at":"2018-06-05T14:12:26Z","abstract_excerpt":"Prediction is a well-studied machine learning task, and prediction algorithms are core ingredients in online products and services. Despite their centrality in the competition between online companies who offer prediction-based products, the strategic use of prediction algorithms remains unexplored. The goal of this paper is to examine strategic use of prediction algorithms. We introduce a novel game-theoretic setting that is based on the PAC learning framework, where each player (aka a prediction algorithm at competition) seeks to maximize the sum of points for which it produces an accurate p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01703","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":"1806.01703","created_at":"2026-05-17T23:46:46.334651+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.01703v2","created_at":"2026-05-17T23:46:46.334651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01703","created_at":"2026-05-17T23:46:46.334651+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEHL2WJPZP2R","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEHL2WJPZP2RQJMJ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEHL2WJP","created_at":"2026-05-18T12:32:22.470017+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/FEHL2WJPZP2RQJMJHFXIZJWNSH","json":"https://pith.science/pith/FEHL2WJPZP2RQJMJHFXIZJWNSH.json","graph_json":"https://pith.science/api/pith-number/FEHL2WJPZP2RQJMJHFXIZJWNSH/graph.json","events_json":"https://pith.science/api/pith-number/FEHL2WJPZP2RQJMJHFXIZJWNSH/events.json","paper":"https://pith.science/paper/FEHL2WJP"},"agent_actions":{"view_html":"https://pith.science/pith/FEHL2WJPZP2RQJMJHFXIZJWNSH","download_json":"https://pith.science/pith/FEHL2WJPZP2RQJMJHFXIZJWNSH.json","view_paper":"https://pith.science/paper/FEHL2WJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.01703&json=true","fetch_graph":"https://pith.science/api/pith-number/FEHL2WJPZP2RQJMJHFXIZJWNSH/graph.json","fetch_events":"https://pith.science/api/pith-number/FEHL2WJPZP2RQJMJHFXIZJWNSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEHL2WJPZP2RQJMJHFXIZJWNSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEHL2WJPZP2RQJMJHFXIZJWNSH/action/storage_attestation","attest_author":"https://pith.science/pith/FEHL2WJPZP2RQJMJHFXIZJWNSH/action/author_attestation","sign_citation":"https://pith.science/pith/FEHL2WJPZP2RQJMJHFXIZJWNSH/action/citation_signature","submit_replication":"https://pith.science/pith/FEHL2WJPZP2RQJMJHFXIZJWNSH/action/replication_record"}},"created_at":"2026-05-17T23:46:46.334651+00:00","updated_at":"2026-05-17T23:46:46.334651+00:00"}