{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IXURSGPXIMHPBU3QPZMVJF4FYS","short_pith_number":"pith:IXURSGPX","canonical_record":{"source":{"id":"1704.07352","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-24T17:47:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6a60830a1d8ef4b9995260b49cfbefbc086b2edd76dcb196148959226cabcbf4","abstract_canon_sha256":"7c04d6362d6928617b120107d4d7b03aa5ff6d886c219d6a6470c4e88dd5ccf4"},"schema_version":"1.0"},"canonical_sha256":"45e91919f7430ef0d3707e59549785c4afd10840d68e04082ad2c4d7f3145c08","source":{"kind":"arxiv","id":"1704.07352","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07352","created_at":"2026-05-18T00:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07352v5","created_at":"2026-05-18T00:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07352","created_at":"2026-05-18T00:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"IXURSGPXIMHP","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IXURSGPXIMHPBU3Q","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IXURSGPX","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IXURSGPXIMHPBU3QPZMVJF4FYS","target":"record","payload":{"canonical_record":{"source":{"id":"1704.07352","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-24T17:47:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6a60830a1d8ef4b9995260b49cfbefbc086b2edd76dcb196148959226cabcbf4","abstract_canon_sha256":"7c04d6362d6928617b120107d4d7b03aa5ff6d886c219d6a6470c4e88dd5ccf4"},"schema_version":"1.0"},"canonical_sha256":"45e91919f7430ef0d3707e59549785c4afd10840d68e04082ad2c4d7f3145c08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:11.244906Z","signature_b64":"3qIuF+tJZ5+QxOoxSJ9X2Y5U4K2F2BKMdEbKG2PwiAIdLT2/a4ezCxX2I1iNim5HpjNmlYfBmWidPPYbLPydBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45e91919f7430ef0d3707e59549785c4afd10840d68e04082ad2c4d7f3145c08","last_reissued_at":"2026-05-18T00:13:11.244068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:11.244068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.07352","source_version":5,"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-18T00:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FwE9qe+NfHW8yD/QBkgKBeGOH5O3/jD1bLUbRz8oYrD1Z5LIAyRli1NA8rfYJbbSom7kTB2l2ZHWCT0FIOYMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:09:50.871345Z"},"content_sha256":"98f0102df141243f70f4653ec8b75af1ddf4c564d7af20d69ee93741963b12e8","schema_version":"1.0","event_id":"sha256:98f0102df141243f70f4653ec8b75af1ddf4c564d7af20d69ee93741963b12e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IXURSGPXIMHPBU3QPZMVJF4FYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structured low-rank matrix learning: algorithms and applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bamdev Mishra, Pratik Jawanpuria","submitted_at":"2017-04-24T17:47:29Z","abstract_excerpt":"We consider the problem of learning a low-rank matrix, constrained to lie in a linear subspace, and introduce a novel factorization for modeling such matrices. A salient feature of the proposed factorization scheme is it decouples the low-rank and the structural constraints onto separate factors. We formulate the optimization problem on the Riemannian spectrahedron manifold, where the Riemannian framework allows to develop computationally efficient conjugate gradient and trust-region algorithms. Experiments on problems such as standard/robust/non-negative matrix completion, Hankel matrix learn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07352","kind":"arxiv","version":5},"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-18T00:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EkEDda1BFn7BBv/ZPA2OuATazOmIMdT90u2tyrrSBrWuXuGf2gpmRE55GSiIDmdfxJEYVpzHunMqRYXm2eO5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:09:50.871694Z"},"content_sha256":"f798e02b57022f3620691698f7042d8335db3c88411bea472226c449d74fd420","schema_version":"1.0","event_id":"sha256:f798e02b57022f3620691698f7042d8335db3c88411bea472226c449d74fd420"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IXURSGPXIMHPBU3QPZMVJF4FYS/bundle.json","state_url":"https://pith.science/pith/IXURSGPXIMHPBU3QPZMVJF4FYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IXURSGPXIMHPBU3QPZMVJF4FYS/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-01T19:09:50Z","links":{"resolver":"https://pith.science/pith/IXURSGPXIMHPBU3QPZMVJF4FYS","bundle":"https://pith.science/pith/IXURSGPXIMHPBU3QPZMVJF4FYS/bundle.json","state":"https://pith.science/pith/IXURSGPXIMHPBU3QPZMVJF4FYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IXURSGPXIMHPBU3QPZMVJF4FYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IXURSGPXIMHPBU3QPZMVJF4FYS","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":"7c04d6362d6928617b120107d4d7b03aa5ff6d886c219d6a6470c4e88dd5ccf4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-24T17:47:29Z","title_canon_sha256":"6a60830a1d8ef4b9995260b49cfbefbc086b2edd76dcb196148959226cabcbf4"},"schema_version":"1.0","source":{"id":"1704.07352","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.07352","created_at":"2026-05-18T00:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"1704.07352v5","created_at":"2026-05-18T00:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.07352","created_at":"2026-05-18T00:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"IXURSGPXIMHP","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IXURSGPXIMHPBU3Q","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IXURSGPX","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:f798e02b57022f3620691698f7042d8335db3c88411bea472226c449d74fd420","target":"graph","created_at":"2026-05-18T00:13:11Z","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":"We consider the problem of learning a low-rank matrix, constrained to lie in a linear subspace, and introduce a novel factorization for modeling such matrices. A salient feature of the proposed factorization scheme is it decouples the low-rank and the structural constraints onto separate factors. We formulate the optimization problem on the Riemannian spectrahedron manifold, where the Riemannian framework allows to develop computationally efficient conjugate gradient and trust-region algorithms. Experiments on problems such as standard/robust/non-negative matrix completion, Hankel matrix learn","authors_text":"Bamdev Mishra, Pratik Jawanpuria","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-24T17:47:29Z","title":"Structured low-rank matrix learning: algorithms and applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.07352","kind":"arxiv","version":5},"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:98f0102df141243f70f4653ec8b75af1ddf4c564d7af20d69ee93741963b12e8","target":"record","created_at":"2026-05-18T00:13:11Z","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":"7c04d6362d6928617b120107d4d7b03aa5ff6d886c219d6a6470c4e88dd5ccf4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-24T17:47:29Z","title_canon_sha256":"6a60830a1d8ef4b9995260b49cfbefbc086b2edd76dcb196148959226cabcbf4"},"schema_version":"1.0","source":{"id":"1704.07352","kind":"arxiv","version":5}},"canonical_sha256":"45e91919f7430ef0d3707e59549785c4afd10840d68e04082ad2c4d7f3145c08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45e91919f7430ef0d3707e59549785c4afd10840d68e04082ad2c4d7f3145c08","first_computed_at":"2026-05-18T00:13:11.244068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:11.244068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3qIuF+tJZ5+QxOoxSJ9X2Y5U4K2F2BKMdEbKG2PwiAIdLT2/a4ezCxX2I1iNim5HpjNmlYfBmWidPPYbLPydBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:11.244906Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.07352","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98f0102df141243f70f4653ec8b75af1ddf4c564d7af20d69ee93741963b12e8","sha256:f798e02b57022f3620691698f7042d8335db3c88411bea472226c449d74fd420"],"state_sha256":"957009b1f7115244ff754fec399e1f009094a6b60acf7c8b14d42c3573dcaaa6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YCHdcfDXWF5HPnNfhyBlT/YrKfB+kYU9J/TqzpZiACwG20UhvQ39zVt9I8NdxNY5+yLB79ba4N6DMHF43yVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:09:50.873700Z","bundle_sha256":"29cda043fca39e5f6f8571fb926121c3771b054a5394a7e9fbc106df97ea69b7"}}