{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:HYQ6MZWJLXYFRIUK3OXH2GAYQG","short_pith_number":"pith:HYQ6MZWJ","schema_version":"1.0","canonical_sha256":"3e21e666c95df058a28adbae7d181881b164d9c0b8d34e9b5fd107c59177d25a","source":{"kind":"arxiv","id":"0902.3883","version":3},"attestation_state":"computed","paper":{"title":"Directed Graph Representation of Half-Rate Additive Codes over GF(4)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Lars Eirik Danielsen, Matthew G. Parker","submitted_at":"2009-02-23T10:35:11Z","abstract_excerpt":"We show that (n,2^n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation reduces the complexity of code classification, and enables us to classify additive (n,2^n) codes over GF(4) of length up to 7. From this we also derive classifications of isodual and formally self-dual codes. We introduce new constructions of circulant and bordered circulant directed graph codes, and show that these codes will always be isodual. A computer search of all such cod"},"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":"0902.3883","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-02-23T10:35:11Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0ce5bd68efeb0c306eb65764639e9c8e33e69c6354b07d267dd72cfc639c98de","abstract_canon_sha256":"b4ea23b9bf468859ca3e0251301dc9df46033b20f6d5d93c9e7e3ba8ff0e16ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:45.939680Z","signature_b64":"36JtsiGRczS0r031Mn2AnHMJsgV/NtACZMlEWjp5ml5EL8jMXELuKzsgtfc4f7Puk0oxh9yHcrhfyvXRNaoKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e21e666c95df058a28adbae7d181881b164d9c0b8d34e9b5fd107c59177d25a","last_reissued_at":"2026-05-18T04:26:45.939088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:45.939088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Directed Graph Representation of Half-Rate Additive Codes over GF(4)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Lars Eirik Danielsen, Matthew G. Parker","submitted_at":"2009-02-23T10:35:11Z","abstract_excerpt":"We show that (n,2^n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation reduces the complexity of code classification, and enables us to classify additive (n,2^n) codes over GF(4) of length up to 7. From this we also derive classifications of isodual and formally self-dual codes. We introduce new constructions of circulant and bordered circulant directed graph codes, and show that these codes will always be isodual. A computer search of all such cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.3883","kind":"arxiv","version":3},"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":"0902.3883","created_at":"2026-05-18T04:26:45.939163+00:00"},{"alias_kind":"arxiv_version","alias_value":"0902.3883v3","created_at":"2026-05-18T04:26:45.939163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.3883","created_at":"2026-05-18T04:26:45.939163+00:00"},{"alias_kind":"pith_short_12","alias_value":"HYQ6MZWJLXYF","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"HYQ6MZWJLXYFRIUK","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"HYQ6MZWJ","created_at":"2026-05-18T12:25:59.703012+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/HYQ6MZWJLXYFRIUK3OXH2GAYQG","json":"https://pith.science/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG.json","graph_json":"https://pith.science/api/pith-number/HYQ6MZWJLXYFRIUK3OXH2GAYQG/graph.json","events_json":"https://pith.science/api/pith-number/HYQ6MZWJLXYFRIUK3OXH2GAYQG/events.json","paper":"https://pith.science/paper/HYQ6MZWJ"},"agent_actions":{"view_html":"https://pith.science/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG","download_json":"https://pith.science/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG.json","view_paper":"https://pith.science/paper/HYQ6MZWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0902.3883&json=true","fetch_graph":"https://pith.science/api/pith-number/HYQ6MZWJLXYFRIUK3OXH2GAYQG/graph.json","fetch_events":"https://pith.science/api/pith-number/HYQ6MZWJLXYFRIUK3OXH2GAYQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG/action/storage_attestation","attest_author":"https://pith.science/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG/action/author_attestation","sign_citation":"https://pith.science/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG/action/citation_signature","submit_replication":"https://pith.science/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG/action/replication_record"}},"created_at":"2026-05-18T04:26:45.939163+00:00","updated_at":"2026-05-18T04:26:45.939163+00:00"}