{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NEVHMRSY5KMC2YCIBOOOILYQZD","short_pith_number":"pith:NEVHMRSY","schema_version":"1.0","canonical_sha256":"692a764658ea982d60480b9ce42f10c8d14fa25441de89c339c33ce896e062f2","source":{"kind":"arxiv","id":"1311.7590","version":1},"attestation_state":"computed","paper":{"title":"Universal Polar Decoding with Channel Knowledge at the Encoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mine Alsan","submitted_at":"2013-11-29T15:02:33Z","abstract_excerpt":"Polar coding over a class of binary discrete memoryless channels with channel knowledge at the encoder is studied. It is shown that polar codes achieve the capacity of convex and one-sided classes of symmetric channels."},"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":"1311.7590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-29T15:02:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"db427e2ff40f79ee2b5d1f9815b5e1c6e2f3219856223fe47794e255b9f86141","abstract_canon_sha256":"69eab5430ba2e60001eaf2305627c931fb234501822b08c12132a4fb4a858bec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:55.841621Z","signature_b64":"2DmszEcn13FzQ0llWxIupAev1fkoLcJ/WwpMFtCAaU72O9neH9wIO6Uo01wRHCdkkuvS3P241SNmXLQf+BZyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"692a764658ea982d60480b9ce42f10c8d14fa25441de89c339c33ce896e062f2","last_reissued_at":"2026-05-18T03:05:55.841036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:55.841036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Polar Decoding with Channel Knowledge at the Encoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mine Alsan","submitted_at":"2013-11-29T15:02:33Z","abstract_excerpt":"Polar coding over a class of binary discrete memoryless channels with channel knowledge at the encoder is studied. It is shown that polar codes achieve the capacity of convex and one-sided classes of symmetric channels."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7590","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":"1311.7590","created_at":"2026-05-18T03:05:55.841106+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.7590v1","created_at":"2026-05-18T03:05:55.841106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7590","created_at":"2026-05-18T03:05:55.841106+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEVHMRSY5KMC","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEVHMRSY5KMC2YCI","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEVHMRSY","created_at":"2026-05-18T12:27:52.871228+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/NEVHMRSY5KMC2YCIBOOOILYQZD","json":"https://pith.science/pith/NEVHMRSY5KMC2YCIBOOOILYQZD.json","graph_json":"https://pith.science/api/pith-number/NEVHMRSY5KMC2YCIBOOOILYQZD/graph.json","events_json":"https://pith.science/api/pith-number/NEVHMRSY5KMC2YCIBOOOILYQZD/events.json","paper":"https://pith.science/paper/NEVHMRSY"},"agent_actions":{"view_html":"https://pith.science/pith/NEVHMRSY5KMC2YCIBOOOILYQZD","download_json":"https://pith.science/pith/NEVHMRSY5KMC2YCIBOOOILYQZD.json","view_paper":"https://pith.science/paper/NEVHMRSY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.7590&json=true","fetch_graph":"https://pith.science/api/pith-number/NEVHMRSY5KMC2YCIBOOOILYQZD/graph.json","fetch_events":"https://pith.science/api/pith-number/NEVHMRSY5KMC2YCIBOOOILYQZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEVHMRSY5KMC2YCIBOOOILYQZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEVHMRSY5KMC2YCIBOOOILYQZD/action/storage_attestation","attest_author":"https://pith.science/pith/NEVHMRSY5KMC2YCIBOOOILYQZD/action/author_attestation","sign_citation":"https://pith.science/pith/NEVHMRSY5KMC2YCIBOOOILYQZD/action/citation_signature","submit_replication":"https://pith.science/pith/NEVHMRSY5KMC2YCIBOOOILYQZD/action/replication_record"}},"created_at":"2026-05-18T03:05:55.841106+00:00","updated_at":"2026-05-18T03:05:55.841106+00:00"}