{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AKUT5S52WHC47T7GJSDQ27MIOV","short_pith_number":"pith:AKUT5S52","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"},"canonical_sha256":"02a93ecbbab1c5cfcfe64c870d7d8875658ae14e6413c9537813552916ab7c0d","source":{"kind":"arxiv","id":"1701.07731","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07731","created_at":"2026-05-18T00:42:29Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07731v2","created_at":"2026-05-18T00:42:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07731","created_at":"2026-05-18T00:42:29Z"},{"alias_kind":"pith_short_12","alias_value":"AKUT5S52WHC4","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AKUT5S52WHC47T7G","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AKUT5S52","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AKUT5S52WHC47T7GJSDQ27MIOV","target":"record","payload":{"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"},"canonical_sha256":"02a93ecbbab1c5cfcfe64c870d7d8875658ae14e6413c9537813552916ab7c0d","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"},"source_kind":"arxiv","source_id":"1701.07731","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:42:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rktUVphfp/q1a9IsR1PdVFnlNVEFPR1MIodaWchw+u6olAVkA2otNuuh1ndQT+DoTEX+SqTg0wFh+fs+CGRCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:22:12.728912Z"},"content_sha256":"a878bf135125b259473a7987d1d558d2c7e61a101595405d4cbb079c1c8db6c5","schema_version":"1.0","event_id":"sha256:a878bf135125b259473a7987d1d558d2c7e61a101595405d4cbb079c1c8db6c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AKUT5S52WHC47T7GJSDQ27MIOV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:42:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hrern6YkuSx9uUG7w+TqWoyFcfOMSqugrjhBIQXvHlmOv7YG/GwNsI95Fe45wUlN1HBSFGbi0GY7EPxt71uNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:22:12.729633Z"},"content_sha256":"ad4002355441480458e3ddbe7863b2d64924d3e208585900eed7aadf8af7e432","schema_version":"1.0","event_id":"sha256:ad4002355441480458e3ddbe7863b2d64924d3e208585900eed7aadf8af7e432"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKUT5S52WHC47T7GJSDQ27MIOV/bundle.json","state_url":"https://pith.science/pith/AKUT5S52WHC47T7GJSDQ27MIOV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKUT5S52WHC47T7GJSDQ27MIOV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T02:22:12Z","links":{"resolver":"https://pith.science/pith/AKUT5S52WHC47T7GJSDQ27MIOV","bundle":"https://pith.science/pith/AKUT5S52WHC47T7GJSDQ27MIOV/bundle.json","state":"https://pith.science/pith/AKUT5S52WHC47T7GJSDQ27MIOV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKUT5S52WHC47T7GJSDQ27MIOV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AKUT5S52WHC47T7GJSDQ27MIOV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a44b92a845374b65f1af2f07a0e4333e729f04d9f5e38be8175de92aa63c206f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-26T14:58:11Z","title_canon_sha256":"976a429f0933f19ea935063e0498ec01dbeb4dd9bb607fc0feeda8fcf5179027"},"schema_version":"1.0","source":{"id":"1701.07731","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.07731","created_at":"2026-05-18T00:42:29Z"},{"alias_kind":"arxiv_version","alias_value":"1701.07731v2","created_at":"2026-05-18T00:42:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07731","created_at":"2026-05-18T00:42:29Z"},{"alias_kind":"pith_short_12","alias_value":"AKUT5S52WHC4","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AKUT5S52WHC47T7G","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AKUT5S52","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:ad4002355441480458e3ddbe7863b2d64924d3e208585900eed7aadf8af7e432","target":"graph","created_at":"2026-05-18T00:42:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"J\\'er\\^ome Lacan, Jonathan Detchart","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-26T14:58:11Z","title":"Fast Xor-based Erasure Coding based on Polynomial Ring Transforms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07731","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a878bf135125b259473a7987d1d558d2c7e61a101595405d4cbb079c1c8db6c5","target":"record","created_at":"2026-05-18T00:42:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a44b92a845374b65f1af2f07a0e4333e729f04d9f5e38be8175de92aa63c206f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-26T14:58:11Z","title_canon_sha256":"976a429f0933f19ea935063e0498ec01dbeb4dd9bb607fc0feeda8fcf5179027"},"schema_version":"1.0","source":{"id":"1701.07731","kind":"arxiv","version":2}},"canonical_sha256":"02a93ecbbab1c5cfcfe64c870d7d8875658ae14e6413c9537813552916ab7c0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02a93ecbbab1c5cfcfe64c870d7d8875658ae14e6413c9537813552916ab7c0d","first_computed_at":"2026-05-18T00:42:29.864102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:29.864102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1f8gJthUuoDAuJhTEZP1+w2idTdCTizWjza5NXv015Xj8naCRgDYTOuaoIYjx7BUVbTO9yvjlBIeFZ/E82MqAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:29.864626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.07731","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a878bf135125b259473a7987d1d558d2c7e61a101595405d4cbb079c1c8db6c5","sha256:ad4002355441480458e3ddbe7863b2d64924d3e208585900eed7aadf8af7e432"],"state_sha256":"022ae5a1afdfc190f0dd225b92e30cc28b0ac5a2151952b96414335b339ff376"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UpP0usl3wncJD3VCr6hJVoqfh+HcrCwwkM+Zfof4ZVAN4dVKEFBZySRuyua1TEiJlOI/47ocaceL0XwBGqv/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:22:12.733744Z","bundle_sha256":"cb711f098f11ab09f3fe3b72d2449a24cc1be20d2680233d277fe91efd92b1d4"}}