{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PSRUREK5JOADZJWELETTYZ5YRR","short_pith_number":"pith:PSRUREK5","schema_version":"1.0","canonical_sha256":"7ca348915d4b803ca6c459273c67b88c50698394364e86941a7b795abad3e2e9","source":{"kind":"arxiv","id":"2501.12971","version":2},"attestation_state":"computed","paper":{"title":"Universal Decoding over Finite-State Additive Channels via Noise Guessing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henrique K. Miyamoto, Sheng Yang","submitted_at":"2025-01-22T15:57:21Z","abstract_excerpt":"We study universal decoding over unknown discrete additive channels determined by a finite-state (unifilar) random process. Aiming at low-complexity decoders, we study variants of noise-guessing decoders that use estimators for the probability of a noise sequence when the actual channel law is unknown. A deterministic version produces noise sequences in a fixed order, and a new randomised version draws them at random, until finding a sequence that, subtracted from the received sequence, results in a valid codeword. We show that both strategies are random-coding universal (i.e. have the same ra"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2501.12971","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-01-22T15:57:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c6a744835c5c20c38819fa98f36414ad24dc1ff21b038fa4b1f32524f39d9f4e","abstract_canon_sha256":"227890a10f64af4cf9389615e11e217cd5539a035828656a86508d9cf9b49d88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:41:38.349753Z","signature_b64":"0b4ZD8LgSHDfoR4WCz0n4gHs9bfG55kRWPcRqy6Da9LJ8l9xhtcz4Js6rVPiqkeIHn1uTrgleUDGR02NtfInCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ca348915d4b803ca6c459273c67b88c50698394364e86941a7b795abad3e2e9","last_reissued_at":"2026-07-05T11:41:38.349244Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:41:38.349244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Decoding over Finite-State Additive Channels via Noise Guessing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Henrique K. Miyamoto, Sheng Yang","submitted_at":"2025-01-22T15:57:21Z","abstract_excerpt":"We study universal decoding over unknown discrete additive channels determined by a finite-state (unifilar) random process. Aiming at low-complexity decoders, we study variants of noise-guessing decoders that use estimators for the probability of a noise sequence when the actual channel law is unknown. A deterministic version produces noise sequences in a fixed order, and a new randomised version draws them at random, until finding a sequence that, subtracted from the received sequence, results in a valid codeword. We show that both strategies are random-coding universal (i.e. have the same ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12971","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.12971/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2501.12971","created_at":"2026-07-05T11:41:38.349321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.12971v2","created_at":"2026-07-05T11:41:38.349321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12971","created_at":"2026-07-05T11:41:38.349321+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSRUREK5JOAD","created_at":"2026-07-05T11:41:38.349321+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSRUREK5JOADZJWE","created_at":"2026-07-05T11:41:38.349321+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSRUREK5","created_at":"2026-07-05T11:41:38.349321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PSRUREK5JOADZJWELETTYZ5YRR","json":"https://pith.science/pith/PSRUREK5JOADZJWELETTYZ5YRR.json","graph_json":"https://pith.science/api/pith-number/PSRUREK5JOADZJWELETTYZ5YRR/graph.json","events_json":"https://pith.science/api/pith-number/PSRUREK5JOADZJWELETTYZ5YRR/events.json","paper":"https://pith.science/paper/PSRUREK5"},"agent_actions":{"view_html":"https://pith.science/pith/PSRUREK5JOADZJWELETTYZ5YRR","download_json":"https://pith.science/pith/PSRUREK5JOADZJWELETTYZ5YRR.json","view_paper":"https://pith.science/paper/PSRUREK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.12971&json=true","fetch_graph":"https://pith.science/api/pith-number/PSRUREK5JOADZJWELETTYZ5YRR/graph.json","fetch_events":"https://pith.science/api/pith-number/PSRUREK5JOADZJWELETTYZ5YRR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSRUREK5JOADZJWELETTYZ5YRR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSRUREK5JOADZJWELETTYZ5YRR/action/storage_attestation","attest_author":"https://pith.science/pith/PSRUREK5JOADZJWELETTYZ5YRR/action/author_attestation","sign_citation":"https://pith.science/pith/PSRUREK5JOADZJWELETTYZ5YRR/action/citation_signature","submit_replication":"https://pith.science/pith/PSRUREK5JOADZJWELETTYZ5YRR/action/replication_record"}},"created_at":"2026-07-05T11:41:38.349321+00:00","updated_at":"2026-07-05T11:41:38.349321+00:00"}