{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PKKRXPZ6KUOOVAVLDFHZLOBHYK","short_pith_number":"pith:PKKRXPZ6","canonical_record":{"source":{"id":"1105.6115","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-30T21:13:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8f43ebc768024fd2bfd5597601462245b1d18c62a5a09826315df6a6553f354b","abstract_canon_sha256":"4df34c079cc9d583149ebb51a45a2ea8415dbc6de96bfdff2f87674239651ccb"},"schema_version":"1.0"},"canonical_sha256":"7a951bbf3e551cea82ab194f95b827c28baa91f6e86f87652286408c08dc38ab","source":{"kind":"arxiv","id":"1105.6115","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.6115","created_at":"2026-05-18T03:27:43Z"},{"alias_kind":"arxiv_version","alias_value":"1105.6115v4","created_at":"2026-05-18T03:27:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.6115","created_at":"2026-05-18T03:27:43Z"},{"alias_kind":"pith_short_12","alias_value":"PKKRXPZ6KUOO","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PKKRXPZ6KUOOVAVL","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PKKRXPZ6","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PKKRXPZ6KUOOVAVLDFHZLOBHYK","target":"record","payload":{"canonical_record":{"source":{"id":"1105.6115","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-30T21:13:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8f43ebc768024fd2bfd5597601462245b1d18c62a5a09826315df6a6553f354b","abstract_canon_sha256":"4df34c079cc9d583149ebb51a45a2ea8415dbc6de96bfdff2f87674239651ccb"},"schema_version":"1.0"},"canonical_sha256":"7a951bbf3e551cea82ab194f95b827c28baa91f6e86f87652286408c08dc38ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:43.052174Z","signature_b64":"V0IsYEcK1w85KeIgFl0Xem+ZUtumgLz6qhEWRKSUU4HfOtlLGlgDrdzPgao1UA8RJRF70TBLYc9wPk4CWhJFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a951bbf3e551cea82ab194f95b827c28baa91f6e86f87652286408c08dc38ab","last_reissued_at":"2026-05-18T03:27:43.051548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:43.051548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.6115","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-18T03:27:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yMYHZj5IjQo67rMMlG+dKgwqzF6SaIWuS4rRWldw0fM16RedFc0/F8KODoSmvPeU5Zt+sjZBdrH+6CsPk5XVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:32:10.966021Z"},"content_sha256":"06322528b5ee1149a239f4a0207f0cefe5b52a04652a13c25202d1def62d61db","schema_version":"1.0","event_id":"sha256:06322528b5ee1149a239f4a0207f0cefe5b52a04652a13c25202d1def62d61db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PKKRXPZ6KUOOVAVLDFHZLOBHYK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Capacity of Multiplicative Finite-Field Matrix Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bartolomeu F. Uch\\^oa-Filho, Danilo Silva, Roberto W. N\\'obrega","submitted_at":"2011-05-30T21:13:37Z","abstract_excerpt":"This paper deals with the multiplicative finite-field matrix channel, a discrete memoryless channel whose input and output are matrices (over a finite field) related by a multiplicative transfer matrix. The model considered here assumes that all transfer matrices with the same rank are equiprobable, so that the channel is completely characterized by the rank distribution of the transfer matrix. This model is seen to be more flexible than previously proposed ones in describing random linear network coding systems subject to link erasures, while still being sufficiently simple to allow tractabil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.6115","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-18T03:27:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FHaSziSQOcaC+V89Ja0NNrkkwCcmh5GeLAP2FvTtOMZm9LyRna0iifTXBSJ+6h2zM3IPL4HgoPx9nkHaxbYlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:32:10.966409Z"},"content_sha256":"357fa52965dafcd3ba3168892636d992d61520e648bd5ac42b1243b778a951d9","schema_version":"1.0","event_id":"sha256:357fa52965dafcd3ba3168892636d992d61520e648bd5ac42b1243b778a951d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PKKRXPZ6KUOOVAVLDFHZLOBHYK/bundle.json","state_url":"https://pith.science/pith/PKKRXPZ6KUOOVAVLDFHZLOBHYK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PKKRXPZ6KUOOVAVLDFHZLOBHYK/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-23T01:32:10Z","links":{"resolver":"https://pith.science/pith/PKKRXPZ6KUOOVAVLDFHZLOBHYK","bundle":"https://pith.science/pith/PKKRXPZ6KUOOVAVLDFHZLOBHYK/bundle.json","state":"https://pith.science/pith/PKKRXPZ6KUOOVAVLDFHZLOBHYK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PKKRXPZ6KUOOVAVLDFHZLOBHYK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PKKRXPZ6KUOOVAVLDFHZLOBHYK","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":"4df34c079cc9d583149ebb51a45a2ea8415dbc6de96bfdff2f87674239651ccb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-30T21:13:37Z","title_canon_sha256":"8f43ebc768024fd2bfd5597601462245b1d18c62a5a09826315df6a6553f354b"},"schema_version":"1.0","source":{"id":"1105.6115","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.6115","created_at":"2026-05-18T03:27:43Z"},{"alias_kind":"arxiv_version","alias_value":"1105.6115v4","created_at":"2026-05-18T03:27:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.6115","created_at":"2026-05-18T03:27:43Z"},{"alias_kind":"pith_short_12","alias_value":"PKKRXPZ6KUOO","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PKKRXPZ6KUOOVAVL","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PKKRXPZ6","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:357fa52965dafcd3ba3168892636d992d61520e648bd5ac42b1243b778a951d9","target":"graph","created_at":"2026-05-18T03:27:43Z","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 deals with the multiplicative finite-field matrix channel, a discrete memoryless channel whose input and output are matrices (over a finite field) related by a multiplicative transfer matrix. The model considered here assumes that all transfer matrices with the same rank are equiprobable, so that the channel is completely characterized by the rank distribution of the transfer matrix. This model is seen to be more flexible than previously proposed ones in describing random linear network coding systems subject to link erasures, while still being sufficiently simple to allow tractabil","authors_text":"Bartolomeu F. Uch\\^oa-Filho, Danilo Silva, Roberto W. N\\'obrega","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-30T21:13:37Z","title":"On the Capacity of Multiplicative Finite-Field Matrix Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.6115","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:06322528b5ee1149a239f4a0207f0cefe5b52a04652a13c25202d1def62d61db","target":"record","created_at":"2026-05-18T03:27:43Z","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":"4df34c079cc9d583149ebb51a45a2ea8415dbc6de96bfdff2f87674239651ccb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-05-30T21:13:37Z","title_canon_sha256":"8f43ebc768024fd2bfd5597601462245b1d18c62a5a09826315df6a6553f354b"},"schema_version":"1.0","source":{"id":"1105.6115","kind":"arxiv","version":4}},"canonical_sha256":"7a951bbf3e551cea82ab194f95b827c28baa91f6e86f87652286408c08dc38ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a951bbf3e551cea82ab194f95b827c28baa91f6e86f87652286408c08dc38ab","first_computed_at":"2026-05-18T03:27:43.051548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:43.051548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V0IsYEcK1w85KeIgFl0Xem+ZUtumgLz6qhEWRKSUU4HfOtlLGlgDrdzPgao1UA8RJRF70TBLYc9wPk4CWhJFCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:43.052174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.6115","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06322528b5ee1149a239f4a0207f0cefe5b52a04652a13c25202d1def62d61db","sha256:357fa52965dafcd3ba3168892636d992d61520e648bd5ac42b1243b778a951d9"],"state_sha256":"dc2b41727116cec2aecb4e349be81527db98df3373835f8547359eebd34f1b94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QuGnccLiVGlriiROMx7Cly+flakCeNKUv/Sn07d/YI4SeRt2lX+EFrM5MPk11AcNvJfNEMa/8BbBmMI48u2pCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T01:32:10.968606Z","bundle_sha256":"7640d2c0c95866f921ecb20cdedc6020ec255087ab8a9f616c5ed24adeef1f9d"}}