{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:BE4A3QTKR7QOR5EN4XKUURAZDF","short_pith_number":"pith:BE4A3QTK","schema_version":"1.0","canonical_sha256":"09380dc26a8fe0e8f48de5d54a4419196d1c064d962a9f01f02f05d3ad3c5a5f","source":{"kind":"arxiv","id":"2011.04611","version":2},"attestation_state":"computed","paper":{"title":"On the hardness of code equivalence problems in rank metric","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Alain Couvreur, Philippe Gaborit, Thomas Debris-Alazard","submitted_at":"2020-11-09T18:14:03Z","abstract_excerpt":"In the recent years, the notion of rank metric in the context of coding theory has known many interesting developments in terms of applications such as space time coding, network coding or public key cryptography. These applications raised the interest of the community for theoretical properties of this type of codes, such as the hardness of decoding in rank metric. Among classical problems associated to codes for a given metric, the notion of code equivalence (to decide if two codes are isometric) has always been of the greatest interest, for its cryptographic applications or its deep connexi"},"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":"2011.04611","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2020-11-09T18:14:03Z","cross_cats_sorted":["cs.CG","math.IT","math.RA"],"title_canon_sha256":"aba86e520a669dde6860764ec2a24d8f07d053c636a1829fcce94f875818f048","abstract_canon_sha256":"77dca125ae4eb0694dce7d3cdce023b69347c2803c211efdc3bd4a36c6851023"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:48:09.726779Z","signature_b64":"HdiOKAYM6hrfXplP92qZOxeCggQPNJPtXICjAL3Y6EA63puieERscDKsartf5NbRI+496PsC4LynbyCjRH5MDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09380dc26a8fe0e8f48de5d54a4419196d1c064d962a9f01f02f05d3ad3c5a5f","last_reissued_at":"2026-07-05T02:48:09.726293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:48:09.726293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the hardness of code equivalence problems in rank metric","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","math.IT","math.RA"],"primary_cat":"cs.IT","authors_text":"Alain Couvreur, Philippe Gaborit, Thomas Debris-Alazard","submitted_at":"2020-11-09T18:14:03Z","abstract_excerpt":"In the recent years, the notion of rank metric in the context of coding theory has known many interesting developments in terms of applications such as space time coding, network coding or public key cryptography. These applications raised the interest of the community for theoretical properties of this type of codes, such as the hardness of decoding in rank metric. Among classical problems associated to codes for a given metric, the notion of code equivalence (to decide if two codes are isometric) has always been of the greatest interest, for its cryptographic applications or its deep connexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04611","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.04611/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.04611","created_at":"2026-07-05T02:48:09.726377+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.04611v2","created_at":"2026-07-05T02:48:09.726377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04611","created_at":"2026-07-05T02:48:09.726377+00:00"},{"alias_kind":"pith_short_12","alias_value":"BE4A3QTKR7QO","created_at":"2026-07-05T02:48:09.726377+00:00"},{"alias_kind":"pith_short_16","alias_value":"BE4A3QTKR7QOR5EN","created_at":"2026-07-05T02:48:09.726377+00:00"},{"alias_kind":"pith_short_8","alias_value":"BE4A3QTK","created_at":"2026-07-05T02:48:09.726377+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23681","citing_title":"New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BE4A3QTKR7QOR5EN4XKUURAZDF","json":"https://pith.science/pith/BE4A3QTKR7QOR5EN4XKUURAZDF.json","graph_json":"https://pith.science/api/pith-number/BE4A3QTKR7QOR5EN4XKUURAZDF/graph.json","events_json":"https://pith.science/api/pith-number/BE4A3QTKR7QOR5EN4XKUURAZDF/events.json","paper":"https://pith.science/paper/BE4A3QTK"},"agent_actions":{"view_html":"https://pith.science/pith/BE4A3QTKR7QOR5EN4XKUURAZDF","download_json":"https://pith.science/pith/BE4A3QTKR7QOR5EN4XKUURAZDF.json","view_paper":"https://pith.science/paper/BE4A3QTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.04611&json=true","fetch_graph":"https://pith.science/api/pith-number/BE4A3QTKR7QOR5EN4XKUURAZDF/graph.json","fetch_events":"https://pith.science/api/pith-number/BE4A3QTKR7QOR5EN4XKUURAZDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BE4A3QTKR7QOR5EN4XKUURAZDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BE4A3QTKR7QOR5EN4XKUURAZDF/action/storage_attestation","attest_author":"https://pith.science/pith/BE4A3QTKR7QOR5EN4XKUURAZDF/action/author_attestation","sign_citation":"https://pith.science/pith/BE4A3QTKR7QOR5EN4XKUURAZDF/action/citation_signature","submit_replication":"https://pith.science/pith/BE4A3QTKR7QOR5EN4XKUURAZDF/action/replication_record"}},"created_at":"2026-07-05T02:48:09.726377+00:00","updated_at":"2026-07-05T02:48:09.726377+00:00"}