{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UH5OXIVZPZR4KO7EENDP5OS7J3","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":"7bcc34b0f32f3b9d7aaddcbe89b35a9f865b7e0173e272b325e4452f572dce4f","cross_cats_sorted":["cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-14T15:34:27Z","title_canon_sha256":"6d9ef230a6a5b43fc2e25996e877663580e600869018681804cddabbaeae43e2"},"schema_version":"1.0","source":{"id":"1203.3115","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3115","created_at":"2026-05-18T03:46:47Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3115v2","created_at":"2026-05-18T03:46:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3115","created_at":"2026-05-18T03:46:47Z"},{"alias_kind":"pith_short_12","alias_value":"UH5OXIVZPZR4","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UH5OXIVZPZR4KO7E","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UH5OXIVZ","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:a1630233588e95f927b56b0614bf549fea9e1de57ca3fe82c1155c7f398e0b76","target":"graph","created_at":"2026-05-18T03:46:47Z","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 investigates properties of realizations of linear or group codes on general graphs that lead to local reducibility.\n  Trimness and properness are dual properties of constraint codes. A linear or group realization with a constraint code that is not both trim and proper is locally reducible. A linear or group realization on a finite cycle-free graph is minimal if and only if every local constraint code is trim and proper.\n  A realization is called observable if there is a one-to-one correspondence between codewords and configurations, and controllable if it has independent constraints","authors_text":"G. David Forney Jr, Heide Gluesing-Luerssen","cross_cats":["cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-14T15:34:27Z","title":"Codes on Graphs: Observability, Controllability and Local Reducibility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3115","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:b3409589cab753f2c46e6b2e9e6ef77f7100372a43b39264b914c35a341afeae","target":"record","created_at":"2026-05-18T03:46:47Z","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":"7bcc34b0f32f3b9d7aaddcbe89b35a9f865b7e0173e272b325e4452f572dce4f","cross_cats_sorted":["cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-14T15:34:27Z","title_canon_sha256":"6d9ef230a6a5b43fc2e25996e877663580e600869018681804cddabbaeae43e2"},"schema_version":"1.0","source":{"id":"1203.3115","kind":"arxiv","version":2}},"canonical_sha256":"a1faeba2b97e63c53be42346feba5f4ec4d5a75f23d715e53989da27a61f2dac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1faeba2b97e63c53be42346feba5f4ec4d5a75f23d715e53989da27a61f2dac","first_computed_at":"2026-05-18T03:46:47.307628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:47.307628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bQsd63hssJydRML4eIDlB2BSgaqKREMUPRsH902MHigyzaxbU/a+tUAkodJXZQX+8pZAbZQnMIprtWb6XmUsBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:47.308372Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3115","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3409589cab753f2c46e6b2e9e6ef77f7100372a43b39264b914c35a341afeae","sha256:a1630233588e95f927b56b0614bf549fea9e1de57ca3fe82c1155c7f398e0b76"],"state_sha256":"340cc299622d2342650d0b50b53156b19cc9810980c7d66026cd7895d7997185"}