{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KBQWCEPOEHQOM5ILYQUCE66MWP","short_pith_number":"pith:KBQWCEPO","schema_version":"1.0","canonical_sha256":"50616111ee21e0e6750bc428227bccb3d7b1bd292b1d2489455b841082bb95fa","source":{"kind":"arxiv","id":"1304.1790","version":3},"attestation_state":"computed","paper":{"title":"Upgraded Approximation of Non-Binary Alphabets for Polar Code Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arash Ghayoori, T. Aaron Gulliver","submitted_at":"2013-04-05T19:40:16Z","abstract_excerpt":"An algorithm is presented for approximating a single-user channel with a prime input alphabet size. The result is an upgraded version of the channel with a reduced output alphabet size. It is shown that this algorithm can be used to reduce the output alphabet size to the input alphabet size in most cases."},"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":"1304.1790","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-05T19:40:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"90a644b9377cfac15176aefec514546aa599e4748a0de00e814a6a2865413a5c","abstract_canon_sha256":"bf6b319dceb0b9ec38748d26a63a4a0f22707f27889fcb7c93c70155fdc18e94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:33.386163Z","signature_b64":"tDVSPNgRLPIHKRfSLVmw0aDcVFgEqv2tHZ3AA/D+ZF1SGRNvYJ95VQDjGR52XPa8ScYupadzmK6ifzMDTDyxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50616111ee21e0e6750bc428227bccb3d7b1bd292b1d2489455b841082bb95fa","last_reissued_at":"2026-05-18T03:26:33.385694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:33.385694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upgraded Approximation of Non-Binary Alphabets for Polar Code Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arash Ghayoori, T. Aaron Gulliver","submitted_at":"2013-04-05T19:40:16Z","abstract_excerpt":"An algorithm is presented for approximating a single-user channel with a prime input alphabet size. The result is an upgraded version of the channel with a reduced output alphabet size. It is shown that this algorithm can be used to reduce the output alphabet size to the input alphabet size in most cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1790","kind":"arxiv","version":3},"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":"1304.1790","created_at":"2026-05-18T03:26:33.385761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1790v3","created_at":"2026-05-18T03:26:33.385761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1790","created_at":"2026-05-18T03:26:33.385761+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBQWCEPOEHQO","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBQWCEPOEHQOM5IL","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBQWCEPO","created_at":"2026-05-18T12:27:49.015174+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/KBQWCEPOEHQOM5ILYQUCE66MWP","json":"https://pith.science/pith/KBQWCEPOEHQOM5ILYQUCE66MWP.json","graph_json":"https://pith.science/api/pith-number/KBQWCEPOEHQOM5ILYQUCE66MWP/graph.json","events_json":"https://pith.science/api/pith-number/KBQWCEPOEHQOM5ILYQUCE66MWP/events.json","paper":"https://pith.science/paper/KBQWCEPO"},"agent_actions":{"view_html":"https://pith.science/pith/KBQWCEPOEHQOM5ILYQUCE66MWP","download_json":"https://pith.science/pith/KBQWCEPOEHQOM5ILYQUCE66MWP.json","view_paper":"https://pith.science/paper/KBQWCEPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1790&json=true","fetch_graph":"https://pith.science/api/pith-number/KBQWCEPOEHQOM5ILYQUCE66MWP/graph.json","fetch_events":"https://pith.science/api/pith-number/KBQWCEPOEHQOM5ILYQUCE66MWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBQWCEPOEHQOM5ILYQUCE66MWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBQWCEPOEHQOM5ILYQUCE66MWP/action/storage_attestation","attest_author":"https://pith.science/pith/KBQWCEPOEHQOM5ILYQUCE66MWP/action/author_attestation","sign_citation":"https://pith.science/pith/KBQWCEPOEHQOM5ILYQUCE66MWP/action/citation_signature","submit_replication":"https://pith.science/pith/KBQWCEPOEHQOM5ILYQUCE66MWP/action/replication_record"}},"created_at":"2026-05-18T03:26:33.385761+00:00","updated_at":"2026-05-18T03:26:33.385761+00:00"}