{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GS3H55TKHU6XGQC5HF7UDWNRGN","short_pith_number":"pith:GS3H55TK","schema_version":"1.0","canonical_sha256":"34b67ef66a3d3d73405d397f41d9b13370919e4eb6f09fffec416fc2cd97f50e","source":{"kind":"arxiv","id":"2502.05959","version":2},"attestation_state":"computed","paper":{"title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamdi Joudeh, Vincent Y. F. Tan","submitted_at":"2025-02-09T17:03:02Z","abstract_excerpt":"This paper considers guessing-based decoders with abandonment for discrete memoryless channels in which all codewords have the same composition. This class of decoders rank-orders all input sequences in the codebook's composition class from ``closest'' to ``farthest'' from the channel output and then queries them sequentially in that order for codebook membership. Decoding terminates when a codeword is encountered or when a predetermined number of guesses is reached, and decoding is abandoned. We derive ensemble-tight first-order asymptotics for the code rate and abandonment rate, which shows "},"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":"2502.05959","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-02-09T17:03:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f703f7466641437e33ae2f2ec55a8849cdeaaa8cbc28c3b50f32dcc52a1e1abc","abstract_canon_sha256":"ec05d74122ff16cadec0c6afc1d98180b7823378381665b2eb2e929ed9eccf35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:31.142954Z","signature_b64":"ZH01vNY0GMNgyu0M8MB1fgnsX3rshHrTBcbCzZsctEfkEHlXwudCJKsXFkXxppwN0sQCvvA4DoRnaLCJdGZ8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34b67ef66a3d3d73405d397f41d9b13370919e4eb6f09fffec416fc2cd97f50e","last_reissued_at":"2026-07-05T11:50:31.142512Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:31.142512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding with Abandonment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hamdi Joudeh, Vincent Y. F. Tan","submitted_at":"2025-02-09T17:03:02Z","abstract_excerpt":"This paper considers guessing-based decoders with abandonment for discrete memoryless channels in which all codewords have the same composition. This class of decoders rank-orders all input sequences in the codebook's composition class from ``closest'' to ``farthest'' from the channel output and then queries them sequentially in that order for codebook membership. Decoding terminates when a codeword is encountered or when a predetermined number of guesses is reached, and decoding is abandoned. We derive ensemble-tight first-order asymptotics for the code rate and abandonment rate, which shows "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.05959","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/2502.05959/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":"2502.05959","created_at":"2026-07-05T11:50:31.142568+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.05959v2","created_at":"2026-07-05T11:50:31.142568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.05959","created_at":"2026-07-05T11:50:31.142568+00:00"},{"alias_kind":"pith_short_12","alias_value":"GS3H55TKHU6X","created_at":"2026-07-05T11:50:31.142568+00:00"},{"alias_kind":"pith_short_16","alias_value":"GS3H55TKHU6XGQC5","created_at":"2026-07-05T11:50:31.142568+00:00"},{"alias_kind":"pith_short_8","alias_value":"GS3H55TK","created_at":"2026-07-05T11:50:31.142568+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.12971","citing_title":"Universal Decoding over Finite-State Additive Channels via Noise Guessing","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GS3H55TKHU6XGQC5HF7UDWNRGN","json":"https://pith.science/pith/GS3H55TKHU6XGQC5HF7UDWNRGN.json","graph_json":"https://pith.science/api/pith-number/GS3H55TKHU6XGQC5HF7UDWNRGN/graph.json","events_json":"https://pith.science/api/pith-number/GS3H55TKHU6XGQC5HF7UDWNRGN/events.json","paper":"https://pith.science/paper/GS3H55TK"},"agent_actions":{"view_html":"https://pith.science/pith/GS3H55TKHU6XGQC5HF7UDWNRGN","download_json":"https://pith.science/pith/GS3H55TKHU6XGQC5HF7UDWNRGN.json","view_paper":"https://pith.science/paper/GS3H55TK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.05959&json=true","fetch_graph":"https://pith.science/api/pith-number/GS3H55TKHU6XGQC5HF7UDWNRGN/graph.json","fetch_events":"https://pith.science/api/pith-number/GS3H55TKHU6XGQC5HF7UDWNRGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GS3H55TKHU6XGQC5HF7UDWNRGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GS3H55TKHU6XGQC5HF7UDWNRGN/action/storage_attestation","attest_author":"https://pith.science/pith/GS3H55TKHU6XGQC5HF7UDWNRGN/action/author_attestation","sign_citation":"https://pith.science/pith/GS3H55TKHU6XGQC5HF7UDWNRGN/action/citation_signature","submit_replication":"https://pith.science/pith/GS3H55TKHU6XGQC5HF7UDWNRGN/action/replication_record"}},"created_at":"2026-07-05T11:50:31.142568+00:00","updated_at":"2026-07-05T11:50:31.142568+00:00"}