{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PSYAA356LFBQD2NE7VYTNIGYLG","short_pith_number":"pith:PSYAA356","schema_version":"1.0","canonical_sha256":"7cb0006fbe594301e9a4fd7136a0d859a6b6feb36c89351135ea1ad277395572","source":{"kind":"arxiv","id":"1608.03215","version":1},"attestation_state":"computed","paper":{"title":"On quasi-cyclic subspace codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ismael Gutierrez Garcia, Ivan Molina Naizir","submitted_at":"2016-08-10T15:40:05Z","abstract_excerpt":"Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual methods for constructing cyclic subspace codes over finite fields works for m-quasi cyclic codes, namely the subspaces polynomials and Frobenius mappings."},"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":"1608.03215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-08-10T15:40:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f589ca1020a3cd1142401f0cce72cb3e75d13c40489a8f6fb113a0378e4b2c7d","abstract_canon_sha256":"a90fdf3db559726eca001462ea9bf47aa2bbe3e5493cc95d75b1061dca1327f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:30.013449Z","signature_b64":"nlCHATC7X3doRZSsKGC0+WCNBoeQLTsz3ClC7v3q/BG5SMNMUH9jh9fsPZ90tNkFF5FVF6GR+Y++JQwJa3WrCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cb0006fbe594301e9a4fd7136a0d859a6b6feb36c89351135ea1ad277395572","last_reissued_at":"2026-05-18T01:09:30.013060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:30.013060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On quasi-cyclic subspace codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ismael Gutierrez Garcia, Ivan Molina Naizir","submitted_at":"2016-08-10T15:40:05Z","abstract_excerpt":"Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual methods for constructing cyclic subspace codes over finite fields works for m-quasi cyclic codes, namely the subspaces polynomials and Frobenius mappings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03215","kind":"arxiv","version":1},"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":"1608.03215","created_at":"2026-05-18T01:09:30.013129+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03215v1","created_at":"2026-05-18T01:09:30.013129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03215","created_at":"2026-05-18T01:09:30.013129+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSYAA356LFBQ","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSYAA356LFBQD2NE","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSYAA356","created_at":"2026-05-18T12:30:39.010887+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/PSYAA356LFBQD2NE7VYTNIGYLG","json":"https://pith.science/pith/PSYAA356LFBQD2NE7VYTNIGYLG.json","graph_json":"https://pith.science/api/pith-number/PSYAA356LFBQD2NE7VYTNIGYLG/graph.json","events_json":"https://pith.science/api/pith-number/PSYAA356LFBQD2NE7VYTNIGYLG/events.json","paper":"https://pith.science/paper/PSYAA356"},"agent_actions":{"view_html":"https://pith.science/pith/PSYAA356LFBQD2NE7VYTNIGYLG","download_json":"https://pith.science/pith/PSYAA356LFBQD2NE7VYTNIGYLG.json","view_paper":"https://pith.science/paper/PSYAA356","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03215&json=true","fetch_graph":"https://pith.science/api/pith-number/PSYAA356LFBQD2NE7VYTNIGYLG/graph.json","fetch_events":"https://pith.science/api/pith-number/PSYAA356LFBQD2NE7VYTNIGYLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSYAA356LFBQD2NE7VYTNIGYLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSYAA356LFBQD2NE7VYTNIGYLG/action/storage_attestation","attest_author":"https://pith.science/pith/PSYAA356LFBQD2NE7VYTNIGYLG/action/author_attestation","sign_citation":"https://pith.science/pith/PSYAA356LFBQD2NE7VYTNIGYLG/action/citation_signature","submit_replication":"https://pith.science/pith/PSYAA356LFBQD2NE7VYTNIGYLG/action/replication_record"}},"created_at":"2026-05-18T01:09:30.013129+00:00","updated_at":"2026-05-18T01:09:30.013129+00:00"}