{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3BRP2MVSGF7R5ELDEHEB25LUWL","short_pith_number":"pith:3BRP2MVS","canonical_record":{"source":{"id":"1611.01129","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ME","submitted_at":"2016-11-03T19:02:02Z","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"f44309a15a8e015e06cc6adc00848bda65067ec9b8224626bd7c56cbe26bf8fe","abstract_canon_sha256":"a5599f602c2d6ecfc18fe18e56194341b0e00e9a9dc81629f7bc1f5fd8f74057"},"schema_version":"1.0"},"canonical_sha256":"d862fd32b2317f1e916321c81d7574b2dce3505736a46bfe7155ecbf02617678","source":{"kind":"arxiv","id":"1611.01129","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01129","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01129v2","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01129","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"pith_short_12","alias_value":"3BRP2MVSGF7R","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3BRP2MVSGF7R5ELD","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3BRP2MVS","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3BRP2MVSGF7R5ELDEHEB25LUWL","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01129","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ME","submitted_at":"2016-11-03T19:02:02Z","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"f44309a15a8e015e06cc6adc00848bda65067ec9b8224626bd7c56cbe26bf8fe","abstract_canon_sha256":"a5599f602c2d6ecfc18fe18e56194341b0e00e9a9dc81629f7bc1f5fd8f74057"},"schema_version":"1.0"},"canonical_sha256":"d862fd32b2317f1e916321c81d7574b2dce3505736a46bfe7155ecbf02617678","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:54.013802Z","signature_b64":"yxRdRt5imM5T3EpjJTs8jF9ONRNAtDA6A3s/jYSUPQCc8A0KoLUtfTIhlxg7jL8Mkpi7nfxOmJPcPNhQ1ZtdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d862fd32b2317f1e916321c81d7574b2dce3505736a46bfe7155ecbf02617678","last_reissued_at":"2026-05-17T23:59:54.013273Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:54.013273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01129","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-17T23:59:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NyGBy1FaHvo23/CeRjtaMGdS7+TDLUjQFjhfjShlkp02YtgG5j9L060qYI1WfQpEg+2hX4IYX0fY/QWbvusDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:03:42.444630Z"},"content_sha256":"91462a964dffa2a2c25c4d13ded757a93159915a5931f5f8282777b1042759c4","schema_version":"1.0","event_id":"sha256:91462a964dffa2a2c25c4d13ded757a93159915a5931f5f8282777b1042759c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3BRP2MVSGF7R5ELDEHEB25LUWL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cross: Efficient Low-rank Tensor Completion","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"primary_cat":"stat.ME","authors_text":"Anru Zhang","submitted_at":"2016-11-03T19:02:02Z","abstract_excerpt":"The completion of tensors, or high-order arrays, attracts significant attention in recent research. Current literature on tensor completion primarily focuses on recovery from a set of uniformly randomly measured entries, and the required number of measurements to achieve recovery is not guaranteed to be optimal. In addition, the implementation of some previous methods is NP-hard. In this article, we propose a framework for low-rank tensor completion via a novel tensor measurement scheme we name Cross. The proposed procedure is efficient and easy to implement. In particular, we show that a thir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01129","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-17T23:59:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8bQLcLH+U3DYHekxw8bJXgEHMThbd8Ssfz6mNPlG5Th64AmvfcjhLc01mGBFLFV5Kdch/KZlZTz/adK9LG7hDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:03:42.445032Z"},"content_sha256":"f0285bf9572cc6404dd754714924d4c138f9188955fc60a13ceba8cd701f6f4f","schema_version":"1.0","event_id":"sha256:f0285bf9572cc6404dd754714924d4c138f9188955fc60a13ceba8cd701f6f4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BRP2MVSGF7R5ELDEHEB25LUWL/bundle.json","state_url":"https://pith.science/pith/3BRP2MVSGF7R5ELDEHEB25LUWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BRP2MVSGF7R5ELDEHEB25LUWL/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:03:42Z","links":{"resolver":"https://pith.science/pith/3BRP2MVSGF7R5ELDEHEB25LUWL","bundle":"https://pith.science/pith/3BRP2MVSGF7R5ELDEHEB25LUWL/bundle.json","state":"https://pith.science/pith/3BRP2MVSGF7R5ELDEHEB25LUWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BRP2MVSGF7R5ELDEHEB25LUWL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3BRP2MVSGF7R5ELDEHEB25LUWL","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":"a5599f602c2d6ecfc18fe18e56194341b0e00e9a9dc81629f7bc1f5fd8f74057","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ME","submitted_at":"2016-11-03T19:02:02Z","title_canon_sha256":"f44309a15a8e015e06cc6adc00848bda65067ec9b8224626bd7c56cbe26bf8fe"},"schema_version":"1.0","source":{"id":"1611.01129","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01129","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01129v2","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01129","created_at":"2026-05-17T23:59:54Z"},{"alias_kind":"pith_short_12","alias_value":"3BRP2MVSGF7R","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3BRP2MVSGF7R5ELD","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3BRP2MVS","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:f0285bf9572cc6404dd754714924d4c138f9188955fc60a13ceba8cd701f6f4f","target":"graph","created_at":"2026-05-17T23:59:54Z","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":"The completion of tensors, or high-order arrays, attracts significant attention in recent research. Current literature on tensor completion primarily focuses on recovery from a set of uniformly randomly measured entries, and the required number of measurements to achieve recovery is not guaranteed to be optimal. In addition, the implementation of some previous methods is NP-hard. In this article, we propose a framework for low-rank tensor completion via a novel tensor measurement scheme we name Cross. The proposed procedure is efficient and easy to implement. In particular, we show that a thir","authors_text":"Anru Zhang","cross_cats":["cs.LG","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ME","submitted_at":"2016-11-03T19:02:02Z","title":"Cross: Efficient Low-rank Tensor Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01129","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:91462a964dffa2a2c25c4d13ded757a93159915a5931f5f8282777b1042759c4","target":"record","created_at":"2026-05-17T23:59:54Z","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":"a5599f602c2d6ecfc18fe18e56194341b0e00e9a9dc81629f7bc1f5fd8f74057","cross_cats_sorted":["cs.LG","math.ST","stat.ML","stat.TH"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.ME","submitted_at":"2016-11-03T19:02:02Z","title_canon_sha256":"f44309a15a8e015e06cc6adc00848bda65067ec9b8224626bd7c56cbe26bf8fe"},"schema_version":"1.0","source":{"id":"1611.01129","kind":"arxiv","version":2}},"canonical_sha256":"d862fd32b2317f1e916321c81d7574b2dce3505736a46bfe7155ecbf02617678","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d862fd32b2317f1e916321c81d7574b2dce3505736a46bfe7155ecbf02617678","first_computed_at":"2026-05-17T23:59:54.013273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:54.013273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yxRdRt5imM5T3EpjJTs8jF9ONRNAtDA6A3s/jYSUPQCc8A0KoLUtfTIhlxg7jL8Mkpi7nfxOmJPcPNhQ1ZtdAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:54.013802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01129","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:91462a964dffa2a2c25c4d13ded757a93159915a5931f5f8282777b1042759c4","sha256:f0285bf9572cc6404dd754714924d4c138f9188955fc60a13ceba8cd701f6f4f"],"state_sha256":"e6345ac1d54e88f029585bd4369525458e85b8248d37a44d7bef549b56d30281"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xba82S9t6zYgUHjicrqqaIuNBHHGYXcS9XGwUVY0/QTe3gAowl11DjulD2mgZgxvzFenvVVdGOUjwtC0GwCIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:03:42.448548Z","bundle_sha256":"569d751b05cf47373610568bb76722b5c18df62124eb639ae9145501e468bc73"}}