{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4AM5UAG3KDSKDD52KZGIICBSYA","short_pith_number":"pith:4AM5UAG3","schema_version":"1.0","canonical_sha256":"e019da00db50e4a18fba564c840832c02060886eb38bf6ac8767a10751ef2fba","source":{"kind":"arxiv","id":"1203.5325","version":2},"attestation_state":"computed","paper":{"title":"Exact-Repair Minimum Bandwidth Regenerating Codes Based on Evaluation of Linearized Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongmei Xie, Zhiyuan Yan","submitted_at":"2012-03-23T19:34:32Z","abstract_excerpt":"In this paper, we propose two new constructions of exact-repair minimum storage regenerating (exact-MBR) codes. Both constructions obtain the encoded symbols by first treating the message vector over GF(q) as a linearized polynomial and then evaluating it over an extension field GF(q^m). The evaluation points are chosen so that the encoded symbols at any node are conjugates of each other, while corresponding symbols of different nodes are linearly dependent with respect to GF(q). These properties ensure that data repair can be carried out over the base field GF(q), instead of matrix inversion "},"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":"1203.5325","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-23T19:34:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1523f7488f0534c8d4cab7fc40de336e968671e0f7e25fb8830ee316fd656359","abstract_canon_sha256":"c758a63a4bbcabb9263f6318a6b8035fd813d3f210b1710a5b993588686f8607"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:04.623828Z","signature_b64":"PJWyyTzpa32SNbhRIJma3NSdk2dT0B3gpn9nvzoLHaI+wl6GvMLhNSMwAEfNgTSZioBKPjdFYMpmJ569AQEwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e019da00db50e4a18fba564c840832c02060886eb38bf6ac8767a10751ef2fba","last_reissued_at":"2026-05-18T03:36:04.623297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:04.623297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact-Repair Minimum Bandwidth Regenerating Codes Based on Evaluation of Linearized Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongmei Xie, Zhiyuan Yan","submitted_at":"2012-03-23T19:34:32Z","abstract_excerpt":"In this paper, we propose two new constructions of exact-repair minimum storage regenerating (exact-MBR) codes. Both constructions obtain the encoded symbols by first treating the message vector over GF(q) as a linearized polynomial and then evaluating it over an extension field GF(q^m). The evaluation points are chosen so that the encoded symbols at any node are conjugates of each other, while corresponding symbols of different nodes are linearly dependent with respect to GF(q). These properties ensure that data repair can be carried out over the base field GF(q), instead of matrix inversion "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5325","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":"1203.5325","created_at":"2026-05-18T03:36:04.623390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.5325v2","created_at":"2026-05-18T03:36:04.623390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5325","created_at":"2026-05-18T03:36:04.623390+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AM5UAG3KDSK","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AM5UAG3KDSKDD52","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AM5UAG3","created_at":"2026-05-18T12:26:53.410803+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/4AM5UAG3KDSKDD52KZGIICBSYA","json":"https://pith.science/pith/4AM5UAG3KDSKDD52KZGIICBSYA.json","graph_json":"https://pith.science/api/pith-number/4AM5UAG3KDSKDD52KZGIICBSYA/graph.json","events_json":"https://pith.science/api/pith-number/4AM5UAG3KDSKDD52KZGIICBSYA/events.json","paper":"https://pith.science/paper/4AM5UAG3"},"agent_actions":{"view_html":"https://pith.science/pith/4AM5UAG3KDSKDD52KZGIICBSYA","download_json":"https://pith.science/pith/4AM5UAG3KDSKDD52KZGIICBSYA.json","view_paper":"https://pith.science/paper/4AM5UAG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.5325&json=true","fetch_graph":"https://pith.science/api/pith-number/4AM5UAG3KDSKDD52KZGIICBSYA/graph.json","fetch_events":"https://pith.science/api/pith-number/4AM5UAG3KDSKDD52KZGIICBSYA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AM5UAG3KDSKDD52KZGIICBSYA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AM5UAG3KDSKDD52KZGIICBSYA/action/storage_attestation","attest_author":"https://pith.science/pith/4AM5UAG3KDSKDD52KZGIICBSYA/action/author_attestation","sign_citation":"https://pith.science/pith/4AM5UAG3KDSKDD52KZGIICBSYA/action/citation_signature","submit_replication":"https://pith.science/pith/4AM5UAG3KDSKDD52KZGIICBSYA/action/replication_record"}},"created_at":"2026-05-18T03:36:04.623390+00:00","updated_at":"2026-05-18T03:36:04.623390+00:00"}