{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SBSEI6WNO7WGUPTFQLH7BA6IBA","short_pith_number":"pith:SBSEI6WN","canonical_record":{"source":{"id":"1310.6427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-23T23:10:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"475a7a28c15dac59cc5ff765be5dbe624256f2e34e52725f9519a6682ff989d6","abstract_canon_sha256":"353fbaa90c80c9d1b6036a8471e5c64cb99778014c6ef9e36e7c64eef823b795"},"schema_version":"1.0"},"canonical_sha256":"9064447acd77ec6a3e6582cff083c8083c1ea3ccf9b02172e42c118c7589fea6","source":{"kind":"arxiv","id":"1310.6427","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6427","created_at":"2026-05-18T03:05:01Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6427v1","created_at":"2026-05-18T03:05:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6427","created_at":"2026-05-18T03:05:01Z"},{"alias_kind":"pith_short_12","alias_value":"SBSEI6WNO7WG","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SBSEI6WNO7WGUPTF","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SBSEI6WN","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SBSEI6WNO7WGUPTFQLH7BA6IBA","target":"record","payload":{"canonical_record":{"source":{"id":"1310.6427","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-23T23:10:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"475a7a28c15dac59cc5ff765be5dbe624256f2e34e52725f9519a6682ff989d6","abstract_canon_sha256":"353fbaa90c80c9d1b6036a8471e5c64cb99778014c6ef9e36e7c64eef823b795"},"schema_version":"1.0"},"canonical_sha256":"9064447acd77ec6a3e6582cff083c8083c1ea3ccf9b02172e42c118c7589fea6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:01.066064Z","signature_b64":"mFZaeG9XHv+9+MW1znIDEDnPs7f1LDVqbMj9l9j0366eGg28WouKtQ5Z68Qk5FVDSmEkt5HtSYjrXK6vesayCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9064447acd77ec6a3e6582cff083c8083c1ea3ccf9b02172e42c118c7589fea6","last_reissued_at":"2026-05-18T03:05:01.065374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:01.065374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.6427","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-18T03:05:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8E1LdRyPHtgoH91FkzZ90EsBEd9xhr63TU2PSSqx5mqoYACYCugqmRB6d3qRp9CGXaJVJwdXZaSLXi2hMOwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:38:48.058668Z"},"content_sha256":"bef080cfe876ec028212238700de6dfbdf022aafdf906058990e98f10f00dfc2","schema_version":"1.0","event_id":"sha256:bef080cfe876ec028212238700de6dfbdf022aafdf906058990e98f10f00dfc2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SBSEI6WNO7WGUPTFQLH7BA6IBA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Estimating Channel Parameters from the Syndrome of a Linear Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christoph Pacher, Gottfried Lechner","submitted_at":"2013-10-23T23:10:59Z","abstract_excerpt":"In this letter, we analyse the properties of a maximum likelihood channel estimator based on the syndrome of a linear code. For the two examples of a binary symmetric channel and a binary input additive white Gaussian noise channel, we derive expressions for the bias and the mean squared error and compare them to the Cram\\'er-Rao bound. The analytical expressions show the relationship between the estimator properties and the parameters of the linear code, i.e., the number of check nodes and the check node degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6427","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-18T03:05:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TDUcvofdZfGT1QAMMuRiFKmbfRN2ffOwFmi9j1Uums1sIcpB83D2Ptx7cMkKEjS2kg6sqePuhWeYehfFYgutAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:38:48.059020Z"},"content_sha256":"f9e65e72db91265bf886abd3349f249e30cb45601f12bc38d3986c510b128a5d","schema_version":"1.0","event_id":"sha256:f9e65e72db91265bf886abd3349f249e30cb45601f12bc38d3986c510b128a5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBSEI6WNO7WGUPTFQLH7BA6IBA/bundle.json","state_url":"https://pith.science/pith/SBSEI6WNO7WGUPTFQLH7BA6IBA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBSEI6WNO7WGUPTFQLH7BA6IBA/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-03T02:38:48Z","links":{"resolver":"https://pith.science/pith/SBSEI6WNO7WGUPTFQLH7BA6IBA","bundle":"https://pith.science/pith/SBSEI6WNO7WGUPTFQLH7BA6IBA/bundle.json","state":"https://pith.science/pith/SBSEI6WNO7WGUPTFQLH7BA6IBA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBSEI6WNO7WGUPTFQLH7BA6IBA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SBSEI6WNO7WGUPTFQLH7BA6IBA","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":"353fbaa90c80c9d1b6036a8471e5c64cb99778014c6ef9e36e7c64eef823b795","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-23T23:10:59Z","title_canon_sha256":"475a7a28c15dac59cc5ff765be5dbe624256f2e34e52725f9519a6682ff989d6"},"schema_version":"1.0","source":{"id":"1310.6427","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6427","created_at":"2026-05-18T03:05:01Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6427v1","created_at":"2026-05-18T03:05:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6427","created_at":"2026-05-18T03:05:01Z"},{"alias_kind":"pith_short_12","alias_value":"SBSEI6WNO7WG","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SBSEI6WNO7WGUPTF","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SBSEI6WN","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:f9e65e72db91265bf886abd3349f249e30cb45601f12bc38d3986c510b128a5d","target":"graph","created_at":"2026-05-18T03:05:01Z","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":"In this letter, we analyse the properties of a maximum likelihood channel estimator based on the syndrome of a linear code. For the two examples of a binary symmetric channel and a binary input additive white Gaussian noise channel, we derive expressions for the bias and the mean squared error and compare them to the Cram\\'er-Rao bound. The analytical expressions show the relationship between the estimator properties and the parameters of the linear code, i.e., the number of check nodes and the check node degree.","authors_text":"Christoph Pacher, Gottfried Lechner","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-23T23:10:59Z","title":"Estimating Channel Parameters from the Syndrome of a Linear Code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6427","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:bef080cfe876ec028212238700de6dfbdf022aafdf906058990e98f10f00dfc2","target":"record","created_at":"2026-05-18T03:05:01Z","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":"353fbaa90c80c9d1b6036a8471e5c64cb99778014c6ef9e36e7c64eef823b795","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-23T23:10:59Z","title_canon_sha256":"475a7a28c15dac59cc5ff765be5dbe624256f2e34e52725f9519a6682ff989d6"},"schema_version":"1.0","source":{"id":"1310.6427","kind":"arxiv","version":1}},"canonical_sha256":"9064447acd77ec6a3e6582cff083c8083c1ea3ccf9b02172e42c118c7589fea6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9064447acd77ec6a3e6582cff083c8083c1ea3ccf9b02172e42c118c7589fea6","first_computed_at":"2026-05-18T03:05:01.065374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:01.065374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mFZaeG9XHv+9+MW1znIDEDnPs7f1LDVqbMj9l9j0366eGg28WouKtQ5Z68Qk5FVDSmEkt5HtSYjrXK6vesayCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:01.066064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6427","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bef080cfe876ec028212238700de6dfbdf022aafdf906058990e98f10f00dfc2","sha256:f9e65e72db91265bf886abd3349f249e30cb45601f12bc38d3986c510b128a5d"],"state_sha256":"8942b9c5444050faf3bc635b5f1fd3ffad71fc1b51cb67fe5cb5d5042cd9a5da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bT8gH2VtAeA8hz1FkDDPw4DpplM0sXUQ+3L61jtcnYuRqDYz+QaTJwoUk5VDPf7NNpAIbFm0G9LspYg5JGreCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:38:48.061018Z","bundle_sha256":"cc0d6d08cd46f4d311cd0988a42c409bed3eb4d93accfdb039df3bc28b40eeff"}}