{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VLALCOE2YUIT2I7S34XXNM6IMI","short_pith_number":"pith:VLALCOE2","canonical_record":{"source":{"id":"2509.08079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-09-09T18:34:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7bdefa68db763b0e459f33fe981a662aad05db986fdf9784efde6c9e0c45a0a7","abstract_canon_sha256":"17ad879d159625fac9da5d5ac9c4661baf9c675fcae8a0997c825750a1803685"},"schema_version":"1.0"},"canonical_sha256":"aac0b1389ac5113d23f2df2f76b3c8623f993d99ef60ec78ff755254d333b1e1","source":{"kind":"arxiv","id":"2509.08079","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08079","created_at":"2026-07-05T12:08:21Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08079v1","created_at":"2026-07-05T12:08:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08079","created_at":"2026-07-05T12:08:21Z"},{"alias_kind":"pith_short_12","alias_value":"VLALCOE2YUIT","created_at":"2026-07-05T12:08:21Z"},{"alias_kind":"pith_short_16","alias_value":"VLALCOE2YUIT2I7S","created_at":"2026-07-05T12:08:21Z"},{"alias_kind":"pith_short_8","alias_value":"VLALCOE2","created_at":"2026-07-05T12:08:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VLALCOE2YUIT2I7S34XXNM6IMI","target":"record","payload":{"canonical_record":{"source":{"id":"2509.08079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-09-09T18:34:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7bdefa68db763b0e459f33fe981a662aad05db986fdf9784efde6c9e0c45a0a7","abstract_canon_sha256":"17ad879d159625fac9da5d5ac9c4661baf9c675fcae8a0997c825750a1803685"},"schema_version":"1.0"},"canonical_sha256":"aac0b1389ac5113d23f2df2f76b3c8623f993d99ef60ec78ff755254d333b1e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:08:21.898810Z","signature_b64":"04xaff7122beY8KATNIR1uBiCGB/XZPL7JGak09ikI1Q0DRJoUebOgENPbWIffIfVnqKvtibqL7AykWOIcEIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aac0b1389ac5113d23f2df2f76b3c8623f993d99ef60ec78ff755254d333b1e1","last_reissued_at":"2026-07-05T12:08:21.898359Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:08:21.898359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.08079","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-07-05T12:08:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EuLGeaGDdwyLjCPUX7ZtUMh7SaHOdf5JIUXXsvBTmGqQ09qxV1XSARRwpl+fAxcMtE8v6eVDQuMf5a3nSr7zBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T19:00:58.653977Z"},"content_sha256":"27b37d386b7010fad2cd51874fdfe2517422159977761bac203a8ca910cd4dd5","schema_version":"1.0","event_id":"sha256:27b37d386b7010fad2cd51874fdfe2517422159977761bac203a8ca910cd4dd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VLALCOE2YUIT2I7S34XXNM6IMI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Linear Reliability Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Mariona, Ken R. Duffy, Muriel M\\'edard","submitted_at":"2025-09-09T18:34:44Z","abstract_excerpt":"We introduce and analyze a discrete soft-decision channel called the linear reliability channel (LRC) in which the soft information is the rank ordering of the received symbol reliabilities. We prove that the LRC is an appropriate approximation to a general class of discrete modulation, continuous noise channels when the noise variance is high. The central feature of the LRC is that its combinatorial nature allows for an extensive mathematical analysis of the channel and its corresponding hard- and soft-decision maximum likelihood (ML) decoders. In particular, we establish explicit error expon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08079","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.08079/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T12:08:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WaAJSOFsFIcP9/QK4ovU+srOeNj27NBRUyefQZmC6s5WQ9sNLuEmmpKvt6ERvsyQ4XkRkk4avo1pk2u3HZChCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T19:00:58.654945Z"},"content_sha256":"cac5dd798c1b9b055f2bd8155e56bad068d59b47cd311a040eac198abd0fb442","schema_version":"1.0","event_id":"sha256:cac5dd798c1b9b055f2bd8155e56bad068d59b47cd311a040eac198abd0fb442"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLALCOE2YUIT2I7S34XXNM6IMI/bundle.json","state_url":"https://pith.science/pith/VLALCOE2YUIT2I7S34XXNM6IMI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLALCOE2YUIT2I7S34XXNM6IMI/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-08-06T19:00:58Z","links":{"resolver":"https://pith.science/pith/VLALCOE2YUIT2I7S34XXNM6IMI","bundle":"https://pith.science/pith/VLALCOE2YUIT2I7S34XXNM6IMI/bundle.json","state":"https://pith.science/pith/VLALCOE2YUIT2I7S34XXNM6IMI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLALCOE2YUIT2I7S34XXNM6IMI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VLALCOE2YUIT2I7S34XXNM6IMI","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":"17ad879d159625fac9da5d5ac9c4661baf9c675fcae8a0997c825750a1803685","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-09-09T18:34:44Z","title_canon_sha256":"7bdefa68db763b0e459f33fe981a662aad05db986fdf9784efde6c9e0c45a0a7"},"schema_version":"1.0","source":{"id":"2509.08079","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08079","created_at":"2026-07-05T12:08:21Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08079v1","created_at":"2026-07-05T12:08:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08079","created_at":"2026-07-05T12:08:21Z"},{"alias_kind":"pith_short_12","alias_value":"VLALCOE2YUIT","created_at":"2026-07-05T12:08:21Z"},{"alias_kind":"pith_short_16","alias_value":"VLALCOE2YUIT2I7S","created_at":"2026-07-05T12:08:21Z"},{"alias_kind":"pith_short_8","alias_value":"VLALCOE2","created_at":"2026-07-05T12:08:21Z"}],"graph_snapshots":[{"event_id":"sha256:cac5dd798c1b9b055f2bd8155e56bad068d59b47cd311a040eac198abd0fb442","target":"graph","created_at":"2026-07-05T12:08:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.08079/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce and analyze a discrete soft-decision channel called the linear reliability channel (LRC) in which the soft information is the rank ordering of the received symbol reliabilities. We prove that the LRC is an appropriate approximation to a general class of discrete modulation, continuous noise channels when the noise variance is high. The central feature of the LRC is that its combinatorial nature allows for an extensive mathematical analysis of the channel and its corresponding hard- and soft-decision maximum likelihood (ML) decoders. In particular, we establish explicit error expon","authors_text":"Alexander Mariona, Ken R. Duffy, Muriel M\\'edard","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-09-09T18:34:44Z","title":"The Linear Reliability Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08079","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:27b37d386b7010fad2cd51874fdfe2517422159977761bac203a8ca910cd4dd5","target":"record","created_at":"2026-07-05T12:08:21Z","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":"17ad879d159625fac9da5d5ac9c4661baf9c675fcae8a0997c825750a1803685","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-09-09T18:34:44Z","title_canon_sha256":"7bdefa68db763b0e459f33fe981a662aad05db986fdf9784efde6c9e0c45a0a7"},"schema_version":"1.0","source":{"id":"2509.08079","kind":"arxiv","version":1}},"canonical_sha256":"aac0b1389ac5113d23f2df2f76b3c8623f993d99ef60ec78ff755254d333b1e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aac0b1389ac5113d23f2df2f76b3c8623f993d99ef60ec78ff755254d333b1e1","first_computed_at":"2026-07-05T12:08:21.898359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:08:21.898359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"04xaff7122beY8KATNIR1uBiCGB/XZPL7JGak09ikI1Q0DRJoUebOgENPbWIffIfVnqKvtibqL7AykWOIcEIBw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:08:21.898810Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.08079","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27b37d386b7010fad2cd51874fdfe2517422159977761bac203a8ca910cd4dd5","sha256:cac5dd798c1b9b055f2bd8155e56bad068d59b47cd311a040eac198abd0fb442"],"state_sha256":"1791c2714f9028f280578fd2f8905db9fae8ad2fdd953fa00a941d5f5658ed2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZV/jrXE+EpaujbZ0R3eeR8Eb1e9DL10Rd2XKEWcATQctjOibCpKOvzRrtdhZ0KJffNYYKbmIpD9uMk5Ls7APBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T19:00:58.660718Z","bundle_sha256":"d4fe743e3852ffa310c6ec06580d079597cf3d89200668662875825aabdb4a85"}}