{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HNPEBWOCPIAFKB4Q6AZMCSGKBA","short_pith_number":"pith:HNPEBWOC","schema_version":"1.0","canonical_sha256":"3b5e40d9c27a00550790f032c148ca082f48be94cf2e1c32503e828e9fdfc56a","source":{"kind":"arxiv","id":"2202.07574","version":1},"attestation_state":"computed","paper":{"title":"Damped Online Newton Step for Portfolio Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Alexander Rakhlin, Zakaria Mhammedi","submitted_at":"2022-02-15T17:01:55Z","abstract_excerpt":"We revisit the classic online portfolio selection problem, where at each round a learner selects a distribution over a set of portfolios to allocate its wealth. It is known that for this problem a logarithmic regret with respect to Cover's loss is achievable using the Universal Portfolio Selection algorithm, for example. However, all existing algorithms that achieve a logarithmic regret for this problem have per-round time and space complexities that scale polynomially with the total number of rounds, making them impractical. In this paper, we build on the recent work by Haipeng et al. 2018 an"},"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":"2202.07574","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-15T17:01:55Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7f37419f27f5373532d7210b0ac72d1a0a9441e33e1267931334db0dd485bb6d","abstract_canon_sha256":"d5c6c9fa83b00f2cbc342ced1b5676b988b508e6faed92107343c559f07ee05f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:57:01.420053Z","signature_b64":"FTsV5wCkZBvjP+VX506UuDahtZfGOGamPfTzSUpJ6k7C5FC2TLTH+jDuqAeSM8TeFlqhPUwjuRGrhvEUcgisDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b5e40d9c27a00550790f032c148ca082f48be94cf2e1c32503e828e9fdfc56a","last_reissued_at":"2026-07-05T03:57:01.419556Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:57:01.419556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Damped Online Newton Step for Portfolio Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Alexander Rakhlin, Zakaria Mhammedi","submitted_at":"2022-02-15T17:01:55Z","abstract_excerpt":"We revisit the classic online portfolio selection problem, where at each round a learner selects a distribution over a set of portfolios to allocate its wealth. It is known that for this problem a logarithmic regret with respect to Cover's loss is achievable using the Universal Portfolio Selection algorithm, for example. However, all existing algorithms that achieve a logarithmic regret for this problem have per-round time and space complexities that scale polynomially with the total number of rounds, making them impractical. In this paper, we build on the recent work by Haipeng et al. 2018 an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.07574","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.07574/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":"2202.07574","created_at":"2026-07-05T03:57:01.419616+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.07574v1","created_at":"2026-07-05T03:57:01.419616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.07574","created_at":"2026-07-05T03:57:01.419616+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNPEBWOCPIAF","created_at":"2026-07-05T03:57:01.419616+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNPEBWOCPIAFKB4Q","created_at":"2026-07-05T03:57:01.419616+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNPEBWOC","created_at":"2026-07-05T03:57:01.419616+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/HNPEBWOCPIAFKB4Q6AZMCSGKBA","json":"https://pith.science/pith/HNPEBWOCPIAFKB4Q6AZMCSGKBA.json","graph_json":"https://pith.science/api/pith-number/HNPEBWOCPIAFKB4Q6AZMCSGKBA/graph.json","events_json":"https://pith.science/api/pith-number/HNPEBWOCPIAFKB4Q6AZMCSGKBA/events.json","paper":"https://pith.science/paper/HNPEBWOC"},"agent_actions":{"view_html":"https://pith.science/pith/HNPEBWOCPIAFKB4Q6AZMCSGKBA","download_json":"https://pith.science/pith/HNPEBWOCPIAFKB4Q6AZMCSGKBA.json","view_paper":"https://pith.science/paper/HNPEBWOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.07574&json=true","fetch_graph":"https://pith.science/api/pith-number/HNPEBWOCPIAFKB4Q6AZMCSGKBA/graph.json","fetch_events":"https://pith.science/api/pith-number/HNPEBWOCPIAFKB4Q6AZMCSGKBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNPEBWOCPIAFKB4Q6AZMCSGKBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNPEBWOCPIAFKB4Q6AZMCSGKBA/action/storage_attestation","attest_author":"https://pith.science/pith/HNPEBWOCPIAFKB4Q6AZMCSGKBA/action/author_attestation","sign_citation":"https://pith.science/pith/HNPEBWOCPIAFKB4Q6AZMCSGKBA/action/citation_signature","submit_replication":"https://pith.science/pith/HNPEBWOCPIAFKB4Q6AZMCSGKBA/action/replication_record"}},"created_at":"2026-07-05T03:57:01.419616+00:00","updated_at":"2026-07-05T03:57:01.419616+00:00"}