{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BYRZCT2HJ4BGWTJTZEZVHVHI7S","short_pith_number":"pith:BYRZCT2H","canonical_record":{"source":{"id":"1509.00291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-01T13:43:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1b7302efa6ee356c1446fb340f4a51e3492c685ce459ad8dd76d2f8ae7fbde95","abstract_canon_sha256":"c6be16cc50562599090915a445b36d376ff97d2633b3a80d66c6962b3fefc920"},"schema_version":"1.0"},"canonical_sha256":"0e23914f474f026b4d33c93353d4e8fcba94ccfe6674aeebd8d16cdef429c976","source":{"kind":"arxiv","id":"1509.00291","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00291","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00291v2","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00291","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"BYRZCT2HJ4BG","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BYRZCT2HJ4BGWTJT","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BYRZCT2H","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BYRZCT2HJ4BGWTJTZEZVHVHI7S","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00291","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-01T13:43:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1b7302efa6ee356c1446fb340f4a51e3492c685ce459ad8dd76d2f8ae7fbde95","abstract_canon_sha256":"c6be16cc50562599090915a445b36d376ff97d2633b3a80d66c6962b3fefc920"},"schema_version":"1.0"},"canonical_sha256":"0e23914f474f026b4d33c93353d4e8fcba94ccfe6674aeebd8d16cdef429c976","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:35.091293Z","signature_b64":"9FmiLkuK6b63C3iIV7uiuCI6ifbSBMzz9E6cec1R+Z/GvWh3vvyAY3aAHIiInw2dj3auRgQycZoTGZHdliOcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e23914f474f026b4d33c93353d4e8fcba94ccfe6674aeebd8d16cdef429c976","last_reissued_at":"2026-05-18T00:58:35.090607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:35.090607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00291","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-18T00:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uOEMDobbku7oGLCP18s56gaIv4Ya2GHvoll60yr9uT3wadm8NFc7U23hSNTmnzkcwQ7FLdGyUexkz/gA8UG2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:57:28.017456Z"},"content_sha256":"9977bb3d5e63872c780de7885de5cd20720c343a705395399aee8c06346d0622","schema_version":"1.0","event_id":"sha256:9977bb3d5e63872c780de7885de5cd20720c343a705395399aee8c06346d0622"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BYRZCT2HJ4BGWTJTZEZVHVHI7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pearson codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jos H. Weber, Kees A. Schouhamer Immink, Simon R. Blackburn","submitted_at":"2015-09-01T13:43:25Z","abstract_excerpt":"The Pearson distance has been advocated for improving the error performance of noisy channels with unknown gain and offset. The Pearson distance can only fruitfully be used for sets of $q$-ary codewords, called Pearson codes, that satisfy specific properties. We will analyze constructions and properties of optimal Pearson codes. We will compare the redundancy of optimal Pearson codes with the redundancy of prior art $T$-constrained codes, which consist of $q$-ary sequences in which $T$ pre-determined reference symbols appear at least once. In particular, it will be shown that for $q\\le 3$ the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00291","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-18T00:58:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BOXeQPYo7Hrdo+6NU7DDma14ldZD49R0HSHcfDUQ4BqM3rpfxJCcwbxAnkG8m62GaXESKZN1vHHWb+sGiCxJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:57:28.017838Z"},"content_sha256":"1892f9ea25db5970f362d7117c3496de29a4bdf5247596885ca6ae6f605b4693","schema_version":"1.0","event_id":"sha256:1892f9ea25db5970f362d7117c3496de29a4bdf5247596885ca6ae6f605b4693"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYRZCT2HJ4BGWTJTZEZVHVHI7S/bundle.json","state_url":"https://pith.science/pith/BYRZCT2HJ4BGWTJTZEZVHVHI7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYRZCT2HJ4BGWTJTZEZVHVHI7S/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-20T06:57:28Z","links":{"resolver":"https://pith.science/pith/BYRZCT2HJ4BGWTJTZEZVHVHI7S","bundle":"https://pith.science/pith/BYRZCT2HJ4BGWTJTZEZVHVHI7S/bundle.json","state":"https://pith.science/pith/BYRZCT2HJ4BGWTJTZEZVHVHI7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYRZCT2HJ4BGWTJTZEZVHVHI7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BYRZCT2HJ4BGWTJTZEZVHVHI7S","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":"c6be16cc50562599090915a445b36d376ff97d2633b3a80d66c6962b3fefc920","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-01T13:43:25Z","title_canon_sha256":"1b7302efa6ee356c1446fb340f4a51e3492c685ce459ad8dd76d2f8ae7fbde95"},"schema_version":"1.0","source":{"id":"1509.00291","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00291","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00291v2","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00291","created_at":"2026-05-18T00:58:35Z"},{"alias_kind":"pith_short_12","alias_value":"BYRZCT2HJ4BG","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BYRZCT2HJ4BGWTJT","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BYRZCT2H","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:1892f9ea25db5970f362d7117c3496de29a4bdf5247596885ca6ae6f605b4693","target":"graph","created_at":"2026-05-18T00:58:35Z","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 Pearson distance has been advocated for improving the error performance of noisy channels with unknown gain and offset. The Pearson distance can only fruitfully be used for sets of $q$-ary codewords, called Pearson codes, that satisfy specific properties. We will analyze constructions and properties of optimal Pearson codes. We will compare the redundancy of optimal Pearson codes with the redundancy of prior art $T$-constrained codes, which consist of $q$-ary sequences in which $T$ pre-determined reference symbols appear at least once. In particular, it will be shown that for $q\\le 3$ the ","authors_text":"Jos H. Weber, Kees A. Schouhamer Immink, Simon R. Blackburn","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-01T13:43:25Z","title":"Pearson codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00291","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:9977bb3d5e63872c780de7885de5cd20720c343a705395399aee8c06346d0622","target":"record","created_at":"2026-05-18T00:58:35Z","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":"c6be16cc50562599090915a445b36d376ff97d2633b3a80d66c6962b3fefc920","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-01T13:43:25Z","title_canon_sha256":"1b7302efa6ee356c1446fb340f4a51e3492c685ce459ad8dd76d2f8ae7fbde95"},"schema_version":"1.0","source":{"id":"1509.00291","kind":"arxiv","version":2}},"canonical_sha256":"0e23914f474f026b4d33c93353d4e8fcba94ccfe6674aeebd8d16cdef429c976","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e23914f474f026b4d33c93353d4e8fcba94ccfe6674aeebd8d16cdef429c976","first_computed_at":"2026-05-18T00:58:35.090607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:35.090607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9FmiLkuK6b63C3iIV7uiuCI6ifbSBMzz9E6cec1R+Z/GvWh3vvyAY3aAHIiInw2dj3auRgQycZoTGZHdliOcAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:35.091293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00291","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9977bb3d5e63872c780de7885de5cd20720c343a705395399aee8c06346d0622","sha256:1892f9ea25db5970f362d7117c3496de29a4bdf5247596885ca6ae6f605b4693"],"state_sha256":"d2e2c96aa480891679df3977c7972c12d3b69249f5d34e7ff3bce428179a1190"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uo5Y6vTGDW3p2MWOt2PsUr7Ef6vLEqlMXXqwsvsWykXSc4eqYPwQDZUzAjAy+4V2shWaBE1OHCV22WWYLDJoBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:57:28.019939Z","bundle_sha256":"15e7e4041647d0e59dde5b43e918f900a6fb6f6e80154da196459a41dc359b0e"}}