{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:GZ65IX7PJJSWZLBIWO65ETS3R3","short_pith_number":"pith:GZ65IX7P","canonical_record":{"source":{"id":"1008.3408","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-19T22:55:50Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"54dcb765ff3a3eb1f88821edad1f3c47a5205c8617d2b88bd057dfdcbf7d3b5a","abstract_canon_sha256":"a434a8715da86ce01c69cb923a6cbff0dc119ecb1ef398b361a70051805bbba4"},"schema_version":"1.0"},"canonical_sha256":"367dd45fef4a656cac28b3bdd24e5b8ee2c4bc700a3e1ef11d9954f74bff83d1","source":{"kind":"arxiv","id":"1008.3408","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3408","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3408v5","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3408","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"GZ65IX7PJJSW","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GZ65IX7PJJSWZLBI","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GZ65IX7P","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:GZ65IX7PJJSWZLBIWO65ETS3R3","target":"record","payload":{"canonical_record":{"source":{"id":"1008.3408","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-19T22:55:50Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"54dcb765ff3a3eb1f88821edad1f3c47a5205c8617d2b88bd057dfdcbf7d3b5a","abstract_canon_sha256":"a434a8715da86ce01c69cb923a6cbff0dc119ecb1ef398b361a70051805bbba4"},"schema_version":"1.0"},"canonical_sha256":"367dd45fef4a656cac28b3bdd24e5b8ee2c4bc700a3e1ef11d9954f74bff83d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:35.460885Z","signature_b64":"oUR5Pba2a75IGoR+3QxT3YXG4bst/CJmyoILGX1T25DTNayUTviBn1J0WHlY/7Wb1Beqi8NhDdZnOf9pRG5iCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"367dd45fef4a656cac28b3bdd24e5b8ee2c4bc700a3e1ef11d9954f74bff83d1","last_reissued_at":"2026-05-18T03:56:35.460125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:35.460125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.3408","source_version":5,"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-18T03:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GABzUBiBjSZ46oZis+ORDUpRFK+5XETn2fwFJgJRN3SjMaBB9H3M4tkz0YqYx47k/jwf+0tyDKweAAe/OBQVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:50:02.740852Z"},"content_sha256":"1d7e07e35d6ddb0dd3277d6cad5c813f5d4d1b137671c91c78c2d149c2dd0be4","schema_version":"1.0","event_id":"sha256:1d7e07e35d6ddb0dd3277d6cad5c813f5d4d1b137671c91c78c2d149c2dd0be4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:GZ65IX7PJJSWZLBIWO65ETS3R3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Good Random Matrices over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Shengtian Yang, Thomas Honold","submitted_at":"2010-08-19T22:55:50Z","abstract_excerpt":"The random matrix uniformly distributed over the set of all m-by-n matrices over a finite field plays an important role in many branches of information theory. In this paper a generalization of this random matrix, called k-good random matrices, is studied. It is shown that a k-good random m-by-n matrix with a distribution of minimum support size is uniformly distributed over a maximum-rank-distance (MRD) code of minimum rank distance min{m,n}-k+1, and vice versa. Further examples of k-good random matrices are derived from homogeneous weights on matrix modules. Several applications of k-good ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3408","kind":"arxiv","version":5},"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-18T03:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+K8tXOSvVIFWBYrXA/bBK9qBx5fmQEIIGCkRHiVmQMnJFP8bjykCgZbASnOqDd8DmgtAyACFdKE5Y/Zv54+zAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:50:02.741443Z"},"content_sha256":"ca3a6259c44db1dd6dcf39010b556ce6e14dea751bb0406d87f4b0606f5bfd4a","schema_version":"1.0","event_id":"sha256:ca3a6259c44db1dd6dcf39010b556ce6e14dea751bb0406d87f4b0606f5bfd4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZ65IX7PJJSWZLBIWO65ETS3R3/bundle.json","state_url":"https://pith.science/pith/GZ65IX7PJJSWZLBIWO65ETS3R3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZ65IX7PJJSWZLBIWO65ETS3R3/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-29T22:50:02Z","links":{"resolver":"https://pith.science/pith/GZ65IX7PJJSWZLBIWO65ETS3R3","bundle":"https://pith.science/pith/GZ65IX7PJJSWZLBIWO65ETS3R3/bundle.json","state":"https://pith.science/pith/GZ65IX7PJJSWZLBIWO65ETS3R3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZ65IX7PJJSWZLBIWO65ETS3R3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:GZ65IX7PJJSWZLBIWO65ETS3R3","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":"a434a8715da86ce01c69cb923a6cbff0dc119ecb1ef398b361a70051805bbba4","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-19T22:55:50Z","title_canon_sha256":"54dcb765ff3a3eb1f88821edad1f3c47a5205c8617d2b88bd057dfdcbf7d3b5a"},"schema_version":"1.0","source":{"id":"1008.3408","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3408","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3408v5","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3408","created_at":"2026-05-18T03:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"GZ65IX7PJJSW","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"GZ65IX7PJJSWZLBI","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"GZ65IX7P","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:ca3a6259c44db1dd6dcf39010b556ce6e14dea751bb0406d87f4b0606f5bfd4a","target":"graph","created_at":"2026-05-18T03:56:35Z","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 random matrix uniformly distributed over the set of all m-by-n matrices over a finite field plays an important role in many branches of information theory. In this paper a generalization of this random matrix, called k-good random matrices, is studied. It is shown that a k-good random m-by-n matrix with a distribution of minimum support size is uniformly distributed over a maximum-rank-distance (MRD) code of minimum rank distance min{m,n}-k+1, and vice versa. Further examples of k-good random matrices are derived from homogeneous weights on matrix modules. Several applications of k-good ra","authors_text":"Shengtian Yang, Thomas Honold","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-19T22:55:50Z","title":"Good Random Matrices over Finite Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3408","kind":"arxiv","version":5},"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:1d7e07e35d6ddb0dd3277d6cad5c813f5d4d1b137671c91c78c2d149c2dd0be4","target":"record","created_at":"2026-05-18T03:56:35Z","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":"a434a8715da86ce01c69cb923a6cbff0dc119ecb1ef398b361a70051805bbba4","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-19T22:55:50Z","title_canon_sha256":"54dcb765ff3a3eb1f88821edad1f3c47a5205c8617d2b88bd057dfdcbf7d3b5a"},"schema_version":"1.0","source":{"id":"1008.3408","kind":"arxiv","version":5}},"canonical_sha256":"367dd45fef4a656cac28b3bdd24e5b8ee2c4bc700a3e1ef11d9954f74bff83d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"367dd45fef4a656cac28b3bdd24e5b8ee2c4bc700a3e1ef11d9954f74bff83d1","first_computed_at":"2026-05-18T03:56:35.460125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:35.460125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oUR5Pba2a75IGoR+3QxT3YXG4bst/CJmyoILGX1T25DTNayUTviBn1J0WHlY/7Wb1Beqi8NhDdZnOf9pRG5iCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:35.460885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3408","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d7e07e35d6ddb0dd3277d6cad5c813f5d4d1b137671c91c78c2d149c2dd0be4","sha256:ca3a6259c44db1dd6dcf39010b556ce6e14dea751bb0406d87f4b0606f5bfd4a"],"state_sha256":"e6bffeb15ccf2bb8f6d52c84692ea03e9e5870d6d7d87d5f038b07986c9cb40a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsBroKJaT3M+lU3rjGBAJI3fuvEMFKrbUGm6yhcYVEewupaIVCkRUvMJnSVQR6lGNYL5VbmYdKuS/p6B4F5ZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:50:02.744498Z","bundle_sha256":"73739398ae0285248622a9b8fe004db5f73982ae11a1165c8a358b3048c230dc"}}