{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:B7IZKKLTHXNDJF5YLEI6KYJ4NZ","short_pith_number":"pith:B7IZKKLT","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"},"canonical_sha256":"0fd19529733dda3497b85911e5613c6e6870f186450d4e6759de0350b2d19e3e","source":{"kind":"arxiv","id":"1202.0534","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0534","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0534v1","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0534","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"B7IZKKLTHXND","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B7IZKKLTHXNDJF5Y","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B7IZKKLT","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:B7IZKKLTHXNDJF5YLEI6KYJ4NZ","target":"record","payload":{"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"},"canonical_sha256":"0fd19529733dda3497b85911e5613c6e6870f186450d4e6759de0350b2d19e3e","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"},"source_kind":"arxiv","source_id":"1202.0534","source_version":1,"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-18T00:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TMRrDONx/adZRhGvJb/88y1bHzfIePa/rFXOk8P0c77/vqqydaK7lr+YixcyicxkEnkmLYceoP7tneQMIaCyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:11:53.795844Z"},"content_sha256":"a343c04d5e6c6d42982d1963dc5209d143979011d2f63d034499014da512f362","schema_version":"1.0","event_id":"sha256:a343c04d5e6c6d42982d1963dc5209d143979011d2f63d034499014da512f362"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:B7IZKKLTHXNDJF5YLEI6KYJ4NZ","target":"graph","payload":{"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"},"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-18T00:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8PXY3qSmgv7y43mctEe2OzG+b8rXrNL/h2Is14xZR3V/BaMAcEeFANwpHsv/mm1dOChPbG6yDG0p3mavqiyACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:11:53.796189Z"},"content_sha256":"72816cb0c06e74828dc7053e9c99e6022e1e87a6cf081594225c5a85cbe32922","schema_version":"1.0","event_id":"sha256:72816cb0c06e74828dc7053e9c99e6022e1e87a6cf081594225c5a85cbe32922"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/bundle.json","state_url":"https://pith.science/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/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-05-30T12:11:53Z","links":{"resolver":"https://pith.science/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ","bundle":"https://pith.science/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/bundle.json","state":"https://pith.science/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B7IZKKLTHXNDJF5YLEI6KYJ4NZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:B7IZKKLTHXNDJF5YLEI6KYJ4NZ","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":"c963d5480fce8166fcf1e03131ce5b8c232517c4a33eefbc87fae608211fe6eb","cross_cats_sorted":["cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-02T20:13:19Z","title_canon_sha256":"aaae24b8ceba1bd219d1e2adee7771d28842f6e98001a15be3fd2107bc41ed3c"},"schema_version":"1.0","source":{"id":"1202.0534","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0534","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0534v1","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0534","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"B7IZKKLTHXND","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"B7IZKKLTHXNDJF5Y","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"B7IZKKLT","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:72816cb0c06e74828dc7053e9c99e6022e1e87a6cf081594225c5a85cbe32922","target":"graph","created_at":"2026-05-18T00:57:57Z","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 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","authors_text":"G. David Forney, Heide Gluesing-Luerssen, Jr.","cross_cats":["cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-02T20:13:19Z","title":"Observability, Controllability and Local Reducibility of Linear Codes on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0534","kind":"arxiv","version":1},"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:a343c04d5e6c6d42982d1963dc5209d143979011d2f63d034499014da512f362","target":"record","created_at":"2026-05-18T00:57:57Z","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":"c963d5480fce8166fcf1e03131ce5b8c232517c4a33eefbc87fae608211fe6eb","cross_cats_sorted":["cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-02T20:13:19Z","title_canon_sha256":"aaae24b8ceba1bd219d1e2adee7771d28842f6e98001a15be3fd2107bc41ed3c"},"schema_version":"1.0","source":{"id":"1202.0534","kind":"arxiv","version":1}},"canonical_sha256":"0fd19529733dda3497b85911e5613c6e6870f186450d4e6759de0350b2d19e3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fd19529733dda3497b85911e5613c6e6870f186450d4e6759de0350b2d19e3e","first_computed_at":"2026-05-18T00:57:57.073689Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:57.073689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yRSBCU07icxc0c8qUydBvQGVAki2WWwhf8HVSCfHHUYnlxWRCfZpKVs17j5vmmRc3iccmVmG30l0KGceVVS4Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:57.074262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0534","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a343c04d5e6c6d42982d1963dc5209d143979011d2f63d034499014da512f362","sha256:72816cb0c06e74828dc7053e9c99e6022e1e87a6cf081594225c5a85cbe32922"],"state_sha256":"a5d2b706a21254690790693076d54ca467486d563c7395713be37b6c86b0592a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ypeXJfZlluDITsfxLfubM8BoaOtLDlla33nx7WJBaW9A1IuKSQg/RVt701T0+IoyLBNm9l94oPmbDLlrJ5ofCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:11:53.798049Z","bundle_sha256":"6793f1f3e055613256caa88d00d29d669fd1cfb6c307727eb1b9ab9e7fda050b"}}