{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:G77FINGX7GUHGNMXQGQBRXOMTS","short_pith_number":"pith:G77FINGX","schema_version":"1.0","canonical_sha256":"37fe5434d7f9a873359781a018ddcc9c97c83a11f7b5ffaf06b89cd996a0f1fd","source":{"kind":"arxiv","id":"1709.03093","version":1},"attestation_state":"computed","paper":{"title":"Efficient Online Linear Optimization with Approximation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Dan Garber","submitted_at":"2017-09-10T12:30:26Z","abstract_excerpt":"We revisit the problem of \\textit{online linear optimization} in case the set of feasible actions is accessible through an approximated linear optimization oracle with a factor $\\alpha$ multiplicative approximation guarantee. This setting is in particular interesting since it captures natural online extensions of well-studied \\textit{offline} linear optimization problems which are NP-hard, yet admit efficient approximation algorithms. The goal here is to minimize the $\\alpha$\\textit{-regret} which is the natural extension of the standard \\textit{regret} in \\textit{online learning} to this sett"},"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":"1709.03093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-10T12:30:26Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"2b13c2b9f7f93107f1213fa21639465a3b68e227edc4794cfb673ec488fdd00f","abstract_canon_sha256":"acc3cf3de8bf8ff7d23f3c536870a9fd68e8728db91efebea8697833d353e508"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:39.419733Z","signature_b64":"v7/lBIuF42KoNKaZCgTqMpi75aY/iBqem8zFr7T2MNQfvFJ8ioZyIgnN7MniSHiPf+icBZ4huKiywj3cu7VICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37fe5434d7f9a873359781a018ddcc9c97c83a11f7b5ffaf06b89cd996a0f1fd","last_reissued_at":"2026-05-18T00:35:39.419132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:39.419132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Online Linear Optimization with Approximation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Dan Garber","submitted_at":"2017-09-10T12:30:26Z","abstract_excerpt":"We revisit the problem of \\textit{online linear optimization} in case the set of feasible actions is accessible through an approximated linear optimization oracle with a factor $\\alpha$ multiplicative approximation guarantee. This setting is in particular interesting since it captures natural online extensions of well-studied \\textit{offline} linear optimization problems which are NP-hard, yet admit efficient approximation algorithms. The goal here is to minimize the $\\alpha$\\textit{-regret} which is the natural extension of the standard \\textit{regret} in \\textit{online learning} to this sett"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03093","kind":"arxiv","version":1},"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":"1709.03093","created_at":"2026-05-18T00:35:39.419228+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03093v1","created_at":"2026-05-18T00:35:39.419228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03093","created_at":"2026-05-18T00:35:39.419228+00:00"},{"alias_kind":"pith_short_12","alias_value":"G77FINGX7GUH","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"G77FINGX7GUHGNMX","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"G77FINGX","created_at":"2026-05-18T12:31:15.632608+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/G77FINGX7GUHGNMXQGQBRXOMTS","json":"https://pith.science/pith/G77FINGX7GUHGNMXQGQBRXOMTS.json","graph_json":"https://pith.science/api/pith-number/G77FINGX7GUHGNMXQGQBRXOMTS/graph.json","events_json":"https://pith.science/api/pith-number/G77FINGX7GUHGNMXQGQBRXOMTS/events.json","paper":"https://pith.science/paper/G77FINGX"},"agent_actions":{"view_html":"https://pith.science/pith/G77FINGX7GUHGNMXQGQBRXOMTS","download_json":"https://pith.science/pith/G77FINGX7GUHGNMXQGQBRXOMTS.json","view_paper":"https://pith.science/paper/G77FINGX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03093&json=true","fetch_graph":"https://pith.science/api/pith-number/G77FINGX7GUHGNMXQGQBRXOMTS/graph.json","fetch_events":"https://pith.science/api/pith-number/G77FINGX7GUHGNMXQGQBRXOMTS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G77FINGX7GUHGNMXQGQBRXOMTS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G77FINGX7GUHGNMXQGQBRXOMTS/action/storage_attestation","attest_author":"https://pith.science/pith/G77FINGX7GUHGNMXQGQBRXOMTS/action/author_attestation","sign_citation":"https://pith.science/pith/G77FINGX7GUHGNMXQGQBRXOMTS/action/citation_signature","submit_replication":"https://pith.science/pith/G77FINGX7GUHGNMXQGQBRXOMTS/action/replication_record"}},"created_at":"2026-05-18T00:35:39.419228+00:00","updated_at":"2026-05-18T00:35:39.419228+00:00"}