{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:L4OSSZ5ETPKMOU6B564S6IXL2U","short_pith_number":"pith:L4OSSZ5E","schema_version":"1.0","canonical_sha256":"5f1d2967a49bd4c753c1efb92f22ebd508122ac1095dde459e9b2c029908ab0a","source":{"kind":"arxiv","id":"1301.5482","version":2},"attestation_state":"computed","paper":{"title":"Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Kurihara, Ryutaroh Matsumoto, Tomohiko Uyematsu","submitted_at":"2013-01-23T12:18:46Z","abstract_excerpt":"By extending the notion of minimum rank distance, this paper introduces two new relative code parameters of a linear code C_1 of length n over a field extension and its subcode C_2. One is called the relative dimension/intersection profile (RDIP), and the other is called the relative generalized rank weight (RGRW). We clarify their basic properties and the relation between the RGRW and the minimum rank distance. As applications of the RDIP and the RGRW, the security performance and the error correction capability of secure network coding, guaranteed independently of the underlying network code"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1301.5482","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-23T12:18:46Z","cross_cats_sorted":["cs.CR","math.CO","math.IT"],"title_canon_sha256":"95b4c7a76920f19e459a3a6a6bd3f57ab3b08c415dec389052bbd69cd0b773b7","abstract_canon_sha256":"7793becca3f06a5d51a797739dd5e264a42dd1a9a680a8816119bb4d6a669dad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:54.824491Z","signature_b64":"Ze/wUDjwPHq+f8R5zugvKG43fybL4a8wdoRuNjIW9JZ6c6Zwjcm8N2Fn/nnFiIh0ODgEEXoBqlZlNIpwC9/PCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f1d2967a49bd4c753c1efb92f22ebd508122ac1095dde459e9b2c029908ab0a","last_reissued_at":"2026-05-18T02:09:54.823885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:54.823885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Jun Kurihara, Ryutaroh Matsumoto, Tomohiko Uyematsu","submitted_at":"2013-01-23T12:18:46Z","abstract_excerpt":"By extending the notion of minimum rank distance, this paper introduces two new relative code parameters of a linear code C_1 of length n over a field extension and its subcode C_2. One is called the relative dimension/intersection profile (RDIP), and the other is called the relative generalized rank weight (RGRW). We clarify their basic properties and the relation between the RGRW and the minimum rank distance. As applications of the RDIP and the RGRW, the security performance and the error correction capability of secure network coding, guaranteed independently of the underlying network code"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5482","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.5482","created_at":"2026-05-18T02:09:54.823966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.5482v2","created_at":"2026-05-18T02:09:54.823966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5482","created_at":"2026-05-18T02:09:54.823966+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4OSSZ5ETPKM","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4OSSZ5ETPKMOU6B","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4OSSZ5E","created_at":"2026-05-18T12:27:51.066281+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L4OSSZ5ETPKMOU6B564S6IXL2U","json":"https://pith.science/pith/L4OSSZ5ETPKMOU6B564S6IXL2U.json","graph_json":"https://pith.science/api/pith-number/L4OSSZ5ETPKMOU6B564S6IXL2U/graph.json","events_json":"https://pith.science/api/pith-number/L4OSSZ5ETPKMOU6B564S6IXL2U/events.json","paper":"https://pith.science/paper/L4OSSZ5E"},"agent_actions":{"view_html":"https://pith.science/pith/L4OSSZ5ETPKMOU6B564S6IXL2U","download_json":"https://pith.science/pith/L4OSSZ5ETPKMOU6B564S6IXL2U.json","view_paper":"https://pith.science/paper/L4OSSZ5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.5482&json=true","fetch_graph":"https://pith.science/api/pith-number/L4OSSZ5ETPKMOU6B564S6IXL2U/graph.json","fetch_events":"https://pith.science/api/pith-number/L4OSSZ5ETPKMOU6B564S6IXL2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4OSSZ5ETPKMOU6B564S6IXL2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4OSSZ5ETPKMOU6B564S6IXL2U/action/storage_attestation","attest_author":"https://pith.science/pith/L4OSSZ5ETPKMOU6B564S6IXL2U/action/author_attestation","sign_citation":"https://pith.science/pith/L4OSSZ5ETPKMOU6B564S6IXL2U/action/citation_signature","submit_replication":"https://pith.science/pith/L4OSSZ5ETPKMOU6B564S6IXL2U/action/replication_record"}},"created_at":"2026-05-18T02:09:54.823966+00:00","updated_at":"2026-05-18T02:09:54.823966+00:00"}