{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PRW4LSH2AWRPO7HUZTX4HF5NGW","short_pith_number":"pith:PRW4LSH2","canonical_record":{"source":{"id":"1603.06477","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-21T16:01:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a2ee84cd322c0e39bad0e56c2c2a51ea0a74252cf8d1aa0d10ffaa2ddd47a2a5","abstract_canon_sha256":"9d701823f8a594c8b6ad553a215676c1e7b6e2ccca414ca9ad746aac9a872f13"},"schema_version":"1.0"},"canonical_sha256":"7c6dc5c8fa05a2f77cf4ccefc397ad3593f6e922272ebb063734907572a58798","source":{"kind":"arxiv","id":"1603.06477","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06477","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06477v2","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06477","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"PRW4LSH2AWRP","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PRW4LSH2AWRPO7HU","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PRW4LSH2","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PRW4LSH2AWRPO7HUZTX4HF5NGW","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06477","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-21T16:01:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a2ee84cd322c0e39bad0e56c2c2a51ea0a74252cf8d1aa0d10ffaa2ddd47a2a5","abstract_canon_sha256":"9d701823f8a594c8b6ad553a215676c1e7b6e2ccca414ca9ad746aac9a872f13"},"schema_version":"1.0"},"canonical_sha256":"7c6dc5c8fa05a2f77cf4ccefc397ad3593f6e922272ebb063734907572a58798","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:40.060255Z","signature_b64":"S+8FXEL+i6FQ0rBHvL88N218g7RlXVUNo5cSiZNOVmQQS9XTBTYYbaBVqJNg64+GbCJsnIt1zf82SaBrHcyMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c6dc5c8fa05a2f77cf4ccefc397ad3593f6e922272ebb063734907572a58798","last_reissued_at":"2026-05-18T00:38:40.059796Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:40.059796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06477","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:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wIFZUp70JtaFyH29AQdQZ22AYeOyepIpw+s5XJ9SI61M6tjV+h3YZ7Y3u8P1B9tnqAHnTcCloClx+H9SlBpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:24:56.052284Z"},"content_sha256":"92afa2939c9bf1fd7ddf5290ff5b640570524e5a57990805758aa00b27b2df72","schema_version":"1.0","event_id":"sha256:92afa2939c9bf1fd7ddf5290ff5b640570524e5a57990805758aa00b27b2df72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PRW4LSH2AWRPO7HUZTX4HF5NGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized rank weights of reducible codes, optimal cases and related properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Umberto Mart\\'inez-Pe\\~nas","submitted_at":"2016-03-21T16:01:37Z","abstract_excerpt":"Reducible codes for the rank metric were introduced for cryptographic purposes. They have fast encoding and decoding algorithms, include maximum rank distance (MRD) codes and can correct many rank errors beyond half of their minimum rank distance, which makes them suitable for error-correction in network coding. In this paper, we study their security behaviour against information leakage on networks when applied as coset coding schemes, giving the following main results: 1) we give lower and upper bounds on their generalized rank weights (GRWs), which measure worst-case information leakage to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06477","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:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cEF8Xc95Lk7+IAm3T5vn33/5ePauq+K+EieFffvXW6F8mOEDwhYGD9debi6iehpbufEPP6kkFe6o0TRICb2nDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:24:56.053033Z"},"content_sha256":"02d81959b67f929152c330113cc6d862723588040dea9cc4464df0a6ebfe3607","schema_version":"1.0","event_id":"sha256:02d81959b67f929152c330113cc6d862723588040dea9cc4464df0a6ebfe3607"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PRW4LSH2AWRPO7HUZTX4HF5NGW/bundle.json","state_url":"https://pith.science/pith/PRW4LSH2AWRPO7HUZTX4HF5NGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PRW4LSH2AWRPO7HUZTX4HF5NGW/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-09T11:24:56Z","links":{"resolver":"https://pith.science/pith/PRW4LSH2AWRPO7HUZTX4HF5NGW","bundle":"https://pith.science/pith/PRW4LSH2AWRPO7HUZTX4HF5NGW/bundle.json","state":"https://pith.science/pith/PRW4LSH2AWRPO7HUZTX4HF5NGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PRW4LSH2AWRPO7HUZTX4HF5NGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PRW4LSH2AWRPO7HUZTX4HF5NGW","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":"9d701823f8a594c8b6ad553a215676c1e7b6e2ccca414ca9ad746aac9a872f13","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-21T16:01:37Z","title_canon_sha256":"a2ee84cd322c0e39bad0e56c2c2a51ea0a74252cf8d1aa0d10ffaa2ddd47a2a5"},"schema_version":"1.0","source":{"id":"1603.06477","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06477","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06477v2","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06477","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"PRW4LSH2AWRP","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PRW4LSH2AWRPO7HU","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PRW4LSH2","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:02d81959b67f929152c330113cc6d862723588040dea9cc4464df0a6ebfe3607","target":"graph","created_at":"2026-05-18T00:38:40Z","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":"Reducible codes for the rank metric were introduced for cryptographic purposes. They have fast encoding and decoding algorithms, include maximum rank distance (MRD) codes and can correct many rank errors beyond half of their minimum rank distance, which makes them suitable for error-correction in network coding. In this paper, we study their security behaviour against information leakage on networks when applied as coset coding schemes, giving the following main results: 1) we give lower and upper bounds on their generalized rank weights (GRWs), which measure worst-case information leakage to ","authors_text":"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-03-21T16:01:37Z","title":"Generalized rank weights of reducible codes, optimal cases and related properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06477","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:92afa2939c9bf1fd7ddf5290ff5b640570524e5a57990805758aa00b27b2df72","target":"record","created_at":"2026-05-18T00:38:40Z","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":"9d701823f8a594c8b6ad553a215676c1e7b6e2ccca414ca9ad746aac9a872f13","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-21T16:01:37Z","title_canon_sha256":"a2ee84cd322c0e39bad0e56c2c2a51ea0a74252cf8d1aa0d10ffaa2ddd47a2a5"},"schema_version":"1.0","source":{"id":"1603.06477","kind":"arxiv","version":2}},"canonical_sha256":"7c6dc5c8fa05a2f77cf4ccefc397ad3593f6e922272ebb063734907572a58798","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c6dc5c8fa05a2f77cf4ccefc397ad3593f6e922272ebb063734907572a58798","first_computed_at":"2026-05-18T00:38:40.059796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:40.059796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S+8FXEL+i6FQ0rBHvL88N218g7RlXVUNo5cSiZNOVmQQS9XTBTYYbaBVqJNg64+GbCJsnIt1zf82SaBrHcyMBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:40.060255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06477","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92afa2939c9bf1fd7ddf5290ff5b640570524e5a57990805758aa00b27b2df72","sha256:02d81959b67f929152c330113cc6d862723588040dea9cc4464df0a6ebfe3607"],"state_sha256":"a015c1ad2545ffbff697d9a27e27c13e1c585c25e76ddc29dd4b4201d7763ea1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OoIJXCTCO2Kfe1ARxeJAnk2iS73VDj9xu5uynG9V1rmXSvM9qMDTTOfwDkIjWLZFg7Zc8sT5p8GRz+D0V/WhBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:24:56.056937Z","bundle_sha256":"94218735dac2b07a7fc50da20b50f603baf204c3019ea7ae68d6a9d19df52b43"}}