{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:B5QAVESN55DVNWHKR5URVM3GTX","short_pith_number":"pith:B5QAVESN","schema_version":"1.0","canonical_sha256":"0f600a924def4756d8ea8f691ab3669dcbbeddd3b740c4e82a44bc6c3c27dad9","source":{"kind":"arxiv","id":"1705.10592","version":2},"attestation_state":"computed","paper":{"title":"Universal secure rank-metric coding schemes with optimal communication overheads","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":"2017-05-30T13:03:47Z","abstract_excerpt":"We study the problem of reducing the communication overhead from a noisy wire-tap channel or storage system where data is encoded as a matrix, when more columns (or their linear combinations) are available. We present its applications to reducing communication overheads in universal secure linear network coding and secure distributed storage with crisscross errors and erasures and in the presence of a wire-tapper. Our main contribution is a method to transform coding schemes based on linear rank-metric codes, with certain properties, to schemes with lower communication overheads. By applying t"},"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":"1705.10592","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-30T13:03:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5686af8fd6e796c31cbbe9f82b5804b37b56182d28c26c3a5fd3fb8191bc82ee","abstract_canon_sha256":"7515def7d6048275508505b2c786a52282cc2d6e47335228facf26d014e32c9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:43.169784Z","signature_b64":"QzlHcgQJug25a0vpPA7J9V9rKtpLFAzSTEQcT+zmqBeSCxvZVFiEQeMkPKX4jJKnjIx3MWA9PW5s5xCwa/uvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f600a924def4756d8ea8f691ab3669dcbbeddd3b740c4e82a44bc6c3c27dad9","last_reissued_at":"2026-05-18T00:36:43.169001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:43.169001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal secure rank-metric coding schemes with optimal communication overheads","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":"2017-05-30T13:03:47Z","abstract_excerpt":"We study the problem of reducing the communication overhead from a noisy wire-tap channel or storage system where data is encoded as a matrix, when more columns (or their linear combinations) are available. We present its applications to reducing communication overheads in universal secure linear network coding and secure distributed storage with crisscross errors and erasures and in the presence of a wire-tapper. Our main contribution is a method to transform coding schemes based on linear rank-metric codes, with certain properties, to schemes with lower communication overheads. By applying t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10592","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":"1705.10592","created_at":"2026-05-18T00:36:43.169118+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10592v2","created_at":"2026-05-18T00:36:43.169118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10592","created_at":"2026-05-18T00:36:43.169118+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5QAVESN55DV","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5QAVESN55DVNWHK","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5QAVESN","created_at":"2026-05-18T12:31:08.081275+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/B5QAVESN55DVNWHKR5URVM3GTX","json":"https://pith.science/pith/B5QAVESN55DVNWHKR5URVM3GTX.json","graph_json":"https://pith.science/api/pith-number/B5QAVESN55DVNWHKR5URVM3GTX/graph.json","events_json":"https://pith.science/api/pith-number/B5QAVESN55DVNWHKR5URVM3GTX/events.json","paper":"https://pith.science/paper/B5QAVESN"},"agent_actions":{"view_html":"https://pith.science/pith/B5QAVESN55DVNWHKR5URVM3GTX","download_json":"https://pith.science/pith/B5QAVESN55DVNWHKR5URVM3GTX.json","view_paper":"https://pith.science/paper/B5QAVESN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10592&json=true","fetch_graph":"https://pith.science/api/pith-number/B5QAVESN55DVNWHKR5URVM3GTX/graph.json","fetch_events":"https://pith.science/api/pith-number/B5QAVESN55DVNWHKR5URVM3GTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5QAVESN55DVNWHKR5URVM3GTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5QAVESN55DVNWHKR5URVM3GTX/action/storage_attestation","attest_author":"https://pith.science/pith/B5QAVESN55DVNWHKR5URVM3GTX/action/author_attestation","sign_citation":"https://pith.science/pith/B5QAVESN55DVNWHKR5URVM3GTX/action/citation_signature","submit_replication":"https://pith.science/pith/B5QAVESN55DVNWHKR5URVM3GTX/action/replication_record"}},"created_at":"2026-05-18T00:36:43.169118+00:00","updated_at":"2026-05-18T00:36:43.169118+00:00"}