{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:A3EBG5FIJGGGLNDLCLGCIAHP2Q","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":"7af9eea814e8671879c19f23156167a42a0988e2c3fdbdcf92fdc8a9ded5fc1e","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-04-04T15:06:14Z","title_canon_sha256":"6cadc4bb1b7799a9520f222d53371f501312efa9ec40ade737f03a4ab46e6173"},"schema_version":"1.0","source":{"id":"0704.0590","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0704.0590","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"0704.0590v2","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0704.0590","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"A3EBG5FIJGGG","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"A3EBG5FIJGGGLNDL","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"A3EBG5FI","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:0c4f8ef72dded45d8f3391930ea99d0331196052741b1ca54de751fb66026055","target":"graph","created_at":"2026-05-18T00:58:26Z","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":"We present an algorithm for systematic encoding of Hermitian codes. For a Hermitian code defined over GF(q^2), the proposed algorithm achieves a run time complexity of O(q^2) and is suitable for VLSI implementation. The encoder architecture uses as main blocks q varying-rate Reed-Solomon encoders and achieves a space complexity of O(q^2) in terms of finite field multipliers and memory elements.","authors_text":"Emanuel Popovici, Rachit Agarwal, Ralf Koetter","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2007-04-04T15:06:14Z","title":"A Low Complexity Algorithm and Architecture for Systematic Encoding of Hermitian Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0704.0590","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:b6c8a5c836d6fdd4996febb38c79b19b052137f741ea024b09abb255ad1fe1f7","target":"record","created_at":"2026-05-18T00:58:26Z","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":"7af9eea814e8671879c19f23156167a42a0988e2c3fdbdcf92fdc8a9ded5fc1e","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-04-04T15:06:14Z","title_canon_sha256":"6cadc4bb1b7799a9520f222d53371f501312efa9ec40ade737f03a4ab46e6173"},"schema_version":"1.0","source":{"id":"0704.0590","kind":"arxiv","version":2}},"canonical_sha256":"06c81374a8498c65b46b12cc2400efd438838c8c25f4f4f9973088e0dbe39237","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06c81374a8498c65b46b12cc2400efd438838c8c25f4f4f9973088e0dbe39237","first_computed_at":"2026-05-18T00:58:26.277971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:26.277971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d++lzp4bR4kb+Zdo3phjrXhdedqDKyJscexu9v/Q/bqLFyCw2WM4JaCqYq86v32taZGLTtncGfntpYyaq748Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:26.278606Z","signed_message":"canonical_sha256_bytes"},"source_id":"0704.0590","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6c8a5c836d6fdd4996febb38c79b19b052137f741ea024b09abb255ad1fe1f7","sha256:0c4f8ef72dded45d8f3391930ea99d0331196052741b1ca54de751fb66026055"],"state_sha256":"4370f378b979eac7441dcedd007bf892b31b3ea3360aafa98281830e26a2d5d2"}