{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZBONCOYV56L5FYKAJRGUMEZXD7","short_pith_number":"pith:ZBONCOYV","canonical_record":{"source":{"id":"1804.10653","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-27T19:16:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"81c9bceb83ef403d1ea6dab5532960eccd4bf1a9da383ca60d6e590902f3c901","abstract_canon_sha256":"df3de176582b4dec2deb3a28c6f2ef7337edf1191fca67e44a37c3a9de66df77"},"schema_version":"1.0"},"canonical_sha256":"c85cd13b15ef97d2e1404c4d4613371fd701f0f816cf1aa2481b158507207743","source":{"kind":"arxiv","id":"1804.10653","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10653","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10653v2","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10653","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZBONCOYV56L5","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"ZBONCOYV56L5FYKA","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"ZBONCOYV","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZBONCOYV56L5FYKAJRGUMEZXD7","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10653","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-27T19:16:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"81c9bceb83ef403d1ea6dab5532960eccd4bf1a9da383ca60d6e590902f3c901","abstract_canon_sha256":"df3de176582b4dec2deb3a28c6f2ef7337edf1191fca67e44a37c3a9de66df77"},"schema_version":"1.0"},"canonical_sha256":"c85cd13b15ef97d2e1404c4d4613371fd701f0f816cf1aa2481b158507207743","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:56.040644Z","signature_b64":"rghN+mM928JlJ11G7iGz091Ty5i+qGxzQAzSMaFWkgwFVC0JuT3qHkYtS5ZVV779B1IwVVBbrPtEyvb0Y16OAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c85cd13b15ef97d2e1404c4d4613371fd701f0f816cf1aa2481b158507207743","last_reissued_at":"2026-05-18T00:03:56.040057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:56.040057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10653","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-18T00:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gX4/zHt//YgVB21tTH+G7skb2bBZr23uZW8ZZ/cf0EfuoF0ko03mem2+UksYKqZunlxI7FOZn7LV3dsGMwNsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T19:55:41.453513Z"},"content_sha256":"25b014bda542f469751ef181786eadb37211588aa88e68102b569b666f08be14","schema_version":"1.0","event_id":"sha256:25b014bda542f469751ef181786eadb37211588aa88e68102b569b666f08be14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZBONCOYV56L5FYKAJRGUMEZXD7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Group Inductive Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Boris Shirokikh, Gennady Fedonin, Ivan Nazarov, Maria Burkina, Maxim Panov","submitted_at":"2018-04-27T19:16:46Z","abstract_excerpt":"We consider the problem of matrix completion with side information (\\textit{inductive matrix completion}). In real-world applications many side-channel features are typically non-informative making feature selection an important part of the problem. We incorporate feature selection into inductive matrix completion by proposing a matrix factorization framework with group-lasso regularization on side feature parameter matrices. We demonstrate, that the theoretical sample complexity for the proposed method is much lower compared to its competitors in sparse problems, and propose an efficient opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10653","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-18T00:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbSYj8ruN6Q3DqeT8GUNFYhq+lYqLmXpeRxG3BbWIn4Ih5T0kSUZSLUSOk0jE+iddD55rD1iRE7+x047sXHoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T19:55:41.453863Z"},"content_sha256":"0fcb4391347fb3dfb8e34cc2f40f2826b4309523495fb4fa655fba9ce58f619d","schema_version":"1.0","event_id":"sha256:0fcb4391347fb3dfb8e34cc2f40f2826b4309523495fb4fa655fba9ce58f619d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBONCOYV56L5FYKAJRGUMEZXD7/bundle.json","state_url":"https://pith.science/pith/ZBONCOYV56L5FYKAJRGUMEZXD7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBONCOYV56L5FYKAJRGUMEZXD7/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-07-01T19:55:41Z","links":{"resolver":"https://pith.science/pith/ZBONCOYV56L5FYKAJRGUMEZXD7","bundle":"https://pith.science/pith/ZBONCOYV56L5FYKAJRGUMEZXD7/bundle.json","state":"https://pith.science/pith/ZBONCOYV56L5FYKAJRGUMEZXD7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBONCOYV56L5FYKAJRGUMEZXD7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZBONCOYV56L5FYKAJRGUMEZXD7","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":"df3de176582b4dec2deb3a28c6f2ef7337edf1191fca67e44a37c3a9de66df77","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-27T19:16:46Z","title_canon_sha256":"81c9bceb83ef403d1ea6dab5532960eccd4bf1a9da383ca60d6e590902f3c901"},"schema_version":"1.0","source":{"id":"1804.10653","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10653","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10653v2","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10653","created_at":"2026-05-18T00:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"ZBONCOYV56L5","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"ZBONCOYV56L5FYKA","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"ZBONCOYV","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:0fcb4391347fb3dfb8e34cc2f40f2826b4309523495fb4fa655fba9ce58f619d","target":"graph","created_at":"2026-05-18T00:03:56Z","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 matrix completion with side information (\\textit{inductive matrix completion}). In real-world applications many side-channel features are typically non-informative making feature selection an important part of the problem. We incorporate feature selection into inductive matrix completion by proposing a matrix factorization framework with group-lasso regularization on side feature parameter matrices. We demonstrate, that the theoretical sample complexity for the proposed method is much lower compared to its competitors in sparse problems, and propose an efficient opti","authors_text":"Boris Shirokikh, Gennady Fedonin, Ivan Nazarov, Maria Burkina, Maxim Panov","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-27T19:16:46Z","title":"Sparse Group Inductive Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10653","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:25b014bda542f469751ef181786eadb37211588aa88e68102b569b666f08be14","target":"record","created_at":"2026-05-18T00:03:56Z","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":"df3de176582b4dec2deb3a28c6f2ef7337edf1191fca67e44a37c3a9de66df77","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-27T19:16:46Z","title_canon_sha256":"81c9bceb83ef403d1ea6dab5532960eccd4bf1a9da383ca60d6e590902f3c901"},"schema_version":"1.0","source":{"id":"1804.10653","kind":"arxiv","version":2}},"canonical_sha256":"c85cd13b15ef97d2e1404c4d4613371fd701f0f816cf1aa2481b158507207743","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c85cd13b15ef97d2e1404c4d4613371fd701f0f816cf1aa2481b158507207743","first_computed_at":"2026-05-18T00:03:56.040057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:56.040057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rghN+mM928JlJ11G7iGz091Ty5i+qGxzQAzSMaFWkgwFVC0JuT3qHkYtS5ZVV779B1IwVVBbrPtEyvb0Y16OAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:56.040644Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10653","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25b014bda542f469751ef181786eadb37211588aa88e68102b569b666f08be14","sha256:0fcb4391347fb3dfb8e34cc2f40f2826b4309523495fb4fa655fba9ce58f619d"],"state_sha256":"fe1635875d3300add6293b7e1e1cfaf6aa7a339e0c3cceb337da291903888d59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCMBvGu3yWes1f9y4bTTDkAPtZ71l6xdg9Hr5ThSkP4/qAQirKdA7xf4wSgGoActX5BlH80fn1SSlEdnceUTCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T19:55:41.456357Z","bundle_sha256":"3ed3ca947792124428a6742cf5275387c11f9ae087e881bf8db0f5f8ad6851fa"}}