{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2FO2TTRZXDOED56QBTQVKINQIT","short_pith_number":"pith:2FO2TTRZ","schema_version":"1.0","canonical_sha256":"d15da9ce39b8dc41f7d00ce15521b044d78ff1a3ceeb0d90ca4af823ed859a49","source":{"kind":"arxiv","id":"1306.6264","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.6264","created_at":"2026-05-18T02:45:58.319690+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6264v2","created_at":"2026-05-18T02:45:58.319690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6264","created_at":"2026-05-18T02:45:58.319690+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FO2TTRZXDOE","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FO2TTRZXDOED56Q","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FO2TTRZ","created_at":"2026-05-18T12:27:30.460161+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/2FO2TTRZXDOED56QBTQVKINQIT","json":"https://pith.science/pith/2FO2TTRZXDOED56QBTQVKINQIT.json","graph_json":"https://pith.science/api/pith-number/2FO2TTRZXDOED56QBTQVKINQIT/graph.json","events_json":"https://pith.science/api/pith-number/2FO2TTRZXDOED56QBTQVKINQIT/events.json","paper":"https://pith.science/paper/2FO2TTRZ"},"agent_actions":{"view_html":"https://pith.science/pith/2FO2TTRZXDOED56QBTQVKINQIT","download_json":"https://pith.science/pith/2FO2TTRZXDOED56QBTQVKINQIT.json","view_paper":"https://pith.science/paper/2FO2TTRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6264&json=true","fetch_graph":"https://pith.science/api/pith-number/2FO2TTRZXDOED56QBTQVKINQIT/graph.json","fetch_events":"https://pith.science/api/pith-number/2FO2TTRZXDOED56QBTQVKINQIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FO2TTRZXDOED56QBTQVKINQIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FO2TTRZXDOED56QBTQVKINQIT/action/storage_attestation","attest_author":"https://pith.science/pith/2FO2TTRZXDOED56QBTQVKINQIT/action/author_attestation","sign_citation":"https://pith.science/pith/2FO2TTRZXDOED56QBTQVKINQIT/action/citation_signature","submit_replication":"https://pith.science/pith/2FO2TTRZXDOED56QBTQVKINQIT/action/replication_record"}},"created_at":"2026-05-18T02:45:58.319690+00:00","updated_at":"2026-05-18T02:45:58.319690+00:00"}