{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:HYQ6MZWJLXYFRIUK3OXH2GAYQG","short_pith_number":"pith:HYQ6MZWJ","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"},"canonical_sha256":"3e21e666c95df058a28adbae7d181881b164d9c0b8d34e9b5fd107c59177d25a","source":{"kind":"arxiv","id":"0902.3883","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.3883","created_at":"2026-05-18T04:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"0902.3883v3","created_at":"2026-05-18T04:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.3883","created_at":"2026-05-18T04:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"HYQ6MZWJLXYF","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"HYQ6MZWJLXYFRIUK","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"HYQ6MZWJ","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:HYQ6MZWJLXYFRIUK3OXH2GAYQG","target":"record","payload":{"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"},"canonical_sha256":"3e21e666c95df058a28adbae7d181881b164d9c0b8d34e9b5fd107c59177d25a","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"},"source_kind":"arxiv","source_id":"0902.3883","source_version":3,"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-18T04:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QYlqGKc3ztXLpMiy9hVad7Po1+e3ESeRFf1Cey7WQh/s1ta48NmKnADcbFtwcIlAq3gkYGwJRWqZLNRvQ0fUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:04:35.823704Z"},"content_sha256":"52b022e9f2be3ba4af9d0e4ea3f6db8fb07e7d15eca7b88beccc6010a0ebf900","schema_version":"1.0","event_id":"sha256:52b022e9f2be3ba4af9d0e4ea3f6db8fb07e7d15eca7b88beccc6010a0ebf900"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:HYQ6MZWJLXYFRIUK3OXH2GAYQG","target":"graph","payload":{"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"},"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-18T04:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jqeMoQvfK4AOAU9Nmvf0lmjueld/XSmewV+UAbopoozxmi+DvXBBHAE6i/ksCJG5+BbwkPnshbK8/hf9OxaGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:04:35.824104Z"},"content_sha256":"2823cf5769180ff9be8cdda3db102acbb30f579ab2d9e1100bf5ceb3fd3d552d","schema_version":"1.0","event_id":"sha256:2823cf5769180ff9be8cdda3db102acbb30f579ab2d9e1100bf5ceb3fd3d552d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG/bundle.json","state_url":"https://pith.science/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG/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-09T16:04:35Z","links":{"resolver":"https://pith.science/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG","bundle":"https://pith.science/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG/bundle.json","state":"https://pith.science/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HYQ6MZWJLXYFRIUK3OXH2GAYQG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:HYQ6MZWJLXYFRIUK3OXH2GAYQG","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":"b4ea23b9bf468859ca3e0251301dc9df46033b20f6d5d93c9e7e3ba8ff0e16ca","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-02-23T10:35:11Z","title_canon_sha256":"0ce5bd68efeb0c306eb65764639e9c8e33e69c6354b07d267dd72cfc639c98de"},"schema_version":"1.0","source":{"id":"0902.3883","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.3883","created_at":"2026-05-18T04:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"0902.3883v3","created_at":"2026-05-18T04:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.3883","created_at":"2026-05-18T04:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"HYQ6MZWJLXYF","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"HYQ6MZWJLXYFRIUK","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"HYQ6MZWJ","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:2823cf5769180ff9be8cdda3db102acbb30f579ab2d9e1100bf5ceb3fd3d552d","target":"graph","created_at":"2026-05-18T04:26:45Z","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 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","authors_text":"Lars Eirik Danielsen, Matthew G. Parker","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-02-23T10:35:11Z","title":"Directed Graph Representation of Half-Rate Additive Codes over GF(4)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.3883","kind":"arxiv","version":3},"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:52b022e9f2be3ba4af9d0e4ea3f6db8fb07e7d15eca7b88beccc6010a0ebf900","target":"record","created_at":"2026-05-18T04:26:45Z","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":"b4ea23b9bf468859ca3e0251301dc9df46033b20f6d5d93c9e7e3ba8ff0e16ca","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-02-23T10:35:11Z","title_canon_sha256":"0ce5bd68efeb0c306eb65764639e9c8e33e69c6354b07d267dd72cfc639c98de"},"schema_version":"1.0","source":{"id":"0902.3883","kind":"arxiv","version":3}},"canonical_sha256":"3e21e666c95df058a28adbae7d181881b164d9c0b8d34e9b5fd107c59177d25a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e21e666c95df058a28adbae7d181881b164d9c0b8d34e9b5fd107c59177d25a","first_computed_at":"2026-05-18T04:26:45.939088Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:45.939088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"36JtsiGRczS0r031Mn2AnHMJsgV/NtACZMlEWjp5ml5EL8jMXELuKzsgtfc4f7Puk0oxh9yHcrhfyvXRNaoKAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:45.939680Z","signed_message":"canonical_sha256_bytes"},"source_id":"0902.3883","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52b022e9f2be3ba4af9d0e4ea3f6db8fb07e7d15eca7b88beccc6010a0ebf900","sha256:2823cf5769180ff9be8cdda3db102acbb30f579ab2d9e1100bf5ceb3fd3d552d"],"state_sha256":"84c2f4dd0b65869f8903aac7c85e0431a7a3d8cc51429667941b8efde728fa23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"abXsjKOi/e+ZQVWNAkhUfAydtFmEFfVDIfeF07SVZg3esiLAecslJiqebF1vF+lu4wXGbbgq0K+Oq9vFtBd1AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:04:35.826979Z","bundle_sha256":"5c355c3deb1d75e201d8a17b127b4e0cb58acabcb662a28890a79075acac6a00"}}