{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DT2G2ZBYDB7GHZAVVQY6QJG5SN","short_pith_number":"pith:DT2G2ZBY","canonical_record":{"source":{"id":"1503.02596","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-09T18:12:58Z","cross_cats_sorted":["cs.LG","math.AG"],"title_canon_sha256":"ec38a233fa199b6a575971837f4c7ea05d15aafe1bb182db11fc76169ea0687d","abstract_canon_sha256":"8a2720056c02fb7149b2aff6100bd32c5e5d9d48e00e3d7c401b3d76e8c4db57"},"schema_version":"1.0"},"canonical_sha256":"1cf46d6438187e63e415ac31e824dd93523478f88fc44d0f74140759672857ee","source":{"kind":"arxiv","id":"1503.02596","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02596","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02596v3","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02596","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"DT2G2ZBYDB7G","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DT2G2ZBYDB7GHZAV","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DT2G2ZBY","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DT2G2ZBYDB7GHZAVVQY6QJG5SN","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02596","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-09T18:12:58Z","cross_cats_sorted":["cs.LG","math.AG"],"title_canon_sha256":"ec38a233fa199b6a575971837f4c7ea05d15aafe1bb182db11fc76169ea0687d","abstract_canon_sha256":"8a2720056c02fb7149b2aff6100bd32c5e5d9d48e00e3d7c401b3d76e8c4db57"},"schema_version":"1.0"},"canonical_sha256":"1cf46d6438187e63e415ac31e824dd93523478f88fc44d0f74140759672857ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:45.972050Z","signature_b64":"zp2fGj9aYqObkWbTJvP6EF1ktavmtpxZtFrLpLtalxmLBqr2JZhOgEAqw3+j+9jwvlIpC5YACwNe3z7I4BEBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf46d6438187e63e415ac31e824dd93523478f88fc44d0f74140759672857ee","last_reissued_at":"2026-05-18T01:02:45.971614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:45.971614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02596","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-18T01:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"StzXxxBPOsV96Os0APC0HoTqx7he6mBKjmAZn+4z28HRzBBgFZlbEcP6CnvvmunQNDx/OR6pBU8+Vs5ifeLHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:26:38.227104Z"},"content_sha256":"3aef47bac4b4173853e07e50e3a5ac835e81c045db8406ed7709b720286d3326","schema_version":"1.0","event_id":"sha256:3aef47bac4b4173853e07e50e3a5ac835e81c045db8406ed7709b720286d3326"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DT2G2ZBYDB7GHZAVVQY6QJG5SN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Characterization of Deterministic Sampling Patterns for Low-Rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.AG"],"primary_cat":"stat.ML","authors_text":"Daniel L. Pimentel-Alarc\\'on, Nigel Boston, Robert D. Nowak","submitted_at":"2015-03-09T18:12:58Z","abstract_excerpt":"Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. This paper studies deterministic conditions for completion. An incomplete $d \\times N$ matrix is finitely rank-$r$ completable if there are at most finitely many rank-$r$ matrices that agree with all its observed entries. Finite completability is the tipping point in LRMC, as a few additional samples of a finitely completable matrix guarantee its unique completability. The main contribution of this paper is a determinis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02596","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-18T01:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dTRKgla6vAp2d1ph9NQGxclfsgCjuJYp4IBn00TlYiKOYtBJ0EWINs46Ke8uJSCCMABRvw1TmY09QVqVXnjBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:26:38.227864Z"},"content_sha256":"602c98f4f4af23b1e8bde8eb7897e65fb47f15d53811deb8e4876e9fdf573b35","schema_version":"1.0","event_id":"sha256:602c98f4f4af23b1e8bde8eb7897e65fb47f15d53811deb8e4876e9fdf573b35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN/bundle.json","state_url":"https://pith.science/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN/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-26T17:26:38Z","links":{"resolver":"https://pith.science/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN","bundle":"https://pith.science/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN/bundle.json","state":"https://pith.science/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DT2G2ZBYDB7GHZAVVQY6QJG5SN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DT2G2ZBYDB7GHZAVVQY6QJG5SN","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":"8a2720056c02fb7149b2aff6100bd32c5e5d9d48e00e3d7c401b3d76e8c4db57","cross_cats_sorted":["cs.LG","math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-09T18:12:58Z","title_canon_sha256":"ec38a233fa199b6a575971837f4c7ea05d15aafe1bb182db11fc76169ea0687d"},"schema_version":"1.0","source":{"id":"1503.02596","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02596","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02596v3","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02596","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"DT2G2ZBYDB7G","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DT2G2ZBYDB7GHZAV","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DT2G2ZBY","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:602c98f4f4af23b1e8bde8eb7897e65fb47f15d53811deb8e4876e9fdf573b35","target":"graph","created_at":"2026-05-18T01:02:45Z","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":"Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. This paper studies deterministic conditions for completion. An incomplete $d \\times N$ matrix is finitely rank-$r$ completable if there are at most finitely many rank-$r$ matrices that agree with all its observed entries. Finite completability is the tipping point in LRMC, as a few additional samples of a finitely completable matrix guarantee its unique completability. The main contribution of this paper is a determinis","authors_text":"Daniel L. Pimentel-Alarc\\'on, Nigel Boston, Robert D. Nowak","cross_cats":["cs.LG","math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-09T18:12:58Z","title":"A Characterization of Deterministic Sampling Patterns for Low-Rank Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02596","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:3aef47bac4b4173853e07e50e3a5ac835e81c045db8406ed7709b720286d3326","target":"record","created_at":"2026-05-18T01:02:45Z","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":"8a2720056c02fb7149b2aff6100bd32c5e5d9d48e00e3d7c401b3d76e8c4db57","cross_cats_sorted":["cs.LG","math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-09T18:12:58Z","title_canon_sha256":"ec38a233fa199b6a575971837f4c7ea05d15aafe1bb182db11fc76169ea0687d"},"schema_version":"1.0","source":{"id":"1503.02596","kind":"arxiv","version":3}},"canonical_sha256":"1cf46d6438187e63e415ac31e824dd93523478f88fc44d0f74140759672857ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cf46d6438187e63e415ac31e824dd93523478f88fc44d0f74140759672857ee","first_computed_at":"2026-05-18T01:02:45.971614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:45.971614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zp2fGj9aYqObkWbTJvP6EF1ktavmtpxZtFrLpLtalxmLBqr2JZhOgEAqw3+j+9jwvlIpC5YACwNe3z7I4BEBCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:45.972050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02596","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3aef47bac4b4173853e07e50e3a5ac835e81c045db8406ed7709b720286d3326","sha256:602c98f4f4af23b1e8bde8eb7897e65fb47f15d53811deb8e4876e9fdf573b35"],"state_sha256":"60b74d1cfb1439a2bcd3ea9734898d149c73761d9f1faaa89e1337e9b0732ea9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/XVKp0IkMs8ebqNteQ4p+16ODSqeGApVeJGiglHXAlXt1LkS700zZKV1nUN2DGMEmuLkhDqRpDuzSwoPRXnPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:26:38.231170Z","bundle_sha256":"27ccf86d153e36d01b84ef11cd7be58071f27fc5f1edb683b72d05579164a6d7"}}