{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:HKLS7Y2IBWBH3NTZQ2S6IJ6NRF","short_pith_number":"pith:HKLS7Y2I","canonical_record":{"source":{"id":"2002.02041","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-02-05T23:57:26Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"fca062f3f85275ac4188d915f847b798ff541c6a1f4b64396491a96a91824bd1","abstract_canon_sha256":"031b869e443ce5b842cf94625f5c435f711b6ecbb65a16b0d729be9d7ab33bc8"},"schema_version":"1.0"},"canonical_sha256":"3a972fe3480d827db67986a5e427cd8964d0e2c311f8a4b686d32ff8f23d0726","source":{"kind":"arxiv","id":"2002.02041","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.02041","created_at":"2026-07-05T02:40:26Z"},{"alias_kind":"arxiv_version","alias_value":"2002.02041v3","created_at":"2026-07-05T02:40:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.02041","created_at":"2026-07-05T02:40:26Z"},{"alias_kind":"pith_short_12","alias_value":"HKLS7Y2IBWBH","created_at":"2026-07-05T02:40:26Z"},{"alias_kind":"pith_short_16","alias_value":"HKLS7Y2IBWBH3NTZ","created_at":"2026-07-05T02:40:26Z"},{"alias_kind":"pith_short_8","alias_value":"HKLS7Y2I","created_at":"2026-07-05T02:40:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:HKLS7Y2IBWBH3NTZQ2S6IJ6NRF","target":"record","payload":{"canonical_record":{"source":{"id":"2002.02041","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-02-05T23:57:26Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"fca062f3f85275ac4188d915f847b798ff541c6a1f4b64396491a96a91824bd1","abstract_canon_sha256":"031b869e443ce5b842cf94625f5c435f711b6ecbb65a16b0d729be9d7ab33bc8"},"schema_version":"1.0"},"canonical_sha256":"3a972fe3480d827db67986a5e427cd8964d0e2c311f8a4b686d32ff8f23d0726","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:40:26.628948Z","signature_b64":"dub2CpzONekjKzNy5ShJjefsiKBjY6ib4sOUe2Q+ILkUTjWLuWL+dCNcnZ2b+NaLFV2YaEfTx4Wi1/rloYNaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a972fe3480d827db67986a5e427cd8964d0e2c311f8a4b686d32ff8f23d0726","last_reissued_at":"2026-07-05T02:40:26.628559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:40:26.628559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.02041","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-07-05T02:40:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u7Iu7kVMzGxb7Ev6R/Mi/hYRCX9JnT5zPDXwTzYivyV0QfXOfl8lhZkcXMxsDkc+Ol3Dz6Kdt5j9ZOHXp97MDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:40:02.573681Z"},"content_sha256":"69b526e98306130876a77b3172c77a787006294989923529d54bba9cead7dcec","schema_version":"1.0","event_id":"sha256:69b526e98306130876a77b3172c77a787006294989923529d54bba9cead7dcec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:HKLS7Y2IBWBH3NTZQ2S6IJ6NRF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Adaptation for Iterative Structured Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Deanna Needell, Henry Adams, Lara Kassab","submitted_at":"2020-02-05T23:57:26Z","abstract_excerpt":"The task of predicting missing entries of a matrix, from a subset of known entries, is known as \\textit{matrix completion}. In today's data-driven world, data completion is essential whether it is the main goal or a pre-processing step. Structured matrix completion includes any setting in which data is not missing uniformly at random. In recent work, a modification to the standard nuclear norm minimization (NNM) for matrix completion has been developed to take into account \\emph{sparsity-based} structure in the missing entries. This notion of structure is motivated in many settings including r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.02041","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.02041/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:40:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3/f3qirt9VDrbmDZVYppWPhoZumVAKohIlnJzW4YuP3nB12q5XqtmfZvVfPGn98zQuHIHFM/QQdzLOecQ+xfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:40:02.574056Z"},"content_sha256":"6491b1f09178e200f027c136ba74610e344a9fdecaeea41cee06d9ac150929e6","schema_version":"1.0","event_id":"sha256:6491b1f09178e200f027c136ba74610e344a9fdecaeea41cee06d9ac150929e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKLS7Y2IBWBH3NTZQ2S6IJ6NRF/bundle.json","state_url":"https://pith.science/pith/HKLS7Y2IBWBH3NTZQ2S6IJ6NRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKLS7Y2IBWBH3NTZQ2S6IJ6NRF/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-07T08:40:02Z","links":{"resolver":"https://pith.science/pith/HKLS7Y2IBWBH3NTZQ2S6IJ6NRF","bundle":"https://pith.science/pith/HKLS7Y2IBWBH3NTZQ2S6IJ6NRF/bundle.json","state":"https://pith.science/pith/HKLS7Y2IBWBH3NTZQ2S6IJ6NRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKLS7Y2IBWBH3NTZQ2S6IJ6NRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:HKLS7Y2IBWBH3NTZQ2S6IJ6NRF","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":"031b869e443ce5b842cf94625f5c435f711b6ecbb65a16b0d729be9d7ab33bc8","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-02-05T23:57:26Z","title_canon_sha256":"fca062f3f85275ac4188d915f847b798ff541c6a1f4b64396491a96a91824bd1"},"schema_version":"1.0","source":{"id":"2002.02041","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.02041","created_at":"2026-07-05T02:40:26Z"},{"alias_kind":"arxiv_version","alias_value":"2002.02041v3","created_at":"2026-07-05T02:40:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.02041","created_at":"2026-07-05T02:40:26Z"},{"alias_kind":"pith_short_12","alias_value":"HKLS7Y2IBWBH","created_at":"2026-07-05T02:40:26Z"},{"alias_kind":"pith_short_16","alias_value":"HKLS7Y2IBWBH3NTZ","created_at":"2026-07-05T02:40:26Z"},{"alias_kind":"pith_short_8","alias_value":"HKLS7Y2I","created_at":"2026-07-05T02:40:26Z"}],"graph_snapshots":[{"event_id":"sha256:6491b1f09178e200f027c136ba74610e344a9fdecaeea41cee06d9ac150929e6","target":"graph","created_at":"2026-07-05T02:40:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.02041/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The task of predicting missing entries of a matrix, from a subset of known entries, is known as \\textit{matrix completion}. In today's data-driven world, data completion is essential whether it is the main goal or a pre-processing step. Structured matrix completion includes any setting in which data is not missing uniformly at random. In recent work, a modification to the standard nuclear norm minimization (NNM) for matrix completion has been developed to take into account \\emph{sparsity-based} structure in the missing entries. This notion of structure is motivated in many settings including r","authors_text":"Deanna Needell, Henry Adams, Lara Kassab","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-02-05T23:57:26Z","title":"An Adaptation for Iterative Structured Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.02041","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:69b526e98306130876a77b3172c77a787006294989923529d54bba9cead7dcec","target":"record","created_at":"2026-07-05T02:40:26Z","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":"031b869e443ce5b842cf94625f5c435f711b6ecbb65a16b0d729be9d7ab33bc8","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2020-02-05T23:57:26Z","title_canon_sha256":"fca062f3f85275ac4188d915f847b798ff541c6a1f4b64396491a96a91824bd1"},"schema_version":"1.0","source":{"id":"2002.02041","kind":"arxiv","version":3}},"canonical_sha256":"3a972fe3480d827db67986a5e427cd8964d0e2c311f8a4b686d32ff8f23d0726","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a972fe3480d827db67986a5e427cd8964d0e2c311f8a4b686d32ff8f23d0726","first_computed_at":"2026-07-05T02:40:26.628559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:40:26.628559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dub2CpzONekjKzNy5ShJjefsiKBjY6ib4sOUe2Q+ILkUTjWLuWL+dCNcnZ2b+NaLFV2YaEfTx4Wi1/rloYNaBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:40:26.628948Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.02041","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69b526e98306130876a77b3172c77a787006294989923529d54bba9cead7dcec","sha256:6491b1f09178e200f027c136ba74610e344a9fdecaeea41cee06d9ac150929e6"],"state_sha256":"8dc609099f49ec1ba2c16bfce86e1efca7c9642f2e990b9bab0b5f64632e4843"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SSzLGBTzLFl0/TS+GoBeE36/DNhbwo22+rK5UkjVybe4BHIqRewVvhhMYD3tV93ZqwqTvIMbPuTIYzVcTohMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:40:02.576104Z","bundle_sha256":"5005203e5c2aa9c5f7eb30161e98e4a1da0c363ae08b8dbe3dd12d0e4e7d5aa4"}}