{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZDICHS6A7Y2RBIZQSHTEVB4UQP","short_pith_number":"pith:ZDICHS6A","schema_version":"1.0","canonical_sha256":"c8d023cbc0fe3510a33091e64a879483f30b1ec3bdc0579b9f52f307a132a1a8","source":{"kind":"arxiv","id":"1305.5626","version":1},"attestation_state":"computed","paper":{"title":"Erasure/list exponents for Slepian-Wolf decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2013-05-24T06:15:34Z","abstract_excerpt":"We analyze random coding error exponents associated with erasure/list Slepian-Wolf decoding using two different methods and then compare the resulting bounds. The first method follows the well known techniques of Gallager and Forney and the second method is based on a technique of distance enumeration, or more generally, type class enumeration, which is rooted in the statistical mechanics of a disordered system that is related to the random energy model (REM). The second method is guaranteed to yield exponent functions which are at least as tight as those of the first method, and it is demonst"},"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":"1305.5626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-24T06:15:34Z","cross_cats_sorted":["cond-mat.stat-mech","math.IT"],"title_canon_sha256":"8038f6bf438b0db07d532502a9d2d9455c3a6aa1b320a034b9fd3d8728d9070e","abstract_canon_sha256":"88115cf556130cedd6b6bb52561a25562e56ab361f74c34dfa4077032de5d5fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:03.627632Z","signature_b64":"FgT0/oQlN3RFulb+XGyMNdlEr+VEjpXSccGN/AMnhWNUqem2ppt4v92F0fAUjOxXiIykJCgPRzqCjHOyCZMTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8d023cbc0fe3510a33091e64a879483f30b1ec3bdc0579b9f52f307a132a1a8","last_reissued_at":"2026-05-18T03:25:03.627114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:03.627114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Erasure/list exponents for Slepian-Wolf decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2013-05-24T06:15:34Z","abstract_excerpt":"We analyze random coding error exponents associated with erasure/list Slepian-Wolf decoding using two different methods and then compare the resulting bounds. The first method follows the well known techniques of Gallager and Forney and the second method is based on a technique of distance enumeration, or more generally, type class enumeration, which is rooted in the statistical mechanics of a disordered system that is related to the random energy model (REM). The second method is guaranteed to yield exponent functions which are at least as tight as those of the first method, and it is demonst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5626","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":"1305.5626","created_at":"2026-05-18T03:25:03.627202+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5626v1","created_at":"2026-05-18T03:25:03.627202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5626","created_at":"2026-05-18T03:25:03.627202+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDICHS6A7Y2R","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDICHS6A7Y2RBIZQ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDICHS6A","created_at":"2026-05-18T12:28:09.283467+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/ZDICHS6A7Y2RBIZQSHTEVB4UQP","json":"https://pith.science/pith/ZDICHS6A7Y2RBIZQSHTEVB4UQP.json","graph_json":"https://pith.science/api/pith-number/ZDICHS6A7Y2RBIZQSHTEVB4UQP/graph.json","events_json":"https://pith.science/api/pith-number/ZDICHS6A7Y2RBIZQSHTEVB4UQP/events.json","paper":"https://pith.science/paper/ZDICHS6A"},"agent_actions":{"view_html":"https://pith.science/pith/ZDICHS6A7Y2RBIZQSHTEVB4UQP","download_json":"https://pith.science/pith/ZDICHS6A7Y2RBIZQSHTEVB4UQP.json","view_paper":"https://pith.science/paper/ZDICHS6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5626&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDICHS6A7Y2RBIZQSHTEVB4UQP/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDICHS6A7Y2RBIZQSHTEVB4UQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDICHS6A7Y2RBIZQSHTEVB4UQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDICHS6A7Y2RBIZQSHTEVB4UQP/action/storage_attestation","attest_author":"https://pith.science/pith/ZDICHS6A7Y2RBIZQSHTEVB4UQP/action/author_attestation","sign_citation":"https://pith.science/pith/ZDICHS6A7Y2RBIZQSHTEVB4UQP/action/citation_signature","submit_replication":"https://pith.science/pith/ZDICHS6A7Y2RBIZQSHTEVB4UQP/action/replication_record"}},"created_at":"2026-05-18T03:25:03.627202+00:00","updated_at":"2026-05-18T03:25:03.627202+00:00"}