{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3GRBVGLHPR3UK542OTB4DKI3DM","short_pith_number":"pith:3GRBVGLH","canonical_record":{"source":{"id":"1406.3190","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-12T10:49:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3a083c5601a0b5f23f43b600c219e66d2c2b5ebfae5360964b4cdae8a4ec5edc","abstract_canon_sha256":"58665faa2e63b32e558303ef223a90244621fda351b0f64f20a5a5e3bf65550c"},"schema_version":"1.0"},"canonical_sha256":"d9a21a99677c7745779a74c3c1a91b1b0216d639b4f0a5dfaf845c88d2cae8bb","source":{"kind":"arxiv","id":"1406.3190","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3190","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3190v4","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3190","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"3GRBVGLHPR3U","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3GRBVGLHPR3UK542","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3GRBVGLH","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3GRBVGLHPR3UK542OTB4DKI3DM","target":"record","payload":{"canonical_record":{"source":{"id":"1406.3190","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-12T10:49:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3a083c5601a0b5f23f43b600c219e66d2c2b5ebfae5360964b4cdae8a4ec5edc","abstract_canon_sha256":"58665faa2e63b32e558303ef223a90244621fda351b0f64f20a5a5e3bf65550c"},"schema_version":"1.0"},"canonical_sha256":"d9a21a99677c7745779a74c3c1a91b1b0216d639b4f0a5dfaf845c88d2cae8bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:53.474000Z","signature_b64":"kTqT6Ic9V9TvB4RCEWsW5owInS/Nkb54PonGGRnwqAKnGGxQ5BXiXErtrHjuic7aIks22K57mCOe1wZRTeO+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9a21a99677c7745779a74c3c1a91b1b0216d639b4f0a5dfaf845c88d2cae8bb","last_reissued_at":"2026-05-18T01:14:53.473335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:53.473335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.3190","source_version":4,"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-18T01:14:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LgD2PQ31l2w+3YoGWGnoWq0UZyyc8dCYe2oWbHfsFi7eMWVIOoLm9HIAyvfc06LV8bIGipwd8s+zYcZLEtHhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:00:35.773920Z"},"content_sha256":"3f9db37ca7c1519acab0127803104a312fa1c0763076285fc5083ac2d5748391","schema_version":"1.0","event_id":"sha256:3f9db37ca7c1519acab0127803104a312fa1c0763076285fc5083ac2d5748391"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3GRBVGLHPR3UK542OTB4DKI3DM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Optimization for Large-Scale Max-Norm Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Huan Xu, Jie Shen, Ping Li","submitted_at":"2014-06-12T10:49:50Z","abstract_excerpt":"Max-norm regularizer has been extensively studied in the last decade as it promotes an effective low-rank estimation for the underlying data. However, such max-norm regularized problems are typically formulated and solved in a batch manner, which prevents it from processing big data due to possible memory budget. In this paper, hence, we propose an online algorithm that is scalable to large-scale setting. Particularly, we consider the matrix decomposition problem as an example, although a simple variant of the algorithm and analysis can be adapted to other important problems such as matrix com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3190","kind":"arxiv","version":4},"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-18T01:14:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X/tsv2AZB+D1pmU+d4nepqrG28ADLzLNcpzSqsHj3ElCOQBMeG6B/XzLnBhgCdwc79u0qySUU1/HTvirtglRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:00:35.774269Z"},"content_sha256":"4c3428c0109d66bbfb42854b32df67bec8a4448b211837a19fd378c919117899","schema_version":"1.0","event_id":"sha256:4c3428c0109d66bbfb42854b32df67bec8a4448b211837a19fd378c919117899"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GRBVGLHPR3UK542OTB4DKI3DM/bundle.json","state_url":"https://pith.science/pith/3GRBVGLHPR3UK542OTB4DKI3DM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GRBVGLHPR3UK542OTB4DKI3DM/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-06-06T16:00:35Z","links":{"resolver":"https://pith.science/pith/3GRBVGLHPR3UK542OTB4DKI3DM","bundle":"https://pith.science/pith/3GRBVGLHPR3UK542OTB4DKI3DM/bundle.json","state":"https://pith.science/pith/3GRBVGLHPR3UK542OTB4DKI3DM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GRBVGLHPR3UK542OTB4DKI3DM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3GRBVGLHPR3UK542OTB4DKI3DM","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":"58665faa2e63b32e558303ef223a90244621fda351b0f64f20a5a5e3bf65550c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-12T10:49:50Z","title_canon_sha256":"3a083c5601a0b5f23f43b600c219e66d2c2b5ebfae5360964b4cdae8a4ec5edc"},"schema_version":"1.0","source":{"id":"1406.3190","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3190","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3190v4","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3190","created_at":"2026-05-18T01:14:53Z"},{"alias_kind":"pith_short_12","alias_value":"3GRBVGLHPR3U","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3GRBVGLHPR3UK542","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3GRBVGLH","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:4c3428c0109d66bbfb42854b32df67bec8a4448b211837a19fd378c919117899","target":"graph","created_at":"2026-05-18T01:14:53Z","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":"Max-norm regularizer has been extensively studied in the last decade as it promotes an effective low-rank estimation for the underlying data. However, such max-norm regularized problems are typically formulated and solved in a batch manner, which prevents it from processing big data due to possible memory budget. In this paper, hence, we propose an online algorithm that is scalable to large-scale setting. Particularly, we consider the matrix decomposition problem as an example, although a simple variant of the algorithm and analysis can be adapted to other important problems such as matrix com","authors_text":"Huan Xu, Jie Shen, Ping Li","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-12T10:49:50Z","title":"Online Optimization for Large-Scale Max-Norm Regularization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3190","kind":"arxiv","version":4},"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:3f9db37ca7c1519acab0127803104a312fa1c0763076285fc5083ac2d5748391","target":"record","created_at":"2026-05-18T01:14:53Z","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":"58665faa2e63b32e558303ef223a90244621fda351b0f64f20a5a5e3bf65550c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-12T10:49:50Z","title_canon_sha256":"3a083c5601a0b5f23f43b600c219e66d2c2b5ebfae5360964b4cdae8a4ec5edc"},"schema_version":"1.0","source":{"id":"1406.3190","kind":"arxiv","version":4}},"canonical_sha256":"d9a21a99677c7745779a74c3c1a91b1b0216d639b4f0a5dfaf845c88d2cae8bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9a21a99677c7745779a74c3c1a91b1b0216d639b4f0a5dfaf845c88d2cae8bb","first_computed_at":"2026-05-18T01:14:53.473335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:53.473335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kTqT6Ic9V9TvB4RCEWsW5owInS/Nkb54PonGGRnwqAKnGGxQ5BXiXErtrHjuic7aIks22K57mCOe1wZRTeO+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:53.474000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3190","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f9db37ca7c1519acab0127803104a312fa1c0763076285fc5083ac2d5748391","sha256:4c3428c0109d66bbfb42854b32df67bec8a4448b211837a19fd378c919117899"],"state_sha256":"b2acee68524efb7196e17aec450dd01f78831ced2a0f9091749808cc42fddb6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B6LDl5s+AhT0L1ZTlTTVDCB5a1Zu3LBVnhPiIrGAVtJ0A2vWSLIru6RIs7nmJ1ZXSV+f9dsKRKjSyIl7zZekDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:00:35.776151Z","bundle_sha256":"8c78f9fbbf60efa39c4fa96885ae6fcb494b9ebcfd65720131a6558b90743743"}}