{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:J2NXPYYMSIX5UZ6IFL423QY4Q5","short_pith_number":"pith:J2NXPYYM","schema_version":"1.0","canonical_sha256":"4e9b77e30c922fda67c82af9adc31c8760e81ce205f3b20f0de9fea4ec67a6f0","source":{"kind":"arxiv","id":"1606.00925","version":3},"attestation_state":"computed","paper":{"title":"Convolutional Imputation of Matrix Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mengyuan Yan David Donoho, Qingyun Sun, Stephen Boyd","submitted_at":"2016-06-02T22:40:59Z","abstract_excerpt":"A matrix network is a family of matrices, with relatedness modeled by a weighted graph. We consider the task of completing a partially observed matrix network. We assume a novel sampling scheme where a fraction of matrices might be completely unobserved. How can we recover the entire matrix network from incomplete observations? This mathematical problem arises in many applications including medical imaging and social networks.\n  To recover the matrix network, we propose a structural assumption that the matrices have a graph Fourier transform which is low-rank. We formulate a convex optimizatio"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1606.00925","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-02T22:40:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b3bd9570502380cfbfdbef157ea39c949b8ef675da014dcc3642933ee1b20752","abstract_canon_sha256":"eb6f9e0491e21b555a31d40ec0b8f3caa25a0d93410e41bb6b95fcaf00ad3050"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:55.422625Z","signature_b64":"AlUlHZDoPU095/DVK8n92YvrYOj15TUsqHtz+oy1XP2kWssVGOsT1Z8Px9YGAeXBo7hniN5R8kMWd1YPenaACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e9b77e30c922fda67c82af9adc31c8760e81ce205f3b20f0de9fea4ec67a6f0","last_reissued_at":"2026-05-18T00:13:55.421831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:55.421831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convolutional Imputation of Matrix Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mengyuan Yan David Donoho, Qingyun Sun, Stephen Boyd","submitted_at":"2016-06-02T22:40:59Z","abstract_excerpt":"A matrix network is a family of matrices, with relatedness modeled by a weighted graph. We consider the task of completing a partially observed matrix network. We assume a novel sampling scheme where a fraction of matrices might be completely unobserved. How can we recover the entire matrix network from incomplete observations? This mathematical problem arises in many applications including medical imaging and social networks.\n  To recover the matrix network, we propose a structural assumption that the matrices have a graph Fourier transform which is low-rank. We formulate a convex optimizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00925","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.00925","created_at":"2026-05-18T00:13:55.421968+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00925v3","created_at":"2026-05-18T00:13:55.421968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00925","created_at":"2026-05-18T00:13:55.421968+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2NXPYYMSIX5","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2NXPYYMSIX5UZ6I","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2NXPYYM","created_at":"2026-05-18T12:30:22.444734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5","json":"https://pith.science/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5.json","graph_json":"https://pith.science/api/pith-number/J2NXPYYMSIX5UZ6IFL423QY4Q5/graph.json","events_json":"https://pith.science/api/pith-number/J2NXPYYMSIX5UZ6IFL423QY4Q5/events.json","paper":"https://pith.science/paper/J2NXPYYM"},"agent_actions":{"view_html":"https://pith.science/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5","download_json":"https://pith.science/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5.json","view_paper":"https://pith.science/paper/J2NXPYYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00925&json=true","fetch_graph":"https://pith.science/api/pith-number/J2NXPYYMSIX5UZ6IFL423QY4Q5/graph.json","fetch_events":"https://pith.science/api/pith-number/J2NXPYYMSIX5UZ6IFL423QY4Q5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5/action/storage_attestation","attest_author":"https://pith.science/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5/action/author_attestation","sign_citation":"https://pith.science/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5/action/citation_signature","submit_replication":"https://pith.science/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5/action/replication_record"}},"created_at":"2026-05-18T00:13:55.421968+00:00","updated_at":"2026-05-18T00:13:55.421968+00:00"}