{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OFVRFAETYRNMYK3552EBXPNSZM","short_pith_number":"pith:OFVRFAET","canonical_record":{"source":{"id":"1701.00737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-03T16:23:48Z","cross_cats_sorted":["cs.LG","math.AG","math.IT"],"title_canon_sha256":"6ee9f6b6efe6c3cf89e3ccd6be81238c954dfe5d90285f8f46cbcb6620d28e6e","abstract_canon_sha256":"25489d357325630694a74f3728a0ed0596abd682bffcf748e663c1ceec1190f0"},"schema_version":"1.0"},"canonical_sha256":"716b128093c45acc2b7dee881bbdb2cb0aa08690029fcc4cb6e495d0bc2768f4","source":{"kind":"arxiv","id":"1701.00737","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00737","created_at":"2026-05-18T00:45:32Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00737v2","created_at":"2026-05-18T00:45:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00737","created_at":"2026-05-18T00:45:32Z"},{"alias_kind":"pith_short_12","alias_value":"OFVRFAETYRNM","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OFVRFAETYRNMYK35","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OFVRFAET","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OFVRFAETYRNMYK3552EBXPNSZM","target":"record","payload":{"canonical_record":{"source":{"id":"1701.00737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-03T16:23:48Z","cross_cats_sorted":["cs.LG","math.AG","math.IT"],"title_canon_sha256":"6ee9f6b6efe6c3cf89e3ccd6be81238c954dfe5d90285f8f46cbcb6620d28e6e","abstract_canon_sha256":"25489d357325630694a74f3728a0ed0596abd682bffcf748e663c1ceec1190f0"},"schema_version":"1.0"},"canonical_sha256":"716b128093c45acc2b7dee881bbdb2cb0aa08690029fcc4cb6e495d0bc2768f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:32.157165Z","signature_b64":"3SNnN0uiSF8ah/8ebKFxYf9d0gjwt/KR51+se4Pw/7vxYiEKfw0DTYZsE693moKK0KI/QpeBZVi/wcIFr7lSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"716b128093c45acc2b7dee881bbdb2cb0aa08690029fcc4cb6e495d0bc2768f4","last_reissued_at":"2026-05-18T00:45:32.156516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:32.156516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.00737","source_version":2,"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:45:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mPvkW8blsHutN2hp/kP23zeJHiFDrqxWnet40m5/EbNIf2g/XZE7hPqvle5u4P+cuwJ6h1oir2hhBdsua7uJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:12:59.208940Z"},"content_sha256":"51fc096e2c4a4aa07383d89bd3a0c97029e892391513154141d3a04527358c90","schema_version":"1.0","event_id":"sha256:51fc096e2c4a4aa07383d89bd3a0c97029e892391513154141d3a04527358c90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OFVRFAETYRNMYK3552EBXPNSZM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic and Probabilistic Conditions for Finite Completability of Low-rank Multi-View Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.AG","math.IT"],"primary_cat":"cs.IT","authors_text":"Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang","submitted_at":"2017-01-03T16:23:48Z","abstract_excerpt":"We consider the multi-view data completion problem, i.e., to complete a matrix $\\mathbf{U}=[\\mathbf{U}_1|\\mathbf{U}_2]$ where the ranks of $\\mathbf{U},\\mathbf{U}_1$, and $\\mathbf{U}_2$ are given. In particular, we investigate the fundamental conditions on the sampling pattern, i.e., locations of the sampled entries for finite completability of such a multi-view data given the corresponding rank constraints. In contrast with the existing analysis on Grassmannian manifold for a single-view matrix, i.e., conventional matrix completion, we propose a geometric analysis on the manifold structure for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00737","kind":"arxiv","version":2},"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:45:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dSe3wjyHey3+yNFjAF9gJUv8HOagkbKycDJs0B3STXLaEqDgAv+5WqDHdur3RXj3Yk0YE3BZkAxuJ9Ex5AWnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:12:59.209529Z"},"content_sha256":"b605b20d0490d445cd4c0abd9b8ab94ba0608810011478e962c1037d0f1e3606","schema_version":"1.0","event_id":"sha256:b605b20d0490d445cd4c0abd9b8ab94ba0608810011478e962c1037d0f1e3606"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFVRFAETYRNMYK3552EBXPNSZM/bundle.json","state_url":"https://pith.science/pith/OFVRFAETYRNMYK3552EBXPNSZM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFVRFAETYRNMYK3552EBXPNSZM/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-07T10:12:59Z","links":{"resolver":"https://pith.science/pith/OFVRFAETYRNMYK3552EBXPNSZM","bundle":"https://pith.science/pith/OFVRFAETYRNMYK3552EBXPNSZM/bundle.json","state":"https://pith.science/pith/OFVRFAETYRNMYK3552EBXPNSZM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFVRFAETYRNMYK3552EBXPNSZM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OFVRFAETYRNMYK3552EBXPNSZM","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":"25489d357325630694a74f3728a0ed0596abd682bffcf748e663c1ceec1190f0","cross_cats_sorted":["cs.LG","math.AG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-03T16:23:48Z","title_canon_sha256":"6ee9f6b6efe6c3cf89e3ccd6be81238c954dfe5d90285f8f46cbcb6620d28e6e"},"schema_version":"1.0","source":{"id":"1701.00737","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00737","created_at":"2026-05-18T00:45:32Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00737v2","created_at":"2026-05-18T00:45:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00737","created_at":"2026-05-18T00:45:32Z"},{"alias_kind":"pith_short_12","alias_value":"OFVRFAETYRNM","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OFVRFAETYRNMYK35","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OFVRFAET","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:b605b20d0490d445cd4c0abd9b8ab94ba0608810011478e962c1037d0f1e3606","target":"graph","created_at":"2026-05-18T00:45:32Z","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":"We consider the multi-view data completion problem, i.e., to complete a matrix $\\mathbf{U}=[\\mathbf{U}_1|\\mathbf{U}_2]$ where the ranks of $\\mathbf{U},\\mathbf{U}_1$, and $\\mathbf{U}_2$ are given. In particular, we investigate the fundamental conditions on the sampling pattern, i.e., locations of the sampled entries for finite completability of such a multi-view data given the corresponding rank constraints. In contrast with the existing analysis on Grassmannian manifold for a single-view matrix, i.e., conventional matrix completion, we propose a geometric analysis on the manifold structure for","authors_text":"Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang","cross_cats":["cs.LG","math.AG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-03T16:23:48Z","title":"Deterministic and Probabilistic Conditions for Finite Completability of Low-rank Multi-View Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00737","kind":"arxiv","version":2},"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:51fc096e2c4a4aa07383d89bd3a0c97029e892391513154141d3a04527358c90","target":"record","created_at":"2026-05-18T00:45:32Z","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":"25489d357325630694a74f3728a0ed0596abd682bffcf748e663c1ceec1190f0","cross_cats_sorted":["cs.LG","math.AG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-03T16:23:48Z","title_canon_sha256":"6ee9f6b6efe6c3cf89e3ccd6be81238c954dfe5d90285f8f46cbcb6620d28e6e"},"schema_version":"1.0","source":{"id":"1701.00737","kind":"arxiv","version":2}},"canonical_sha256":"716b128093c45acc2b7dee881bbdb2cb0aa08690029fcc4cb6e495d0bc2768f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"716b128093c45acc2b7dee881bbdb2cb0aa08690029fcc4cb6e495d0bc2768f4","first_computed_at":"2026-05-18T00:45:32.156516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:32.156516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3SNnN0uiSF8ah/8ebKFxYf9d0gjwt/KR51+se4Pw/7vxYiEKfw0DTYZsE693moKK0KI/QpeBZVi/wcIFr7lSDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:32.157165Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.00737","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51fc096e2c4a4aa07383d89bd3a0c97029e892391513154141d3a04527358c90","sha256:b605b20d0490d445cd4c0abd9b8ab94ba0608810011478e962c1037d0f1e3606"],"state_sha256":"ee9bd3f0db2e49f011676492cb85e788633093cef11b995164fbb6a583724168"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cirz6LIsYSoXRGz3EJELvsCklarTFVI9TaRNoOoQp5NZ+vu6G1wIUXIVqWKmsJ/tkpzSlxgZp9WBx443yNBtDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:12:59.211872Z","bundle_sha256":"d66da1d9300a01a21e1eb5c8e63d6286e22d1543fa75ad7678e2a98fde79429b"}}