{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5FJSTZGZG3727KFF3XKTTHFTYQ","short_pith_number":"pith:5FJSTZGZ","schema_version":"1.0","canonical_sha256":"e95329e4d936ffafa8a5ddd5399cb3c4050e20e3fc194de89817dac59b89cf2b","source":{"kind":"arxiv","id":"2502.03919","version":2},"attestation_state":"computed","paper":{"title":"Blackwell's Approachability with Approximation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Dan Garber, Mhna Massalha","submitted_at":"2025-02-06T09:54:00Z","abstract_excerpt":"We revisit Blackwell's celebrated approachability problem which considers a repeated vector-valued game between a player and an adversary. Motivated by settings in which the action set of the player or adversary (or both) is difficult to optimize over, for instance when it corresponds to the set of all possible solutions to some NP-Hard optimization problem, we ask what can the player guarantee \\textit{efficiently}, when only having access to these sets via approximation algorithms with ratios $\\alpha_{\\mX} \\geq 1$ and $ 1 \\geq \\alpha_{\\mY} > 0$, respectively. Assuming the player has monotone "},"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":"2502.03919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-02-06T09:54:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"466e59b07c4503eeab25c7beca910df9c75f43d12c0690893106b7f5b1a1e2de","abstract_canon_sha256":"aa1dba18f5290937692ec3414183b44609da6937708773d8dc71f82315214123"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:41.739491Z","signature_b64":"vqcvcYbB95rBnIBH/zJgYuCScgCUZg7u15a/VxNSHeDBCxrm9TjZRuHGRh5C8AOvytUzgPsUoiprsj2LC92iDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e95329e4d936ffafa8a5ddd5399cb3c4050e20e3fc194de89817dac59b89cf2b","last_reissued_at":"2026-07-05T11:21:41.738944Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:41.738944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Blackwell's Approachability with Approximation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Dan Garber, Mhna Massalha","submitted_at":"2025-02-06T09:54:00Z","abstract_excerpt":"We revisit Blackwell's celebrated approachability problem which considers a repeated vector-valued game between a player and an adversary. Motivated by settings in which the action set of the player or adversary (or both) is difficult to optimize over, for instance when it corresponds to the set of all possible solutions to some NP-Hard optimization problem, we ask what can the player guarantee \\textit{efficiently}, when only having access to these sets via approximation algorithms with ratios $\\alpha_{\\mX} \\geq 1$ and $ 1 \\geq \\alpha_{\\mY} > 0$, respectively. Assuming the player has monotone "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.03919","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.03919/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.03919","created_at":"2026-07-05T11:21:41.739003+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.03919v2","created_at":"2026-07-05T11:21:41.739003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.03919","created_at":"2026-07-05T11:21:41.739003+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FJSTZGZG372","created_at":"2026-07-05T11:21:41.739003+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FJSTZGZG3727KFF","created_at":"2026-07-05T11:21:41.739003+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FJSTZGZ","created_at":"2026-07-05T11:21:41.739003+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06624","citing_title":"Online Scalarization in Vector-Valued Games","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06624","citing_title":"Online Scalarization in Vector-Valued Games","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5FJSTZGZG3727KFF3XKTTHFTYQ","json":"https://pith.science/pith/5FJSTZGZG3727KFF3XKTTHFTYQ.json","graph_json":"https://pith.science/api/pith-number/5FJSTZGZG3727KFF3XKTTHFTYQ/graph.json","events_json":"https://pith.science/api/pith-number/5FJSTZGZG3727KFF3XKTTHFTYQ/events.json","paper":"https://pith.science/paper/5FJSTZGZ"},"agent_actions":{"view_html":"https://pith.science/pith/5FJSTZGZG3727KFF3XKTTHFTYQ","download_json":"https://pith.science/pith/5FJSTZGZG3727KFF3XKTTHFTYQ.json","view_paper":"https://pith.science/paper/5FJSTZGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.03919&json=true","fetch_graph":"https://pith.science/api/pith-number/5FJSTZGZG3727KFF3XKTTHFTYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5FJSTZGZG3727KFF3XKTTHFTYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FJSTZGZG3727KFF3XKTTHFTYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FJSTZGZG3727KFF3XKTTHFTYQ/action/storage_attestation","attest_author":"https://pith.science/pith/5FJSTZGZG3727KFF3XKTTHFTYQ/action/author_attestation","sign_citation":"https://pith.science/pith/5FJSTZGZG3727KFF3XKTTHFTYQ/action/citation_signature","submit_replication":"https://pith.science/pith/5FJSTZGZG3727KFF3XKTTHFTYQ/action/replication_record"}},"created_at":"2026-07-05T11:21:41.739003+00:00","updated_at":"2026-07-05T11:21:41.739003+00:00"}