{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TGBRIH3EWTJZKESDIGD6XNQO4D","short_pith_number":"pith:TGBRIH3E","canonical_record":{"source":{"id":"1102.2734","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T11:25:39Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"d33632fdd300bad017022cef8a103cf24bbad63be47f54e1be1cb5f9ce0145e5","abstract_canon_sha256":"a4bf68585c38530df729a1b5ebb9ff564ddc66ecd6fa94dbffd0cf3de5875eac"},"schema_version":"1.0"},"canonical_sha256":"9983141f64b4d39512434187ebb60ee0c424b104c731c1b3219530da84e6831b","source":{"kind":"arxiv","id":"1102.2734","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2734","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2734v3","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2734","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"TGBRIH3EWTJZ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TGBRIH3EWTJZKESD","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TGBRIH3E","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TGBRIH3EWTJZKESDIGD6XNQO4D","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2734","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T11:25:39Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"d33632fdd300bad017022cef8a103cf24bbad63be47f54e1be1cb5f9ce0145e5","abstract_canon_sha256":"a4bf68585c38530df729a1b5ebb9ff564ddc66ecd6fa94dbffd0cf3de5875eac"},"schema_version":"1.0"},"canonical_sha256":"9983141f64b4d39512434187ebb60ee0c424b104c731c1b3219530da84e6831b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:48.626121Z","signature_b64":"Kdf4LlyQlJpYoYX+P2dtmLf3WIQfAyXZWOp+ZjEbLl05bfUFE69OHx561FeFv4WfiFocRrFU9Hh6bKH2PeKaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9983141f64b4d39512434187ebb60ee0c424b104c731c1b3219530da84e6831b","last_reissued_at":"2026-05-18T04:25:48.625661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:48.625661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2734","source_version":3,"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-18T04:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u1a60EqYktOFBuvgmy7DvcgM+mDu6ar6Ds3cfipRUYmtmW51Ll8/nBixpFNsI8xLTd+I9cC5J5fHsiVbY4iACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:35:09.062089Z"},"content_sha256":"6f25569c8cc2981fca7dd8fd1a317cc480d0cd1d9f0b07b152eb07a07c3f9742","schema_version":"1.0","event_id":"sha256:6f25569c8cc2981fca7dd8fd1a317cc480d0cd1d9f0b07b152eb07a07c3f9742"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TGBRIH3EWTJZKESDIGD6XNQO4D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Treewidth of MDS and Reed-Muller Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew Thangaraj, Navin Kashyap","submitted_at":"2011-02-14T11:25:39Z","abstract_excerpt":"The constraint complexity of a graphical realization of a linear code is the maximum dimension of the local constraint codes in the realization. The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parametrization of the maximum-likelihood decoding complexity for linear codes. In this paper, we prove the surprising fact that for maximum distance separable codes and Reed-Muller codes, treewidth equals trelliswidth, which, for a code, is defined to be the least constraint complexity (or branch complexity)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2734","kind":"arxiv","version":3},"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-18T04:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p4Ocmj612ELN5o0cNlgCR0IJ5pmR0gMLL3s1X88jjtVsYHSoCzkIeLQfZalNWcFM9YPMRFQIXiikBPx9ndPyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:35:09.062443Z"},"content_sha256":"febdb1df6acc9c224da62c14163df094bf55458b825f8fbc55395eaa7203697d","schema_version":"1.0","event_id":"sha256:febdb1df6acc9c224da62c14163df094bf55458b825f8fbc55395eaa7203697d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TGBRIH3EWTJZKESDIGD6XNQO4D/bundle.json","state_url":"https://pith.science/pith/TGBRIH3EWTJZKESDIGD6XNQO4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TGBRIH3EWTJZKESDIGD6XNQO4D/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-08T14:35:09Z","links":{"resolver":"https://pith.science/pith/TGBRIH3EWTJZKESDIGD6XNQO4D","bundle":"https://pith.science/pith/TGBRIH3EWTJZKESDIGD6XNQO4D/bundle.json","state":"https://pith.science/pith/TGBRIH3EWTJZKESDIGD6XNQO4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TGBRIH3EWTJZKESDIGD6XNQO4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TGBRIH3EWTJZKESDIGD6XNQO4D","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":"a4bf68585c38530df729a1b5ebb9ff564ddc66ecd6fa94dbffd0cf3de5875eac","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T11:25:39Z","title_canon_sha256":"d33632fdd300bad017022cef8a103cf24bbad63be47f54e1be1cb5f9ce0145e5"},"schema_version":"1.0","source":{"id":"1102.2734","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2734","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2734v3","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2734","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"TGBRIH3EWTJZ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TGBRIH3EWTJZKESD","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TGBRIH3E","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:febdb1df6acc9c224da62c14163df094bf55458b825f8fbc55395eaa7203697d","target":"graph","created_at":"2026-05-18T04:25:48Z","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":"The constraint complexity of a graphical realization of a linear code is the maximum dimension of the local constraint codes in the realization. The treewidth of a linear code is the least constraint complexity of any of its cycle-free graphical realizations. This notion provides a useful parametrization of the maximum-likelihood decoding complexity for linear codes. In this paper, we prove the surprising fact that for maximum distance separable codes and Reed-Muller codes, treewidth equals trelliswidth, which, for a code, is defined to be the least constraint complexity (or branch complexity)","authors_text":"Andrew Thangaraj, Navin Kashyap","cross_cats":["cs.DM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T11:25:39Z","title":"The Treewidth of MDS and Reed-Muller Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2734","kind":"arxiv","version":3},"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:6f25569c8cc2981fca7dd8fd1a317cc480d0cd1d9f0b07b152eb07a07c3f9742","target":"record","created_at":"2026-05-18T04:25:48Z","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":"a4bf68585c38530df729a1b5ebb9ff564ddc66ecd6fa94dbffd0cf3de5875eac","cross_cats_sorted":["cs.DM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-14T11:25:39Z","title_canon_sha256":"d33632fdd300bad017022cef8a103cf24bbad63be47f54e1be1cb5f9ce0145e5"},"schema_version":"1.0","source":{"id":"1102.2734","kind":"arxiv","version":3}},"canonical_sha256":"9983141f64b4d39512434187ebb60ee0c424b104c731c1b3219530da84e6831b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9983141f64b4d39512434187ebb60ee0c424b104c731c1b3219530da84e6831b","first_computed_at":"2026-05-18T04:25:48.625661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:48.625661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kdf4LlyQlJpYoYX+P2dtmLf3WIQfAyXZWOp+ZjEbLl05bfUFE69OHx561FeFv4WfiFocRrFU9Hh6bKH2PeKaBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:48.626121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2734","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f25569c8cc2981fca7dd8fd1a317cc480d0cd1d9f0b07b152eb07a07c3f9742","sha256:febdb1df6acc9c224da62c14163df094bf55458b825f8fbc55395eaa7203697d"],"state_sha256":"3037a3fddf4a87d6e44368619048595c9ef0c87624cbbc00ae0f99d2627be845"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e9WUiQSbM5OOeyE8zJTLg6DWqdnpyhRpZLmaIsf16VNfoGR33W1bG+KQtUY4PJNv9t4rKMcw6v8eJqGR7WpZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:35:09.064264Z","bundle_sha256":"ed4ab7535db80ced2c2565be5eff9a46686f4a623709b3a2121e8a97b13bada6"}}