{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KLR5KOKJJ5D2QYMXUOQC47OFEB","short_pith_number":"pith:KLR5KOKJ","canonical_record":{"source":{"id":"1104.4302","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-21T16:15:02Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"98dabf576a503f7aff078d25047c33b998f02a5f98f65c8c88227c7e8eedf73d","abstract_canon_sha256":"dc819cf1090976be9151a47eb2c650d03bb830613a98eb7b1a62ba80d13f3f3c"},"schema_version":"1.0"},"canonical_sha256":"52e3d539494f47a86197a3a02e7dc52058e6f31e64c0d331f9325f0e87520f96","source":{"kind":"arxiv","id":"1104.4302","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4302","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4302v4","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4302","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"KLR5KOKJJ5D2","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KLR5KOKJJ5D2QYMX","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KLR5KOKJ","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KLR5KOKJJ5D2QYMXUOQC47OFEB","target":"record","payload":{"canonical_record":{"source":{"id":"1104.4302","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-21T16:15:02Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"98dabf576a503f7aff078d25047c33b998f02a5f98f65c8c88227c7e8eedf73d","abstract_canon_sha256":"dc819cf1090976be9151a47eb2c650d03bb830613a98eb7b1a62ba80d13f3f3c"},"schema_version":"1.0"},"canonical_sha256":"52e3d539494f47a86197a3a02e7dc52058e6f31e64c0d331f9325f0e87520f96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:01.465199Z","signature_b64":"BGF9LglxjRhDFh07+7eTr0H4zGidif59AvqqhYqE9u2UeKTzz2pFSVh6AmFgkteBrXwu0GEBC1dlD1hJ5iHqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52e3d539494f47a86197a3a02e7dc52058e6f31e64c0d331f9325f0e87520f96","last_reissued_at":"2026-05-18T02:22:01.464507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:01.464507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.4302","source_version":4,"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-18T02:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwHjv2oerCD3JFgW2uxFJtuAEGjkSW6qWXAZaEFQHpypxOxRZxCztXIBPyCHTF6cAVppXvK4MO9BIqq3iK3NBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:57:33.172668Z"},"content_sha256":"fc8e8bca4638d041163167bc7db9579052f90bea1398645986cfcfc4100e7769","schema_version":"1.0","event_id":"sha256:fc8e8bca4638d041163167bc7db9579052f90bea1398645986cfcfc4100e7769"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KLR5KOKJJ5D2QYMXUOQC47OFEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rank Minimization over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Laura Balzano, Stark C. Draper, Vincent Y. F. Tan","submitted_at":"2011-04-21T16:15:02Z","abstract_excerpt":"This paper establishes information-theoretic limits in estimating a finite field low-rank matrix given random linear measurements of it. These linear measurements are obtained by taking inner products of the low-rank matrix with random sensing matrices. Necessary and sufficient conditions on the number of measurements required are provided. It is shown that these conditions are sharp and the minimum-rank decoder is asymptotically optimal. The reliability function of this decoder is also derived by appealing to de Caen's lower bound on the probability of a union. The sufficient condition also h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4302","kind":"arxiv","version":4},"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-18T02:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87a9kkrJAenl+R0Feb/xeSqPrnvG0NBOgqDfbK3MRTlge0cYVtmLDwM1PM09r05/hdhxx72S/ZcAKtUIGwT7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:57:33.173038Z"},"content_sha256":"6f57d1fd981adb589e1f95ac15a69bd402c29e0eb41be6e4730ed5742dd6096a","schema_version":"1.0","event_id":"sha256:6f57d1fd981adb589e1f95ac15a69bd402c29e0eb41be6e4730ed5742dd6096a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLR5KOKJJ5D2QYMXUOQC47OFEB/bundle.json","state_url":"https://pith.science/pith/KLR5KOKJJ5D2QYMXUOQC47OFEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLR5KOKJJ5D2QYMXUOQC47OFEB/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-31T02:57:33Z","links":{"resolver":"https://pith.science/pith/KLR5KOKJJ5D2QYMXUOQC47OFEB","bundle":"https://pith.science/pith/KLR5KOKJJ5D2QYMXUOQC47OFEB/bundle.json","state":"https://pith.science/pith/KLR5KOKJJ5D2QYMXUOQC47OFEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLR5KOKJJ5D2QYMXUOQC47OFEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KLR5KOKJJ5D2QYMXUOQC47OFEB","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":"dc819cf1090976be9151a47eb2c650d03bb830613a98eb7b1a62ba80d13f3f3c","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-21T16:15:02Z","title_canon_sha256":"98dabf576a503f7aff078d25047c33b998f02a5f98f65c8c88227c7e8eedf73d"},"schema_version":"1.0","source":{"id":"1104.4302","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4302","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4302v4","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4302","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"KLR5KOKJJ5D2","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KLR5KOKJJ5D2QYMX","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KLR5KOKJ","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:6f57d1fd981adb589e1f95ac15a69bd402c29e0eb41be6e4730ed5742dd6096a","target":"graph","created_at":"2026-05-18T02:22:01Z","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":"This paper establishes information-theoretic limits in estimating a finite field low-rank matrix given random linear measurements of it. These linear measurements are obtained by taking inner products of the low-rank matrix with random sensing matrices. Necessary and sufficient conditions on the number of measurements required are provided. It is shown that these conditions are sharp and the minimum-rank decoder is asymptotically optimal. The reliability function of this decoder is also derived by appealing to de Caen's lower bound on the probability of a union. The sufficient condition also h","authors_text":"Laura Balzano, Stark C. Draper, Vincent Y. F. Tan","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-21T16:15:02Z","title":"Rank Minimization over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4302","kind":"arxiv","version":4},"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:fc8e8bca4638d041163167bc7db9579052f90bea1398645986cfcfc4100e7769","target":"record","created_at":"2026-05-18T02:22:01Z","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":"dc819cf1090976be9151a47eb2c650d03bb830613a98eb7b1a62ba80d13f3f3c","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-21T16:15:02Z","title_canon_sha256":"98dabf576a503f7aff078d25047c33b998f02a5f98f65c8c88227c7e8eedf73d"},"schema_version":"1.0","source":{"id":"1104.4302","kind":"arxiv","version":4}},"canonical_sha256":"52e3d539494f47a86197a3a02e7dc52058e6f31e64c0d331f9325f0e87520f96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52e3d539494f47a86197a3a02e7dc52058e6f31e64c0d331f9325f0e87520f96","first_computed_at":"2026-05-18T02:22:01.464507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:01.464507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BGF9LglxjRhDFh07+7eTr0H4zGidif59AvqqhYqE9u2UeKTzz2pFSVh6AmFgkteBrXwu0GEBC1dlD1hJ5iHqBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:01.465199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.4302","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc8e8bca4638d041163167bc7db9579052f90bea1398645986cfcfc4100e7769","sha256:6f57d1fd981adb589e1f95ac15a69bd402c29e0eb41be6e4730ed5742dd6096a"],"state_sha256":"95aa40c7b985a7961b3cbbe85d25c64e3b00c7ab49122eda721490a871ff6dd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9s1lLFomeDwWjF7emJNImw3WOJTI+geZzUukr+FKxuuTHKGSL4pGnJU8MP0p7HlUAS8a7pEloo3TjY2QX2BJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:57:33.176022Z","bundle_sha256":"f4293de4845b571b22f40848c1baae6102adf78c8cda35d2bf4ef9d32e80877e"}}