{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6W7YNYUEQEA2QBFEMYVMLREFDK","short_pith_number":"pith:6W7YNYUE","schema_version":"1.0","canonical_sha256":"f5bf86e2848101a804a4662ac5c4851aa87efbb1583bb10208db7c8d490380ea","source":{"kind":"arxiv","id":"1707.03987","version":1},"attestation_state":"computed","paper":{"title":"Correction to \"The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2017-07-13T06:27:25Z","abstract_excerpt":"This purpose of this letter is to handle a gap that was found in the proof of Theorem 2 in the paper \"The generalized stochastic likelihood decoder: random coding and expurgated bounds.\""},"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":"1707.03987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-13T06:27:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2d09f8e1d1f7a94ab90619d17b4c7fa606c3654d60c7d0ccc29dcf51343d75d8","abstract_canon_sha256":"d60a880872367812095fd86484d23ecb71ff6f165f705622d031a9df3a9e6e52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:22.909621Z","signature_b64":"uMTzgIBSF5P5yk26zlSpRVk5Q0iqpFQvF5Bc3DtCxNWOXUrgXLohCex3bETepY8Q95pehV3C25KhESwcjjNaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5bf86e2848101a804a4662ac5c4851aa87efbb1583bb10208db7c8d490380ea","last_reissued_at":"2026-05-18T00:40:22.908930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:22.908930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correction to \"The Generalized Stochastic Likelihood Decoder: Random Coding and Expurgated Bounds\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2017-07-13T06:27:25Z","abstract_excerpt":"This purpose of this letter is to handle a gap that was found in the proof of Theorem 2 in the paper \"The generalized stochastic likelihood decoder: random coding and expurgated bounds.\""},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03987","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1707.03987","created_at":"2026-05-18T00:40:22.909030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03987v1","created_at":"2026-05-18T00:40:22.909030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03987","created_at":"2026-05-18T00:40:22.909030+00:00"},{"alias_kind":"pith_short_12","alias_value":"6W7YNYUEQEA2","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6W7YNYUEQEA2QBFE","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6W7YNYUE","created_at":"2026-05-18T12:31:03.183658+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/6W7YNYUEQEA2QBFEMYVMLREFDK","json":"https://pith.science/pith/6W7YNYUEQEA2QBFEMYVMLREFDK.json","graph_json":"https://pith.science/api/pith-number/6W7YNYUEQEA2QBFEMYVMLREFDK/graph.json","events_json":"https://pith.science/api/pith-number/6W7YNYUEQEA2QBFEMYVMLREFDK/events.json","paper":"https://pith.science/paper/6W7YNYUE"},"agent_actions":{"view_html":"https://pith.science/pith/6W7YNYUEQEA2QBFEMYVMLREFDK","download_json":"https://pith.science/pith/6W7YNYUEQEA2QBFEMYVMLREFDK.json","view_paper":"https://pith.science/paper/6W7YNYUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03987&json=true","fetch_graph":"https://pith.science/api/pith-number/6W7YNYUEQEA2QBFEMYVMLREFDK/graph.json","fetch_events":"https://pith.science/api/pith-number/6W7YNYUEQEA2QBFEMYVMLREFDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6W7YNYUEQEA2QBFEMYVMLREFDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6W7YNYUEQEA2QBFEMYVMLREFDK/action/storage_attestation","attest_author":"https://pith.science/pith/6W7YNYUEQEA2QBFEMYVMLREFDK/action/author_attestation","sign_citation":"https://pith.science/pith/6W7YNYUEQEA2QBFEMYVMLREFDK/action/citation_signature","submit_replication":"https://pith.science/pith/6W7YNYUEQEA2QBFEMYVMLREFDK/action/replication_record"}},"created_at":"2026-05-18T00:40:22.909030+00:00","updated_at":"2026-05-18T00:40:22.909030+00:00"}