{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FHDHMIOK5TUJQAZY2MZKZD6RBX","short_pith_number":"pith:FHDHMIOK","canonical_record":{"source":{"id":"1709.00127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-01T01:25:45Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"c2fc5da3bf49a911df50b0ceae4106b3f084df72c2c727145667f0651f28b711","abstract_canon_sha256":"036ffb7318c32d03cf8dca5970baefeddd6a1df339e2a05b319f29aea0c18e1f"},"schema_version":"1.0"},"canonical_sha256":"29c67621caece8980338d332ac8fd10df9a4b332cb99e89f6ab69fb09f85379d","source":{"kind":"arxiv","id":"1709.00127","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00127","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00127v1","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00127","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"FHDHMIOK5TUJ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FHDHMIOK5TUJQAZY","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FHDHMIOK","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FHDHMIOK5TUJQAZY2MZKZD6RBX","target":"record","payload":{"canonical_record":{"source":{"id":"1709.00127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-01T01:25:45Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"c2fc5da3bf49a911df50b0ceae4106b3f084df72c2c727145667f0651f28b711","abstract_canon_sha256":"036ffb7318c32d03cf8dca5970baefeddd6a1df339e2a05b319f29aea0c18e1f"},"schema_version":"1.0"},"canonical_sha256":"29c67621caece8980338d332ac8fd10df9a4b332cb99e89f6ab69fb09f85379d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:13.336069Z","signature_b64":"js/m4PAppdKiMPEii/8YfvwUA+rJM4GBOFr2FT42T1N2poiV1xPKUg9ZbMj36HKthUuWOB1kTeQvOao/eVX3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29c67621caece8980338d332ac8fd10df9a4b332cb99e89f6ab69fb09f85379d","last_reissued_at":"2026-05-18T00:36:13.335093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:13.335093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.00127","source_version":1,"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:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SAoCmRscQ+IB1/60TlXGZ3Z9RUJ588iskJgRTMm99j1aUo7Vpe3LsAXjlI/J0qphsZlRGHse9RHqkhGlSZBhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:39:30.647191Z"},"content_sha256":"6c44c605417caba3b8921bd6c23d6f483c0a9d195c9b32aec24f2e89700691e7","schema_version":"1.0","event_id":"sha256:6c44c605417caba3b8921bd6c23d6f483c0a9d195c9b32aec24f2e89700691e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FHDHMIOK5TUJQAZY2MZKZD6RBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Permutation-rank Matrices: Structural Properties and Noisy Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Martin J. Wainwright, Nihar B. Shah, Sivaraman Balakrishnan","submitted_at":"2017-09-01T01:25:45Z","abstract_excerpt":"We consider the problem of noisy matrix completion, in which the goal is to reconstruct a structured matrix whose entries are partially observed in noise. Standard approaches to this underdetermined inverse problem are based on assuming that the underlying matrix has low rank, or is well-approximated by a low rank matrix. In this paper, we propose a richer model based on what we term the \"permutation-rank\" of a matrix. We first describe how the classical non-negative rank model enforces restrictions that may be undesirable in practice, and how and these restrictions can be avoided by using the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00127","kind":"arxiv","version":1},"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:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3y0N6EJcHaL5kXyjjnps4a3JdyNVI9fqVT9WLJaUkJh2A+GamnZ0cYGqABXTYuC1T3nNWtZNwpfBHCsUCLliCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:39:30.647823Z"},"content_sha256":"39181513880fb1ae1232e883d491140b4ae61d5046c1bb6545580a4b18478fec","schema_version":"1.0","event_id":"sha256:39181513880fb1ae1232e883d491140b4ae61d5046c1bb6545580a4b18478fec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FHDHMIOK5TUJQAZY2MZKZD6RBX/bundle.json","state_url":"https://pith.science/pith/FHDHMIOK5TUJQAZY2MZKZD6RBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FHDHMIOK5TUJQAZY2MZKZD6RBX/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-27T02:39:30Z","links":{"resolver":"https://pith.science/pith/FHDHMIOK5TUJQAZY2MZKZD6RBX","bundle":"https://pith.science/pith/FHDHMIOK5TUJQAZY2MZKZD6RBX/bundle.json","state":"https://pith.science/pith/FHDHMIOK5TUJQAZY2MZKZD6RBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FHDHMIOK5TUJQAZY2MZKZD6RBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FHDHMIOK5TUJQAZY2MZKZD6RBX","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":"036ffb7318c32d03cf8dca5970baefeddd6a1df339e2a05b319f29aea0c18e1f","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-01T01:25:45Z","title_canon_sha256":"c2fc5da3bf49a911df50b0ceae4106b3f084df72c2c727145667f0651f28b711"},"schema_version":"1.0","source":{"id":"1709.00127","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00127","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00127v1","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00127","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"FHDHMIOK5TUJ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FHDHMIOK5TUJQAZY","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FHDHMIOK","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:39181513880fb1ae1232e883d491140b4ae61d5046c1bb6545580a4b18478fec","target":"graph","created_at":"2026-05-18T00:36:13Z","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 problem of noisy matrix completion, in which the goal is to reconstruct a structured matrix whose entries are partially observed in noise. Standard approaches to this underdetermined inverse problem are based on assuming that the underlying matrix has low rank, or is well-approximated by a low rank matrix. In this paper, we propose a richer model based on what we term the \"permutation-rank\" of a matrix. We first describe how the classical non-negative rank model enforces restrictions that may be undesirable in practice, and how and these restrictions can be avoided by using the","authors_text":"Martin J. Wainwright, Nihar B. Shah, Sivaraman Balakrishnan","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-01T01:25:45Z","title":"Low Permutation-rank Matrices: Structural Properties and Noisy Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00127","kind":"arxiv","version":1},"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:6c44c605417caba3b8921bd6c23d6f483c0a9d195c9b32aec24f2e89700691e7","target":"record","created_at":"2026-05-18T00:36:13Z","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":"036ffb7318c32d03cf8dca5970baefeddd6a1df339e2a05b319f29aea0c18e1f","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-01T01:25:45Z","title_canon_sha256":"c2fc5da3bf49a911df50b0ceae4106b3f084df72c2c727145667f0651f28b711"},"schema_version":"1.0","source":{"id":"1709.00127","kind":"arxiv","version":1}},"canonical_sha256":"29c67621caece8980338d332ac8fd10df9a4b332cb99e89f6ab69fb09f85379d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29c67621caece8980338d332ac8fd10df9a4b332cb99e89f6ab69fb09f85379d","first_computed_at":"2026-05-18T00:36:13.335093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:13.335093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"js/m4PAppdKiMPEii/8YfvwUA+rJM4GBOFr2FT42T1N2poiV1xPKUg9ZbMj36HKthUuWOB1kTeQvOao/eVX3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:13.336069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00127","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c44c605417caba3b8921bd6c23d6f483c0a9d195c9b32aec24f2e89700691e7","sha256:39181513880fb1ae1232e883d491140b4ae61d5046c1bb6545580a4b18478fec"],"state_sha256":"f6a84993f2c11c9c411a74a71d44ddbe3cac1d1115297c5dd862159a43d87e38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXp/+Y2RuCA/n/1oxtUkBmYwkLIyWx+ks6Bf0iNTC8en+veBzoq6SskAYhRXy7UjWVnn9T3KCBSa/l9zZh/KDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:39:30.651160Z","bundle_sha256":"ce2bb11f26b9710cea1bd4cd9c29e7dae152e0dbb461e0326e193a23350d8200"}}