{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EQBAWGCG5AHNCVSXI4RZFAO3Y4","short_pith_number":"pith:EQBAWGCG","schema_version":"1.0","canonical_sha256":"24020b1846e80ed1565747239281dbc723f5b68befdc34cd1f72e7a742a03033","source":{"kind":"arxiv","id":"1604.02137","version":1},"attestation_state":"computed","paper":{"title":"Online Learning of Feasible Strategies in Unknown Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.OC","authors_text":"Alejandro Ribeiro, Santiago Paternain","submitted_at":"2016-04-07T19:51:58Z","abstract_excerpt":"Define an environment as a set of convex constraint functions that vary arbitrarily over time and consider a cost function that is also convex and arbitrarily varying. Agents that operate in this environment intend to select actions that are feasible for all times while minimizing the cost's time average. Such action is said optimal and can be computed offline if the cost and the environment are known a priori. An online policy is one that depends causally on the cost and the environment. To compare online policies to the optimal offline action define the fit of a trajectory as a vector that i"},"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":"1604.02137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-07T19:51:58Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"cbfc69078b7be3e22ebc6b457958c8cad86a36ddb54720e3f30acc65db981b5f","abstract_canon_sha256":"3891bc717df08748b9fd9a16a452851e992585da6992643cd52e2c3fd916d3c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:31.191103Z","signature_b64":"rIJVWUba3hQ2bzXgStsYxpG8pdwsfbW4Olnx1XayYYqDb/IdPg1JhmyJVz6nVzGC0+FNP991j61iIUrAEVZIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24020b1846e80ed1565747239281dbc723f5b68befdc34cd1f72e7a742a03033","last_reissued_at":"2026-05-18T01:17:31.190429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:31.190429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Learning of Feasible Strategies in Unknown Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.OC","authors_text":"Alejandro Ribeiro, Santiago Paternain","submitted_at":"2016-04-07T19:51:58Z","abstract_excerpt":"Define an environment as a set of convex constraint functions that vary arbitrarily over time and consider a cost function that is also convex and arbitrarily varying. Agents that operate in this environment intend to select actions that are feasible for all times while minimizing the cost's time average. Such action is said optimal and can be computed offline if the cost and the environment are known a priori. An online policy is one that depends causally on the cost and the environment. To compare online policies to the optimal offline action define the fit of a trajectory as a vector that i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02137","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":"1604.02137","created_at":"2026-05-18T01:17:31.190521+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02137v1","created_at":"2026-05-18T01:17:31.190521+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02137","created_at":"2026-05-18T01:17:31.190521+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQBAWGCG5AHN","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQBAWGCG5AHNCVSX","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQBAWGCG","created_at":"2026-05-18T12:30:12.583610+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/EQBAWGCG5AHNCVSXI4RZFAO3Y4","json":"https://pith.science/pith/EQBAWGCG5AHNCVSXI4RZFAO3Y4.json","graph_json":"https://pith.science/api/pith-number/EQBAWGCG5AHNCVSXI4RZFAO3Y4/graph.json","events_json":"https://pith.science/api/pith-number/EQBAWGCG5AHNCVSXI4RZFAO3Y4/events.json","paper":"https://pith.science/paper/EQBAWGCG"},"agent_actions":{"view_html":"https://pith.science/pith/EQBAWGCG5AHNCVSXI4RZFAO3Y4","download_json":"https://pith.science/pith/EQBAWGCG5AHNCVSXI4RZFAO3Y4.json","view_paper":"https://pith.science/paper/EQBAWGCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02137&json=true","fetch_graph":"https://pith.science/api/pith-number/EQBAWGCG5AHNCVSXI4RZFAO3Y4/graph.json","fetch_events":"https://pith.science/api/pith-number/EQBAWGCG5AHNCVSXI4RZFAO3Y4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQBAWGCG5AHNCVSXI4RZFAO3Y4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQBAWGCG5AHNCVSXI4RZFAO3Y4/action/storage_attestation","attest_author":"https://pith.science/pith/EQBAWGCG5AHNCVSXI4RZFAO3Y4/action/author_attestation","sign_citation":"https://pith.science/pith/EQBAWGCG5AHNCVSXI4RZFAO3Y4/action/citation_signature","submit_replication":"https://pith.science/pith/EQBAWGCG5AHNCVSXI4RZFAO3Y4/action/replication_record"}},"created_at":"2026-05-18T01:17:31.190521+00:00","updated_at":"2026-05-18T01:17:31.190521+00:00"}