{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UH5OXIVZPZR4KO7EENDP5OS7J3","short_pith_number":"pith:UH5OXIVZ","canonical_record":{"source":{"id":"1203.3115","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-14T15:34:27Z","cross_cats_sorted":["cs.SY","math.IT"],"title_canon_sha256":"6d9ef230a6a5b43fc2e25996e877663580e600869018681804cddabbaeae43e2","abstract_canon_sha256":"7bcc34b0f32f3b9d7aaddcbe89b35a9f865b7e0173e272b325e4452f572dce4f"},"schema_version":"1.0"},"canonical_sha256":"a1faeba2b97e63c53be42346feba5f4ec4d5a75f23d715e53989da27a61f2dac","source":{"kind":"arxiv","id":"1203.3115","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UH5OXIVZPZR4KO7EENDP5OS7J3","target":"record","payload":{"canonical_record":{"source":{"id":"1203.3115","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-14T15:34:27Z","cross_cats_sorted":["cs.SY","math.IT"],"title_canon_sha256":"6d9ef230a6a5b43fc2e25996e877663580e600869018681804cddabbaeae43e2","abstract_canon_sha256":"7bcc34b0f32f3b9d7aaddcbe89b35a9f865b7e0173e272b325e4452f572dce4f"},"schema_version":"1.0"},"canonical_sha256":"a1faeba2b97e63c53be42346feba5f4ec4d5a75f23d715e53989da27a61f2dac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:47.308372Z","signature_b64":"bQsd63hssJydRML4eIDlB2BSgaqKREMUPRsH902MHigyzaxbU/a+tUAkodJXZQX+8pZAbZQnMIprtWb6XmUsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1faeba2b97e63c53be42346feba5f4ec4d5a75f23d715e53989da27a61f2dac","last_reissued_at":"2026-05-18T03:46:47.307628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:47.307628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.3115","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-18T03:46:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VY04wxoZjz5GKFM4t/KGGOq7SeGrScCDQ4fjHhx/uVtKrcDgFpUK9VZzs/h25aklr7pgGY+Obwrf/DNvoP1HCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:26:21.992826Z"},"content_sha256":"b3409589cab753f2c46e6b2e9e6ef77f7100372a43b39264b914c35a341afeae","schema_version":"1.0","event_id":"sha256:b3409589cab753f2c46e6b2e9e6ef77f7100372a43b39264b914c35a341afeae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UH5OXIVZPZR4KO7EENDP5OS7J3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Codes on Graphs: Observability, Controllability and Local Reducibility","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 Jr, Heide Gluesing-Luerssen","submitted_at":"2012-03-14T15:34:27Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3115","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-18T03:46:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WAmPpxXZIlSBE/A4WTD3B0oRjCoIGJEBJJh7LFKr1GSFINc83OVHrWDCWhPrlPDyo7cA6JgYgonNo6lKk66JDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:26:21.993174Z"},"content_sha256":"a1630233588e95f927b56b0614bf549fea9e1de57ca3fe82c1155c7f398e0b76","schema_version":"1.0","event_id":"sha256:a1630233588e95f927b56b0614bf549fea9e1de57ca3fe82c1155c7f398e0b76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UH5OXIVZPZR4KO7EENDP5OS7J3/bundle.json","state_url":"https://pith.science/pith/UH5OXIVZPZR4KO7EENDP5OS7J3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UH5OXIVZPZR4KO7EENDP5OS7J3/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-02T20:26:21Z","links":{"resolver":"https://pith.science/pith/UH5OXIVZPZR4KO7EENDP5OS7J3","bundle":"https://pith.science/pith/UH5OXIVZPZR4KO7EENDP5OS7J3/bundle.json","state":"https://pith.science/pith/UH5OXIVZPZR4KO7EENDP5OS7J3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UH5OXIVZPZR4KO7EENDP5OS7J3/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71GAsRJRiUworYTxRafLUBQ7aNOmugE75DD649FY4kOBwUCBiRbUt+ONfxnu1H8KXb8iJ//+yQr+ed55tgIkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:26:21.995269Z","bundle_sha256":"bfa7db9a585d4cf5e8672e885689fccda56c37aac667d6b21104ee0189cb78ff"}}