{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:73UTX7TGX4QEIH6T32GY65UQO4","short_pith_number":"pith:73UTX7TG","canonical_record":{"source":{"id":"1612.01888","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-06T16:21:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"74d3be38ec596307bb530f35772471d1492f9f7fc1760826679fc93fd0b7a127","abstract_canon_sha256":"bb9fd949c4ed4058e01bea3e183077df50bbf28a2b6e853c71c9a1861b4b4bb0"},"schema_version":"1.0"},"canonical_sha256":"fee93bfe66bf20441fd3de8d8f769077176e507e58c677b4541e96f33be57e46","source":{"kind":"arxiv","id":"1612.01888","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01888","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01888v2","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01888","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"pith_short_12","alias_value":"73UTX7TGX4QE","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"73UTX7TGX4QEIH6T","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"73UTX7TG","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:73UTX7TGX4QEIH6T32GY65UQO4","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01888","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-06T16:21:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"74d3be38ec596307bb530f35772471d1492f9f7fc1760826679fc93fd0b7a127","abstract_canon_sha256":"bb9fd949c4ed4058e01bea3e183077df50bbf28a2b6e853c71c9a1861b4b4bb0"},"schema_version":"1.0"},"canonical_sha256":"fee93bfe66bf20441fd3de8d8f769077176e507e58c677b4541e96f33be57e46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:59.295809Z","signature_b64":"ZmfliWAvGug5dUmUWbiANSHXNKgAyWpbDaP8nLsQXP7c8CZ+odsfp8ar+y7tR/DFR3lPnPN+s1Ku1pHg6GfEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fee93bfe66bf20441fd3de8d8f769077176e507e58c677b4541e96f33be57e46","last_reissued_at":"2026-05-18T00:19:59.295216Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:59.295216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01888","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-18T00:19:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zpWR5rZl+6ZP9hXDzRASDZ3rmkugSE1zMfWnBdGX9z+fOp7RZHZiYan5AIL6iWvULiyL0twzAKZK0lV2kxuFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:37:32.486221Z"},"content_sha256":"cc80a2f71158640f3f35b070aa370a2e06ae8192af3ca58135b613b97c3d4fbc","schema_version":"1.0","event_id":"sha256:cc80a2f71158640f3f35b070aa370a2e06ae8192af3ca58135b613b97c3d4fbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:73UTX7TGX4QEIH6T32GY65UQO4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relative generalized matrix weights of matrix codes for universal security on wire-tap networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ryutaroh Matsumoto, Umberto Mart\\'inez-Pe\\~nas","submitted_at":"2016-12-06T16:21:31Z","abstract_excerpt":"Universal security over a network with linear network coding has been intensively studied. However, previous linear codes and code pairs used for this purpose were linear over a larger field than that used on the network, which restricts the possible packet lengths of optimal universal secure codes, does not allow to apply known list-decodable rank-metric codes and requires performing operations over a large field. In this work, we introduce new parameters (relative generalized matrix weights and relative dimension/rank support profile) for code pairs that are linear over the field used in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01888","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-18T00:19:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/aBfsqLg6u2DTCZ7ube5H6czdiXp1S/RtU9BNGBbvZiQk+mOpD2/hhNo50yDGymbqoWD2RiK4OojksoD5E5vCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:37:32.486579Z"},"content_sha256":"db4ff0e53457920d6e70b4e400d85a5b2adf8a94ea228b537ea461cbe59592e7","schema_version":"1.0","event_id":"sha256:db4ff0e53457920d6e70b4e400d85a5b2adf8a94ea228b537ea461cbe59592e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73UTX7TGX4QEIH6T32GY65UQO4/bundle.json","state_url":"https://pith.science/pith/73UTX7TGX4QEIH6T32GY65UQO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73UTX7TGX4QEIH6T32GY65UQO4/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-09T12:37:32Z","links":{"resolver":"https://pith.science/pith/73UTX7TGX4QEIH6T32GY65UQO4","bundle":"https://pith.science/pith/73UTX7TGX4QEIH6T32GY65UQO4/bundle.json","state":"https://pith.science/pith/73UTX7TGX4QEIH6T32GY65UQO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73UTX7TGX4QEIH6T32GY65UQO4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:73UTX7TGX4QEIH6T32GY65UQO4","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":"bb9fd949c4ed4058e01bea3e183077df50bbf28a2b6e853c71c9a1861b4b4bb0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-06T16:21:31Z","title_canon_sha256":"74d3be38ec596307bb530f35772471d1492f9f7fc1760826679fc93fd0b7a127"},"schema_version":"1.0","source":{"id":"1612.01888","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01888","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01888v2","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01888","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"pith_short_12","alias_value":"73UTX7TGX4QE","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"73UTX7TGX4QEIH6T","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"73UTX7TG","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:db4ff0e53457920d6e70b4e400d85a5b2adf8a94ea228b537ea461cbe59592e7","target":"graph","created_at":"2026-05-18T00:19:59Z","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":"Universal security over a network with linear network coding has been intensively studied. However, previous linear codes and code pairs used for this purpose were linear over a larger field than that used on the network, which restricts the possible packet lengths of optimal universal secure codes, does not allow to apply known list-decodable rank-metric codes and requires performing operations over a large field. In this work, we introduce new parameters (relative generalized matrix weights and relative dimension/rank support profile) for code pairs that are linear over the field used in the","authors_text":"Ryutaroh Matsumoto, Umberto Mart\\'inez-Pe\\~nas","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-06T16:21:31Z","title":"Relative generalized matrix weights of matrix codes for universal security on wire-tap networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01888","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:cc80a2f71158640f3f35b070aa370a2e06ae8192af3ca58135b613b97c3d4fbc","target":"record","created_at":"2026-05-18T00:19:59Z","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":"bb9fd949c4ed4058e01bea3e183077df50bbf28a2b6e853c71c9a1861b4b4bb0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-06T16:21:31Z","title_canon_sha256":"74d3be38ec596307bb530f35772471d1492f9f7fc1760826679fc93fd0b7a127"},"schema_version":"1.0","source":{"id":"1612.01888","kind":"arxiv","version":2}},"canonical_sha256":"fee93bfe66bf20441fd3de8d8f769077176e507e58c677b4541e96f33be57e46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fee93bfe66bf20441fd3de8d8f769077176e507e58c677b4541e96f33be57e46","first_computed_at":"2026-05-18T00:19:59.295216Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:59.295216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZmfliWAvGug5dUmUWbiANSHXNKgAyWpbDaP8nLsQXP7c8CZ+odsfp8ar+y7tR/DFR3lPnPN+s1Ku1pHg6GfEBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:59.295809Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01888","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc80a2f71158640f3f35b070aa370a2e06ae8192af3ca58135b613b97c3d4fbc","sha256:db4ff0e53457920d6e70b4e400d85a5b2adf8a94ea228b537ea461cbe59592e7"],"state_sha256":"627aa67c8fea8d51a1da492b1a0baefccee2e24037e4fa7b7f456f8142f22dd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hyvz69npzE42eJ6Val5mJXybQwdwp3BJiNU0ZgxL13h0SfqjJhto8UBFwVr5y4dUk081jXWwmN1BURTcskDLAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:37:32.488419Z","bundle_sha256":"c299021d4fb9a55afc9abbbf2d8bf1f636607f1d6041827cf3641b1941fa0622"}}