{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:B7IZKKLTHXNDJF5YLEI6KYJ4NZ","short_pith_number":"pith:B7IZKKLT","schema_version":"1.0","canonical_sha256":"0fd19529733dda3497b85911e5613c6e6870f186450d4e6759de0350b2d19e3e","source":{"kind":"arxiv","id":"1202.0534","version":1},"attestation_state":"computed","paper":{"title":"Observability, Controllability and Local Reducibility of Linear Codes on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"G. David Forney, Heide Gluesing-Luerssen, Jr.","submitted_at":"2012-02-02T20:13:19Z","abstract_excerpt":"This paper is concerned with the local reducibility properties of linear realizations of codes on finite graphs.\n  Trimness and properness are dual properties of constraint codes. A linear realization is locally reducible if any constraint code is not both trim and proper. On a finite cycle-free graph, a linear realization is minimal if and only if every constraint code is both trim and proper.\n  A linear realization is called observable if it is one-to-one, and controllable if all constraints are independent. Observability and controllability are dual properties. An unobservable or uncontroll"},"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":"1202.0534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-02T20:13:19Z","cross_cats_sorted":["cs.SY","math.IT"],"title_canon_sha256":"aaae24b8ceba1bd219d1e2adee7771d28842f6e98001a15be3fd2107bc41ed3c","abstract_canon_sha256":"c963d5480fce8166fcf1e03131ce5b8c232517c4a33eefbc87fae608211fe6eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.074262Z","signature_b64":"yRSBCU07icxc0c8qUydBvQGVAki2WWwhf8HVSCfHHUYnlxWRCfZpKVs17j5vmmRc3iccmVmG30l0KGceVVS4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fd19529733dda3497b85911e5613c6e6870f186450d4e6759de0350b2d19e3e","last_reissued_at":"2026-05-18T00:57:57.073689Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.073689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Observability, Controllability and Local Reducibility of Linear Codes on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"G. David Forney, Heide Gluesing-Luerssen, Jr.","submitted_at":"2012-02-02T20:13:19Z","abstract_excerpt":"This paper is concerned with the local reducibility properties of linear realizations of codes on finite graphs.\n  Trimness and properness are dual properties of constraint codes. A linear realization is locally reducible if any constraint code is not both trim and proper. On a finite cycle-free graph, a linear realization is minimal if and only if every constraint code is both trim and proper.\n  A linear realization is called observable if it is one-to-one, and controllable if all constraints are independent. Observability and controllability are dual properties. An unobservable or uncontroll"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0534","kind":"arxiv","version":1},"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":"1202.0534","created_at":"2026-05-18T00:57:57.073790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0534v1","created_at":"2026-05-18T00:57:57.073790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0534","created_at":"2026-05-18T00:57:57.073790+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7IZKKLTHXND","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7IZKKLTHXNDJF5Y","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7IZKKLT","created_at":"2026-05-18T12:26:58.693483+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/B7IZKKLTHXNDJF5YLEI6KYJ4NZ","json":"https://pith.science/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ.json","graph_json":"https://pith.science/api/pith-number/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/graph.json","events_json":"https://pith.science/api/pith-number/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/events.json","paper":"https://pith.science/paper/B7IZKKLT"},"agent_actions":{"view_html":"https://pith.science/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ","download_json":"https://pith.science/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ.json","view_paper":"https://pith.science/paper/B7IZKKLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0534&json=true","fetch_graph":"https://pith.science/api/pith-number/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/graph.json","fetch_events":"https://pith.science/api/pith-number/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/action/storage_attestation","attest_author":"https://pith.science/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/action/author_attestation","sign_citation":"https://pith.science/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/action/citation_signature","submit_replication":"https://pith.science/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/action/replication_record"}},"created_at":"2026-05-18T00:57:57.073790+00:00","updated_at":"2026-05-18T00:57:57.073790+00:00"}