{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PP2BTM6KBEORB2SYTAH6ABSDJ4","short_pith_number":"pith:PP2BTM6K","schema_version":"1.0","canonical_sha256":"7bf419b3ca091d10ea58980fe006434f33f80d4b25526e44b7a7121555e7df1f","source":{"kind":"arxiv","id":"1204.0136","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Algorithms for Online Matrix Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Elad Hazan, Satyen Kale, Shai Shalev-Shwartz","submitted_at":"2012-03-31T21:15:28Z","abstract_excerpt":"In several online prediction problems of recent interest the comparison class is composed of matrices with bounded entries. For example, in the online max-cut problem, the comparison class is matrices which represent cuts of a given graph and in online gambling the comparison class is matrices which represent permutations over n teams. Another important example is online collaborative filtering in which a widely used comparison class is the set of matrices with a small trace norm. In this paper we isolate a property of matrices, which we call (beta,tau)-decomposability, and derive an efficient"},"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":"1204.0136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-31T21:15:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1edaa1b1656e2a85c470ca50509be6998800ad773de534ffbd2371f0b0bc434d","abstract_canon_sha256":"52d95ee6c8c72fb4ad20c1f79f9cca6a1d25f3a47d5b8d7f7e2e13dfe7882a55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:50.270222Z","signature_b64":"9fFQj+3XbD8v69nmIq2KPiK7h7P3igrXCZvIY2Z+wY/YP/bWtvhIDRfD5PJhNXXArIkPSqYEhxpNeJ6SFaANAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bf419b3ca091d10ea58980fe006434f33f80d4b25526e44b7a7121555e7df1f","last_reissued_at":"2026-05-18T03:58:50.269216Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:50.269216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Algorithms for Online Matrix Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Elad Hazan, Satyen Kale, Shai Shalev-Shwartz","submitted_at":"2012-03-31T21:15:28Z","abstract_excerpt":"In several online prediction problems of recent interest the comparison class is composed of matrices with bounded entries. For example, in the online max-cut problem, the comparison class is matrices which represent cuts of a given graph and in online gambling the comparison class is matrices which represent permutations over n teams. Another important example is online collaborative filtering in which a widely used comparison class is the set of matrices with a small trace norm. In this paper we isolate a property of matrices, which we call (beta,tau)-decomposability, and derive an efficient"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0136","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":"1204.0136","created_at":"2026-05-18T03:58:50.269397+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0136v1","created_at":"2026-05-18T03:58:50.269397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0136","created_at":"2026-05-18T03:58:50.269397+00:00"},{"alias_kind":"pith_short_12","alias_value":"PP2BTM6KBEOR","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PP2BTM6KBEORB2SY","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PP2BTM6K","created_at":"2026-05-18T12:27:18.751474+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/PP2BTM6KBEORB2SYTAH6ABSDJ4","json":"https://pith.science/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4.json","graph_json":"https://pith.science/api/pith-number/PP2BTM6KBEORB2SYTAH6ABSDJ4/graph.json","events_json":"https://pith.science/api/pith-number/PP2BTM6KBEORB2SYTAH6ABSDJ4/events.json","paper":"https://pith.science/paper/PP2BTM6K"},"agent_actions":{"view_html":"https://pith.science/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4","download_json":"https://pith.science/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4.json","view_paper":"https://pith.science/paper/PP2BTM6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0136&json=true","fetch_graph":"https://pith.science/api/pith-number/PP2BTM6KBEORB2SYTAH6ABSDJ4/graph.json","fetch_events":"https://pith.science/api/pith-number/PP2BTM6KBEORB2SYTAH6ABSDJ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4/action/storage_attestation","attest_author":"https://pith.science/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4/action/author_attestation","sign_citation":"https://pith.science/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4/action/citation_signature","submit_replication":"https://pith.science/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4/action/replication_record"}},"created_at":"2026-05-18T03:58:50.269397+00:00","updated_at":"2026-05-18T03:58:50.269397+00:00"}