{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2FO2TTRZXDOED56QBTQVKINQIT","short_pith_number":"pith:2FO2TTRZ","canonical_record":{"source":{"id":"1306.6264","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T14:57:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"921b6c9b70b95e29dff252681782e6ba9f1e8854bf1d68ba2abf81d99ec801ee","abstract_canon_sha256":"54c3dcbe6eab73c9189845f0867fd8a1b2e1b007d63edcf676cf29e7d32d507a"},"schema_version":"1.0"},"canonical_sha256":"d15da9ce39b8dc41f7d00ce15521b044d78ff1a3ceeb0d90ca4af823ed859a49","source":{"kind":"arxiv","id":"1306.6264","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6264","created_at":"2026-05-18T02:45:58Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6264v2","created_at":"2026-05-18T02:45:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6264","created_at":"2026-05-18T02:45:58Z"},{"alias_kind":"pith_short_12","alias_value":"2FO2TTRZXDOE","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2FO2TTRZXDOED56Q","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2FO2TTRZ","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2FO2TTRZXDOED56QBTQVKINQIT","target":"record","payload":{"canonical_record":{"source":{"id":"1306.6264","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T14:57:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"921b6c9b70b95e29dff252681782e6ba9f1e8854bf1d68ba2abf81d99ec801ee","abstract_canon_sha256":"54c3dcbe6eab73c9189845f0867fd8a1b2e1b007d63edcf676cf29e7d32d507a"},"schema_version":"1.0"},"canonical_sha256":"d15da9ce39b8dc41f7d00ce15521b044d78ff1a3ceeb0d90ca4af823ed859a49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:58.320134Z","signature_b64":"OPkg+khPmRN3YPMRsmbaSJNT2aS70/o78DKyhSDMcq3GswJLMIr7bG+0dLVooFi1OgToU00ElsiJlmcbv8jjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d15da9ce39b8dc41f7d00ce15521b044d78ff1a3ceeb0d90ca4af823ed859a49","last_reissued_at":"2026-05-18T02:45:58.319412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:58.319412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.6264","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-18T02:45:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWc4wuDGWlPE5brikkn3eH3tie1gwB1npsAYRKBMHzwd8koPMJjkN4jxmOja42CRut3/cAERnI0QR4f3qnrMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:42:50.341738Z"},"content_sha256":"30ca8301eebe289b480b32e02e2e5f00a4e1e999d9a2a96c9354c634f70eaa4a","schema_version":"1.0","event_id":"sha256:30ca8301eebe289b480b32e02e2e5f00a4e1e999d9a2a96c9354c634f70eaa4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2FO2TTRZXDOED56QBTQVKINQIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Codes on Graphs: Fundamentals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"G. David Forney Jr","submitted_at":"2013-06-26T14:57:08Z","abstract_excerpt":"This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal new and extended results include: normal realization duality; analysis of systems-theoretic properties of fragments of realizations and their connections; \"minimal = trim and proper\" theorem for cycle-free codes; results showing that all constraint codes except interface nodes may be assumed to be trim and proper, and that the interesting part of a cyclic realization is its \"2-core;\" notions of observability and cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6264","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-18T02:45:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"naiJaVCmPQeeGhQCBAcqXUcTI3HE0i+9yUS+SGWe9RkrfG89wJ9cS1oY4RmDfgV+NzCSac4POUXtR061FxVGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:42:50.342083Z"},"content_sha256":"fafc905ae46c771bede06a6d306bbad6f202f212b3a9e0da3c4fea546b87ed5a","schema_version":"1.0","event_id":"sha256:fafc905ae46c771bede06a6d306bbad6f202f212b3a9e0da3c4fea546b87ed5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2FO2TTRZXDOED56QBTQVKINQIT/bundle.json","state_url":"https://pith.science/pith/2FO2TTRZXDOED56QBTQVKINQIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2FO2TTRZXDOED56QBTQVKINQIT/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-02T21:42:50Z","links":{"resolver":"https://pith.science/pith/2FO2TTRZXDOED56QBTQVKINQIT","bundle":"https://pith.science/pith/2FO2TTRZXDOED56QBTQVKINQIT/bundle.json","state":"https://pith.science/pith/2FO2TTRZXDOED56QBTQVKINQIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2FO2TTRZXDOED56QBTQVKINQIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2FO2TTRZXDOED56QBTQVKINQIT","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":"54c3dcbe6eab73c9189845f0867fd8a1b2e1b007d63edcf676cf29e7d32d507a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T14:57:08Z","title_canon_sha256":"921b6c9b70b95e29dff252681782e6ba9f1e8854bf1d68ba2abf81d99ec801ee"},"schema_version":"1.0","source":{"id":"1306.6264","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6264","created_at":"2026-05-18T02:45:58Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6264v2","created_at":"2026-05-18T02:45:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6264","created_at":"2026-05-18T02:45:58Z"},{"alias_kind":"pith_short_12","alias_value":"2FO2TTRZXDOE","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2FO2TTRZXDOED56Q","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2FO2TTRZ","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:fafc905ae46c771bede06a6d306bbad6f202f212b3a9e0da3c4fea546b87ed5a","target":"graph","created_at":"2026-05-18T02:45:58Z","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":"This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal new and extended results include: normal realization duality; analysis of systems-theoretic properties of fragments of realizations and their connections; \"minimal = trim and proper\" theorem for cycle-free codes; results showing that all constraint codes except interface nodes may be assumed to be trim and proper, and that the interesting part of a cyclic realization is its \"2-core;\" notions of observability and cont","authors_text":"G. David Forney Jr","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T14:57:08Z","title":"Codes on Graphs: Fundamentals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6264","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:30ca8301eebe289b480b32e02e2e5f00a4e1e999d9a2a96c9354c634f70eaa4a","target":"record","created_at":"2026-05-18T02:45:58Z","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":"54c3dcbe6eab73c9189845f0867fd8a1b2e1b007d63edcf676cf29e7d32d507a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-26T14:57:08Z","title_canon_sha256":"921b6c9b70b95e29dff252681782e6ba9f1e8854bf1d68ba2abf81d99ec801ee"},"schema_version":"1.0","source":{"id":"1306.6264","kind":"arxiv","version":2}},"canonical_sha256":"d15da9ce39b8dc41f7d00ce15521b044d78ff1a3ceeb0d90ca4af823ed859a49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d15da9ce39b8dc41f7d00ce15521b044d78ff1a3ceeb0d90ca4af823ed859a49","first_computed_at":"2026-05-18T02:45:58.319412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:58.319412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OPkg+khPmRN3YPMRsmbaSJNT2aS70/o78DKyhSDMcq3GswJLMIr7bG+0dLVooFi1OgToU00ElsiJlmcbv8jjDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:58.320134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.6264","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30ca8301eebe289b480b32e02e2e5f00a4e1e999d9a2a96c9354c634f70eaa4a","sha256:fafc905ae46c771bede06a6d306bbad6f202f212b3a9e0da3c4fea546b87ed5a"],"state_sha256":"c3224ce81dbf950be048a6615f0a586af80ae5315070bb6a469bd9610c41b076"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y6FjqW7Qqwyg+XLwDAT2xZVNgbOTbXIbgxtBaddm4PHKwZWlwqj9nnZWo1zu5MyPzcnGVDrE2M5ReE6NHXPFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:42:50.344060Z","bundle_sha256":"aca02c45c21fdaee1151c220c588c8e7937dbd63368ca9aa87ec266c231df4c3"}}