{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6POHWWWM6QSWWBLIMBA5JXGFZH","short_pith_number":"pith:6POHWWWM","canonical_record":{"source":{"id":"1805.04912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-13T16:46:36Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"7bbb16bb743ad2a860b83efc7eb2ef15bfcf5c7b5e08f832a71f8deeb5b79a7d","abstract_canon_sha256":"663172456e6eef1f98291942837b3a0e5786959a54369105aa3fc9cd79a5c7d7"},"schema_version":"1.0"},"canonical_sha256":"f3dc7b5accf4256b05686041d4dcc5c9c106db450c82b5a13a90a0844b5fa6f1","source":{"kind":"arxiv","id":"1805.04912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04912","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04912v1","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04912","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"6POHWWWM6QSW","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6POHWWWM6QSWWBLI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6POHWWWM","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6POHWWWM6QSWWBLIMBA5JXGFZH","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-13T16:46:36Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"7bbb16bb743ad2a860b83efc7eb2ef15bfcf5c7b5e08f832a71f8deeb5b79a7d","abstract_canon_sha256":"663172456e6eef1f98291942837b3a0e5786959a54369105aa3fc9cd79a5c7d7"},"schema_version":"1.0"},"canonical_sha256":"f3dc7b5accf4256b05686041d4dcc5c9c106db450c82b5a13a90a0844b5fa6f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:04.351198Z","signature_b64":"eJFPOn0h2Pq3Iv/VBRUR+vBa+wsnXI9CYmDhmGMkh2Cu9Ati1/tJX1K2iHmJuBATaUgDn0jOO9qnW1wDf18FAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3dc7b5accf4256b05686041d4dcc5c9c106db450c82b5a13a90a0844b5fa6f1","last_reissued_at":"2026-05-18T00:16:04.350725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:04.350725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04912","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-18T00:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5NgjzggGbJZtrzSut7Q5XxZ0EbKZGHupmPlvNKnHRu2FznNFEj+4uCcdKm3QTnwXLGvCq8bthFd5lZ/wU2tAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:52:15.521848Z"},"content_sha256":"ff02188047ca8788de62f0cabbbc68a3143a7d3ff0565f62ec19201c69542814","schema_version":"1.0","event_id":"sha256:ff02188047ca8788de62f0cabbbc68a3143a7d3ff0565f62ec19201c69542814"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6POHWWWM6QSWWBLIMBA5JXGFZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extendable Neural Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Duc Minh Nguyen, Evaggelia Tsiligianni, Nikos Deligiannis","submitted_at":"2018-05-13T16:46:36Z","abstract_excerpt":"Matrix completion is one of the key problems in signal processing and machine learning, with applications ranging from image pro- cessing and data gathering to classification and recommender sys- tems. Recently, deep neural networks have been proposed as la- tent factor models for matrix completion and have achieved state- of-the-art performance. Nevertheless, a major problem with existing neural-network-based models is their limited capabilities to extend to samples unavailable at the training stage. In this paper, we propose a deep two-branch neural network model for matrix completion. The p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04912","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-18T00:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KW/GiTKwET7pHHRZ5yy1xQBHKAJ9Ipfs5K+GNpDjhDU4I2GO7+1PMuKpx8EuXcafu4HMoNM4SlqNi846ToIpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:52:15.522622Z"},"content_sha256":"a3ae311b7ee9355c9f32e92ba2c3432b79e7550a9774ffd3b4ae9c0b053b02cf","schema_version":"1.0","event_id":"sha256:a3ae311b7ee9355c9f32e92ba2c3432b79e7550a9774ffd3b4ae9c0b053b02cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6POHWWWM6QSWWBLIMBA5JXGFZH/bundle.json","state_url":"https://pith.science/pith/6POHWWWM6QSWWBLIMBA5JXGFZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6POHWWWM6QSWWBLIMBA5JXGFZH/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-11T15:52:15Z","links":{"resolver":"https://pith.science/pith/6POHWWWM6QSWWBLIMBA5JXGFZH","bundle":"https://pith.science/pith/6POHWWWM6QSWWBLIMBA5JXGFZH/bundle.json","state":"https://pith.science/pith/6POHWWWM6QSWWBLIMBA5JXGFZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6POHWWWM6QSWWBLIMBA5JXGFZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6POHWWWM6QSWWBLIMBA5JXGFZH","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":"663172456e6eef1f98291942837b3a0e5786959a54369105aa3fc9cd79a5c7d7","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-13T16:46:36Z","title_canon_sha256":"7bbb16bb743ad2a860b83efc7eb2ef15bfcf5c7b5e08f832a71f8deeb5b79a7d"},"schema_version":"1.0","source":{"id":"1805.04912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04912","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04912v1","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04912","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"6POHWWWM6QSW","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6POHWWWM6QSWWBLI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6POHWWWM","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:a3ae311b7ee9355c9f32e92ba2c3432b79e7550a9774ffd3b4ae9c0b053b02cf","target":"graph","created_at":"2026-05-18T00:16:04Z","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":"Matrix completion is one of the key problems in signal processing and machine learning, with applications ranging from image pro- cessing and data gathering to classification and recommender sys- tems. Recently, deep neural networks have been proposed as la- tent factor models for matrix completion and have achieved state- of-the-art performance. Nevertheless, a major problem with existing neural-network-based models is their limited capabilities to extend to samples unavailable at the training stage. In this paper, we propose a deep two-branch neural network model for matrix completion. The p","authors_text":"Duc Minh Nguyen, Evaggelia Tsiligianni, Nikos Deligiannis","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-13T16:46:36Z","title":"Extendable Neural Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04912","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:ff02188047ca8788de62f0cabbbc68a3143a7d3ff0565f62ec19201c69542814","target":"record","created_at":"2026-05-18T00:16:04Z","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":"663172456e6eef1f98291942837b3a0e5786959a54369105aa3fc9cd79a5c7d7","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-13T16:46:36Z","title_canon_sha256":"7bbb16bb743ad2a860b83efc7eb2ef15bfcf5c7b5e08f832a71f8deeb5b79a7d"},"schema_version":"1.0","source":{"id":"1805.04912","kind":"arxiv","version":1}},"canonical_sha256":"f3dc7b5accf4256b05686041d4dcc5c9c106db450c82b5a13a90a0844b5fa6f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3dc7b5accf4256b05686041d4dcc5c9c106db450c82b5a13a90a0844b5fa6f1","first_computed_at":"2026-05-18T00:16:04.350725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:04.350725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eJFPOn0h2Pq3Iv/VBRUR+vBa+wsnXI9CYmDhmGMkh2Cu9Ati1/tJX1K2iHmJuBATaUgDn0jOO9qnW1wDf18FAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:04.351198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff02188047ca8788de62f0cabbbc68a3143a7d3ff0565f62ec19201c69542814","sha256:a3ae311b7ee9355c9f32e92ba2c3432b79e7550a9774ffd3b4ae9c0b053b02cf"],"state_sha256":"1bb2aa9699f745e2a75c5e6713baeb24dfa6c2472ab4d60b4ce323ab50f8f556"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5f+9wiEtyHf/AuxX0HcWJtTuHUz1RXDMmO0yUxQuPPnVkt5C1i9RtMe4EZSEsR4+INnwriuAKx5De/bxzzJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T15:52:15.527099Z","bundle_sha256":"35d05b795d4cf0fa7edd39bb8ae986a4773491d656e24ee23da9ab238749dbfe"}}