{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AKUT5S52WHC47T7GJSDQ27MIOV","short_pith_number":"pith:AKUT5S52","schema_version":"1.0","canonical_sha256":"02a93ecbbab1c5cfcfe64c870d7d8875658ae14e6413c9537813552916ab7c0d","source":{"kind":"arxiv","id":"1701.07731","version":2},"attestation_state":"computed","paper":{"title":"Fast Xor-based Erasure Coding based on Polynomial Ring Transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"J\\'er\\^ome Lacan, Jonathan Detchart","submitted_at":"2017-01-26T14:58:11Z","abstract_excerpt":"The complexity of software implementations of MDS erasure codes mainly depends on the efficiency of the finite field operations implementation. In this paper, we propose a method to reduce the complexity of the finite field multiplication by using fast transforms between a field and a ring to perform the multiplication in a ring. We show that moving to a ring reduces the complexity of the operations. Then, we show that this construction allows the use of simple scheduling to reduce the number of operations."},"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":"1701.07731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-26T14:58:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"976a429f0933f19ea935063e0498ec01dbeb4dd9bb607fc0feeda8fcf5179027","abstract_canon_sha256":"a44b92a845374b65f1af2f07a0e4333e729f04d9f5e38be8175de92aa63c206f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:29.864626Z","signature_b64":"1f8gJthUuoDAuJhTEZP1+w2idTdCTizWjza5NXv015Xj8naCRgDYTOuaoIYjx7BUVbTO9yvjlBIeFZ/E82MqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02a93ecbbab1c5cfcfe64c870d7d8875658ae14e6413c9537813552916ab7c0d","last_reissued_at":"2026-05-18T00:42:29.864102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:29.864102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Xor-based Erasure Coding based on Polynomial Ring Transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"J\\'er\\^ome Lacan, Jonathan Detchart","submitted_at":"2017-01-26T14:58:11Z","abstract_excerpt":"The complexity of software implementations of MDS erasure codes mainly depends on the efficiency of the finite field operations implementation. In this paper, we propose a method to reduce the complexity of the finite field multiplication by using fast transforms between a field and a ring to perform the multiplication in a ring. We show that moving to a ring reduces the complexity of the operations. Then, we show that this construction allows the use of simple scheduling to reduce the number of operations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07731","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":"1701.07731","created_at":"2026-05-18T00:42:29.864189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07731v2","created_at":"2026-05-18T00:42:29.864189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07731","created_at":"2026-05-18T00:42:29.864189+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKUT5S52WHC4","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKUT5S52WHC47T7G","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKUT5S52","created_at":"2026-05-18T12:31:05.417338+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/AKUT5S52WHC47T7GJSDQ27MIOV","json":"https://pith.science/pith/AKUT5S52WHC47T7GJSDQ27MIOV.json","graph_json":"https://pith.science/api/pith-number/AKUT5S52WHC47T7GJSDQ27MIOV/graph.json","events_json":"https://pith.science/api/pith-number/AKUT5S52WHC47T7GJSDQ27MIOV/events.json","paper":"https://pith.science/paper/AKUT5S52"},"agent_actions":{"view_html":"https://pith.science/pith/AKUT5S52WHC47T7GJSDQ27MIOV","download_json":"https://pith.science/pith/AKUT5S52WHC47T7GJSDQ27MIOV.json","view_paper":"https://pith.science/paper/AKUT5S52","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07731&json=true","fetch_graph":"https://pith.science/api/pith-number/AKUT5S52WHC47T7GJSDQ27MIOV/graph.json","fetch_events":"https://pith.science/api/pith-number/AKUT5S52WHC47T7GJSDQ27MIOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKUT5S52WHC47T7GJSDQ27MIOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKUT5S52WHC47T7GJSDQ27MIOV/action/storage_attestation","attest_author":"https://pith.science/pith/AKUT5S52WHC47T7GJSDQ27MIOV/action/author_attestation","sign_citation":"https://pith.science/pith/AKUT5S52WHC47T7GJSDQ27MIOV/action/citation_signature","submit_replication":"https://pith.science/pith/AKUT5S52WHC47T7GJSDQ27MIOV/action/replication_record"}},"created_at":"2026-05-18T00:42:29.864189+00:00","updated_at":"2026-05-18T00:42:29.864189+00:00"}