{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2C56ZKRNMSGIJT7HCB6DUGZRCB","short_pith_number":"pith:2C56ZKRN","schema_version":"1.0","canonical_sha256":"d0bbecaa2d648c84cfe7107c3a1b31106aab43a13ad7115e3dbbd2b694e94206","source":{"kind":"arxiv","id":"1312.0372","version":1},"attestation_state":"computed","paper":{"title":"Polar Codes: Graph Representation and Duality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marc Fossorier","submitted_at":"2013-12-02T08:35:51Z","abstract_excerpt":"In this paper, we present an iterative construction of a polar code and develop properties of the dual of a polar code. Based on this approach, belief propagation of a polar code can be presented in the context of low-density parity check codes."},"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":"1312.0372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-02T08:35:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ddb1e07c778ee59aaabbddd90f4ed3185527a67adce6bbabe15e04e4d367ec1","abstract_canon_sha256":"87ebabb70f7b4b08f3177b9e899fe51353c733c45b5a5187125149022c7866da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:45.855355Z","signature_b64":"crwA1M3RarJOfHHv3V4NWZUEbKGlkTtnmtvyyjsHN88O0JhYPlUa2gGWvtNgaeesFZY3b0oEvwVKy4VZHij6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0bbecaa2d648c84cfe7107c3a1b31106aab43a13ad7115e3dbbd2b694e94206","last_reissued_at":"2026-05-18T03:05:45.854714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:45.854714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polar Codes: Graph Representation and Duality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marc Fossorier","submitted_at":"2013-12-02T08:35:51Z","abstract_excerpt":"In this paper, we present an iterative construction of a polar code and develop properties of the dual of a polar code. Based on this approach, belief propagation of a polar code can be presented in the context of low-density parity check codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0372","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":"1312.0372","created_at":"2026-05-18T03:05:45.854807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0372v1","created_at":"2026-05-18T03:05:45.854807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0372","created_at":"2026-05-18T03:05:45.854807+00:00"},{"alias_kind":"pith_short_12","alias_value":"2C56ZKRNMSGI","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2C56ZKRNMSGIJT7H","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2C56ZKRN","created_at":"2026-05-18T12:27:30.460161+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/2C56ZKRNMSGIJT7HCB6DUGZRCB","json":"https://pith.science/pith/2C56ZKRNMSGIJT7HCB6DUGZRCB.json","graph_json":"https://pith.science/api/pith-number/2C56ZKRNMSGIJT7HCB6DUGZRCB/graph.json","events_json":"https://pith.science/api/pith-number/2C56ZKRNMSGIJT7HCB6DUGZRCB/events.json","paper":"https://pith.science/paper/2C56ZKRN"},"agent_actions":{"view_html":"https://pith.science/pith/2C56ZKRNMSGIJT7HCB6DUGZRCB","download_json":"https://pith.science/pith/2C56ZKRNMSGIJT7HCB6DUGZRCB.json","view_paper":"https://pith.science/paper/2C56ZKRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0372&json=true","fetch_graph":"https://pith.science/api/pith-number/2C56ZKRNMSGIJT7HCB6DUGZRCB/graph.json","fetch_events":"https://pith.science/api/pith-number/2C56ZKRNMSGIJT7HCB6DUGZRCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2C56ZKRNMSGIJT7HCB6DUGZRCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2C56ZKRNMSGIJT7HCB6DUGZRCB/action/storage_attestation","attest_author":"https://pith.science/pith/2C56ZKRNMSGIJT7HCB6DUGZRCB/action/author_attestation","sign_citation":"https://pith.science/pith/2C56ZKRNMSGIJT7HCB6DUGZRCB/action/citation_signature","submit_replication":"https://pith.science/pith/2C56ZKRNMSGIJT7HCB6DUGZRCB/action/replication_record"}},"created_at":"2026-05-18T03:05:45.854807+00:00","updated_at":"2026-05-18T03:05:45.854807+00:00"}