{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J2NXPYYMSIX5UZ6IFL423QY4Q5","short_pith_number":"pith:J2NXPYYM","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"},"canonical_sha256":"4e9b77e30c922fda67c82af9adc31c8760e81ce205f3b20f0de9fea4ec67a6f0","source":{"kind":"arxiv","id":"1606.00925","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00925","created_at":"2026-05-18T00:13:55Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00925v3","created_at":"2026-05-18T00:13:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00925","created_at":"2026-05-18T00:13:55Z"},{"alias_kind":"pith_short_12","alias_value":"J2NXPYYMSIX5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J2NXPYYMSIX5UZ6I","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J2NXPYYM","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J2NXPYYMSIX5UZ6IFL423QY4Q5","target":"record","payload":{"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"},"canonical_sha256":"4e9b77e30c922fda67c82af9adc31c8760e81ce205f3b20f0de9fea4ec67a6f0","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"},"source_kind":"arxiv","source_id":"1606.00925","source_version":3,"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:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQtxH7f7h4OpTLjFQkoDI8wWiI1ciZ9qMGyV0COm1KLbfqmsbTffdO05czZOvQuPH/Lv3E8hkWsa9gAckfcQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:23:34.770649Z"},"content_sha256":"6fe52cb0bb648374b223081226c6821e03bf5f218647261b7d45094e7634a0ce","schema_version":"1.0","event_id":"sha256:6fe52cb0bb648374b223081226c6821e03bf5f218647261b7d45094e7634a0ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J2NXPYYMSIX5UZ6IFL423QY4Q5","target":"graph","payload":{"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"},"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:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPbP2ls+ll3E0tGaxTjcqH+lrUuw6TDMjOJ0HhSbbyWLTZy/7lzztYuuASmLnz79s210/F2sPM6xGdNUj690Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:23:34.771355Z"},"content_sha256":"e985db9c54387e3626dc06feb96293bb7cd533538e27eb35d428209f5708a79f","schema_version":"1.0","event_id":"sha256:e985db9c54387e3626dc06feb96293bb7cd533538e27eb35d428209f5708a79f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5/bundle.json","state_url":"https://pith.science/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5/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-05-31T05:23:34Z","links":{"resolver":"https://pith.science/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5","bundle":"https://pith.science/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5/bundle.json","state":"https://pith.science/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2NXPYYMSIX5UZ6IFL423QY4Q5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J2NXPYYMSIX5UZ6IFL423QY4Q5","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":"eb6f9e0491e21b555a31d40ec0b8f3caa25a0d93410e41bb6b95fcaf00ad3050","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-02T22:40:59Z","title_canon_sha256":"b3bd9570502380cfbfdbef157ea39c949b8ef675da014dcc3642933ee1b20752"},"schema_version":"1.0","source":{"id":"1606.00925","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00925","created_at":"2026-05-18T00:13:55Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00925v3","created_at":"2026-05-18T00:13:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00925","created_at":"2026-05-18T00:13:55Z"},{"alias_kind":"pith_short_12","alias_value":"J2NXPYYMSIX5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J2NXPYYMSIX5UZ6I","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J2NXPYYM","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:e985db9c54387e3626dc06feb96293bb7cd533538e27eb35d428209f5708a79f","target":"graph","created_at":"2026-05-18T00:13:55Z","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":"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","authors_text":"Mengyuan Yan David Donoho, Qingyun Sun, Stephen Boyd","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-02T22:40:59Z","title":"Convolutional Imputation of Matrix Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00925","kind":"arxiv","version":3},"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:6fe52cb0bb648374b223081226c6821e03bf5f218647261b7d45094e7634a0ce","target":"record","created_at":"2026-05-18T00:13:55Z","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":"eb6f9e0491e21b555a31d40ec0b8f3caa25a0d93410e41bb6b95fcaf00ad3050","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-02T22:40:59Z","title_canon_sha256":"b3bd9570502380cfbfdbef157ea39c949b8ef675da014dcc3642933ee1b20752"},"schema_version":"1.0","source":{"id":"1606.00925","kind":"arxiv","version":3}},"canonical_sha256":"4e9b77e30c922fda67c82af9adc31c8760e81ce205f3b20f0de9fea4ec67a6f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e9b77e30c922fda67c82af9adc31c8760e81ce205f3b20f0de9fea4ec67a6f0","first_computed_at":"2026-05-18T00:13:55.421831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:55.421831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AlUlHZDoPU095/DVK8n92YvrYOj15TUsqHtz+oy1XP2kWssVGOsT1Z8Px9YGAeXBo7hniN5R8kMWd1YPenaACg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:55.422625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00925","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fe52cb0bb648374b223081226c6821e03bf5f218647261b7d45094e7634a0ce","sha256:e985db9c54387e3626dc06feb96293bb7cd533538e27eb35d428209f5708a79f"],"state_sha256":"505f1cebdf5f5c665a74ed5638e317e436c3e620cf4052e2b7110457a586735a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q3iVLrX/IpC5f+RHbLTyfR4H+JheKC6buR9x+Hx+fq9aNClN85t0a50XCRAL2JSxKadPUxHlHgpal6lIh0oUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:23:34.775473Z","bundle_sha256":"ea0a6319a7d0327747128157611d39b74392d3cea0b3bf91002722b0e089187e"}}