{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PP2BTM6KBEORB2SYTAH6ABSDJ4","short_pith_number":"pith:PP2BTM6K","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"},"canonical_sha256":"7bf419b3ca091d10ea58980fe006434f33f80d4b25526e44b7a7121555e7df1f","source":{"kind":"arxiv","id":"1204.0136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0136","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0136v1","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0136","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"PP2BTM6KBEOR","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PP2BTM6KBEORB2SY","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PP2BTM6K","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PP2BTM6KBEORB2SYTAH6ABSDJ4","target":"record","payload":{"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"},"canonical_sha256":"7bf419b3ca091d10ea58980fe006434f33f80d4b25526e44b7a7121555e7df1f","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"},"source_kind":"arxiv","source_id":"1204.0136","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0hASkzBmb8qNE7ZA8WqxGMsEVZsMoxrcDBp6/rYum/Dj1cp0RBvGPse5mdCGlmrtGLQh8AiMBbT4LBQ85etNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:31:04.756547Z"},"content_sha256":"6f685c52a71d4a236f99fe84d4217fa34da98ef0e2564050d2b010cc34a67a3c","schema_version":"1.0","event_id":"sha256:6f685c52a71d4a236f99fe84d4217fa34da98ef0e2564050d2b010cc34a67a3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PP2BTM6KBEORB2SYTAH6ABSDJ4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qz9TwDx5CsTLXK3xSSPOn9c1f4+xS/r5yVolJnke2UL+etY4Y/AALGZZd6sYgD8BaOSJTD0xt6N4DInGu6cSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:31:04.756896Z"},"content_sha256":"452dd11cdead2474098a304695d84e095ccfb034496340950ed297f4f8f1c776","schema_version":"1.0","event_id":"sha256:452dd11cdead2474098a304695d84e095ccfb034496340950ed297f4f8f1c776"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4/bundle.json","state_url":"https://pith.science/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T13:31:04Z","links":{"resolver":"https://pith.science/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4","bundle":"https://pith.science/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4/bundle.json","state":"https://pith.science/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PP2BTM6KBEORB2SYTAH6ABSDJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PP2BTM6KBEORB2SYTAH6ABSDJ4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"52d95ee6c8c72fb4ad20c1f79f9cca6a1d25f3a47d5b8d7f7e2e13dfe7882a55","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-31T21:15:28Z","title_canon_sha256":"1edaa1b1656e2a85c470ca50509be6998800ad773de534ffbd2371f0b0bc434d"},"schema_version":"1.0","source":{"id":"1204.0136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0136","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0136v1","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0136","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"PP2BTM6KBEOR","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PP2BTM6KBEORB2SY","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PP2BTM6K","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:452dd11cdead2474098a304695d84e095ccfb034496340950ed297f4f8f1c776","target":"graph","created_at":"2026-05-18T03:58:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Elad Hazan, Satyen Kale, Shai Shalev-Shwartz","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-31T21:15:28Z","title":"Near-Optimal Algorithms for Online Matrix Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0136","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6f685c52a71d4a236f99fe84d4217fa34da98ef0e2564050d2b010cc34a67a3c","target":"record","created_at":"2026-05-18T03:58:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"52d95ee6c8c72fb4ad20c1f79f9cca6a1d25f3a47d5b8d7f7e2e13dfe7882a55","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-31T21:15:28Z","title_canon_sha256":"1edaa1b1656e2a85c470ca50509be6998800ad773de534ffbd2371f0b0bc434d"},"schema_version":"1.0","source":{"id":"1204.0136","kind":"arxiv","version":1}},"canonical_sha256":"7bf419b3ca091d10ea58980fe006434f33f80d4b25526e44b7a7121555e7df1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bf419b3ca091d10ea58980fe006434f33f80d4b25526e44b7a7121555e7df1f","first_computed_at":"2026-05-18T03:58:50.269216Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:50.269216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9fFQj+3XbD8v69nmIq2KPiK7h7P3igrXCZvIY2Z+wY/YP/bWtvhIDRfD5PJhNXXArIkPSqYEhxpNeJ6SFaANAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:50.270222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f685c52a71d4a236f99fe84d4217fa34da98ef0e2564050d2b010cc34a67a3c","sha256:452dd11cdead2474098a304695d84e095ccfb034496340950ed297f4f8f1c776"],"state_sha256":"3cd66901fcc79fc8ba96a0b5f90c433eaf56bd96db2f4ded4ab9492122b1d379"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aYEL1iur/COX8NtleQ4YZ8I+eQVBvWV+ytc/sS5fIe49B/EyohU/n8svwpwR9Xs4eLo91bPp9QXxGAT6DpaADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:31:04.758874Z","bundle_sha256":"0c130adcdc608519248c93b0efac8f9d8f4fbac2f747862f3fe84ec122658971"}}