{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JZI7LQXZMHOBN7QNP7GZGGAYWJ","short_pith_number":"pith:JZI7LQXZ","canonical_record":{"source":{"id":"1112.2318","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-11T04:00:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"273b85112f3e759746d1114273834499207bc8af25683ed033e71e0f528f52c5","abstract_canon_sha256":"ad2e59d5061252cfd374efab6b3fe155ec569fd94fb36ae8fd23f980515593a7"},"schema_version":"1.0"},"canonical_sha256":"4e51f5c2f961dc16fe0d7fcd931818b250b539cea54ae199006f3f06d7ed09b5","source":{"kind":"arxiv","id":"1112.2318","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2318","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2318v2","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2318","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"pith_short_12","alias_value":"JZI7LQXZMHOB","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JZI7LQXZMHOBN7QN","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JZI7LQXZ","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JZI7LQXZMHOBN7QNP7GZGGAYWJ","target":"record","payload":{"canonical_record":{"source":{"id":"1112.2318","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-11T04:00:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"273b85112f3e759746d1114273834499207bc8af25683ed033e71e0f528f52c5","abstract_canon_sha256":"ad2e59d5061252cfd374efab6b3fe155ec569fd94fb36ae8fd23f980515593a7"},"schema_version":"1.0"},"canonical_sha256":"4e51f5c2f961dc16fe0d7fcd931818b250b539cea54ae199006f3f06d7ed09b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:06.360028Z","signature_b64":"GG2aUcwSlCK6g1zXwP19S1KsSyOCCQMGddIdybtLj/pw49NgjAgJP4VsKmF9RZNXvlkAHS3L6yWCHMKQYQfiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e51f5c2f961dc16fe0d7fcd931818b250b539cea54ae199006f3f06d7ed09b5","last_reissued_at":"2026-05-18T03:22:06.359382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:06.359382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.2318","source_version":2,"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:22:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tgk9lk6DWUPE8xDpWCytjD6ZqlmyVnPNC4QlE/n4prtePrxGSa5aNd4/nF07IDeZcOEszxjr1LFw5WA6qNU2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:32:57.580602Z"},"content_sha256":"0cfe51b7b7ac188230e38df1d9e16fd15a55d52b8fedf53862d6ab7102246817","schema_version":"1.0","event_id":"sha256:0cfe51b7b7ac188230e38df1d9e16fd15a55d52b8fedf53862d6ab7102246817"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JZI7LQXZMHOBN7QNP7GZGGAYWJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-rank optimization with trace norm penalty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"B. Mishra, F. Bach, G. Meyer, R. Sepulchre","submitted_at":"2011-12-11T04:00:57Z","abstract_excerpt":"The paper addresses the problem of low-rank trace norm minimization. We propose an algorithm that alternates between fixed-rank optimization and rank-one updates. The fixed-rank optimization is characterized by an efficient factorization that makes the trace norm differentiable in the search space and the computation of duality gap numerically tractable. The search space is nonlinear but is equipped with a particular Riemannian structure that leads to efficient computations. We present a second-order trust-region algorithm with a guaranteed quadratic rate of convergence. Overall, the proposed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2318","kind":"arxiv","version":2},"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:22:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LSEAZJvm5DMDArII/XCpj5Aw/ECvoF6QFrPqukoFzuxlxfJ51X8elrLrJK1fN3MrLtoFaVB+gqTYKr0aCRNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:32:57.580950Z"},"content_sha256":"1599b8da35be20789d24b6df6f0aa984ead240b9f4c65243b80b9972f5690be8","schema_version":"1.0","event_id":"sha256:1599b8da35be20789d24b6df6f0aa984ead240b9f4c65243b80b9972f5690be8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZI7LQXZMHOBN7QNP7GZGGAYWJ/bundle.json","state_url":"https://pith.science/pith/JZI7LQXZMHOBN7QNP7GZGGAYWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZI7LQXZMHOBN7QNP7GZGGAYWJ/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-02T10:32:57Z","links":{"resolver":"https://pith.science/pith/JZI7LQXZMHOBN7QNP7GZGGAYWJ","bundle":"https://pith.science/pith/JZI7LQXZMHOBN7QNP7GZGGAYWJ/bundle.json","state":"https://pith.science/pith/JZI7LQXZMHOBN7QNP7GZGGAYWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZI7LQXZMHOBN7QNP7GZGGAYWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JZI7LQXZMHOBN7QNP7GZGGAYWJ","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":"ad2e59d5061252cfd374efab6b3fe155ec569fd94fb36ae8fd23f980515593a7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-11T04:00:57Z","title_canon_sha256":"273b85112f3e759746d1114273834499207bc8af25683ed033e71e0f528f52c5"},"schema_version":"1.0","source":{"id":"1112.2318","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2318","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2318v2","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2318","created_at":"2026-05-18T03:22:06Z"},{"alias_kind":"pith_short_12","alias_value":"JZI7LQXZMHOB","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JZI7LQXZMHOBN7QN","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JZI7LQXZ","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:1599b8da35be20789d24b6df6f0aa984ead240b9f4c65243b80b9972f5690be8","target":"graph","created_at":"2026-05-18T03:22:06Z","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":"The paper addresses the problem of low-rank trace norm minimization. We propose an algorithm that alternates between fixed-rank optimization and rank-one updates. The fixed-rank optimization is characterized by an efficient factorization that makes the trace norm differentiable in the search space and the computation of duality gap numerically tractable. The search space is nonlinear but is equipped with a particular Riemannian structure that leads to efficient computations. We present a second-order trust-region algorithm with a guaranteed quadratic rate of convergence. Overall, the proposed ","authors_text":"B. Mishra, F. Bach, G. Meyer, R. Sepulchre","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-11T04:00:57Z","title":"Low-rank optimization with trace norm penalty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2318","kind":"arxiv","version":2},"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:0cfe51b7b7ac188230e38df1d9e16fd15a55d52b8fedf53862d6ab7102246817","target":"record","created_at":"2026-05-18T03:22:06Z","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":"ad2e59d5061252cfd374efab6b3fe155ec569fd94fb36ae8fd23f980515593a7","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-11T04:00:57Z","title_canon_sha256":"273b85112f3e759746d1114273834499207bc8af25683ed033e71e0f528f52c5"},"schema_version":"1.0","source":{"id":"1112.2318","kind":"arxiv","version":2}},"canonical_sha256":"4e51f5c2f961dc16fe0d7fcd931818b250b539cea54ae199006f3f06d7ed09b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e51f5c2f961dc16fe0d7fcd931818b250b539cea54ae199006f3f06d7ed09b5","first_computed_at":"2026-05-18T03:22:06.359382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:06.359382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GG2aUcwSlCK6g1zXwP19S1KsSyOCCQMGddIdybtLj/pw49NgjAgJP4VsKmF9RZNXvlkAHS3L6yWCHMKQYQfiCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:06.360028Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2318","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cfe51b7b7ac188230e38df1d9e16fd15a55d52b8fedf53862d6ab7102246817","sha256:1599b8da35be20789d24b6df6f0aa984ead240b9f4c65243b80b9972f5690be8"],"state_sha256":"63713f6867dfa3459c6388f84a897ea75c7a0fff54e87ed5eb8eed5cf448db1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"55OVVea5RG7KsVjnF45/1+frja8+IAnVzJ1ngVB5N+1/JfwcjtEdyhrfIhtSA+jvQdnIwAMWT5d66bGVkMNmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:32:57.582917Z","bundle_sha256":"be521bda277b78fa27f21c63b4ea8648d7b5fa549d9f3779f9b87e8abeb832db"}}