{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:K7IBIAA7I776ETKRTJRJCIOOSW","short_pith_number":"pith:K7IBIAA7","schema_version":"1.0","canonical_sha256":"57d014001f47ffe24d519a629121ce95b9d87ad84f81d431c3640c867e92bb23","source":{"kind":"arxiv","id":"1304.7402","version":1},"attestation_state":"computed","paper":{"title":"Stopping Sets of Algebraic Geometry Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daqing Wan, Fang-Wei Fu, Jun Zhang","submitted_at":"2013-04-27T19:50:29Z","abstract_excerpt":"Stopping sets and stopping set distribution of a linear code play an important role in the performance analysis of iterative decoding for this linear code. Let $C$ be an $[n,k]$ linear code over $\\f$ with parity-check matrix $H$, where the rows of $H$ may be dependent. Let $[n]=\\{1,2,...,n\\}$ denote the set of column indices of $H$. A \\emph{stopping set} $S$ of $C$ with parity-check matrix $H$ is a subset of $[n]$ such that the restriction of $H$ to $S$ does not contain a row of weight 1. The \\emph{stopping set distribution} $\\{T_{i}(H)\\}_{i=0}^{n}$ enumerates the number of stopping sets with "},"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.7402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-27T19:50:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d421c8051a25ca772239f701fef686461aef498dd18e41701c6ff39cadacb2b9","abstract_canon_sha256":"abd637b9395d116e29aa0f3466cad4eca7b7b349d8bbf3025824d3abba05094a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:54.079663Z","signature_b64":"/5pBewswmpgrH1CGtnlb8Yi2Kzh6+5ztyx6vJwfEOgwOjjQX7fKoMTs/tIH6LYfIexj0IBDWfBiyz/YTUxB/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57d014001f47ffe24d519a629121ce95b9d87ad84f81d431c3640c867e92bb23","last_reissued_at":"2026-05-18T03:26:54.078610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:54.078610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stopping Sets of Algebraic Geometry Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daqing Wan, Fang-Wei Fu, Jun Zhang","submitted_at":"2013-04-27T19:50:29Z","abstract_excerpt":"Stopping sets and stopping set distribution of a linear code play an important role in the performance analysis of iterative decoding for this linear code. Let $C$ be an $[n,k]$ linear code over $\\f$ with parity-check matrix $H$, where the rows of $H$ may be dependent. Let $[n]=\\{1,2,...,n\\}$ denote the set of column indices of $H$. A \\emph{stopping set} $S$ of $C$ with parity-check matrix $H$ is a subset of $[n]$ such that the restriction of $H$ to $S$ does not contain a row of weight 1. The \\emph{stopping set distribution} $\\{T_{i}(H)\\}_{i=0}^{n}$ enumerates the number of stopping sets with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7402","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":"1304.7402","created_at":"2026-05-18T03:26:54.078792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7402v1","created_at":"2026-05-18T03:26:54.078792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7402","created_at":"2026-05-18T03:26:54.078792+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7IBIAA7I776","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7IBIAA7I776ETKR","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7IBIAA7","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/K7IBIAA7I776ETKRTJRJCIOOSW","json":"https://pith.science/pith/K7IBIAA7I776ETKRTJRJCIOOSW.json","graph_json":"https://pith.science/api/pith-number/K7IBIAA7I776ETKRTJRJCIOOSW/graph.json","events_json":"https://pith.science/api/pith-number/K7IBIAA7I776ETKRTJRJCIOOSW/events.json","paper":"https://pith.science/paper/K7IBIAA7"},"agent_actions":{"view_html":"https://pith.science/pith/K7IBIAA7I776ETKRTJRJCIOOSW","download_json":"https://pith.science/pith/K7IBIAA7I776ETKRTJRJCIOOSW.json","view_paper":"https://pith.science/paper/K7IBIAA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7402&json=true","fetch_graph":"https://pith.science/api/pith-number/K7IBIAA7I776ETKRTJRJCIOOSW/graph.json","fetch_events":"https://pith.science/api/pith-number/K7IBIAA7I776ETKRTJRJCIOOSW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7IBIAA7I776ETKRTJRJCIOOSW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7IBIAA7I776ETKRTJRJCIOOSW/action/storage_attestation","attest_author":"https://pith.science/pith/K7IBIAA7I776ETKRTJRJCIOOSW/action/author_attestation","sign_citation":"https://pith.science/pith/K7IBIAA7I776ETKRTJRJCIOOSW/action/citation_signature","submit_replication":"https://pith.science/pith/K7IBIAA7I776ETKRTJRJCIOOSW/action/replication_record"}},"created_at":"2026-05-18T03:26:54.078792+00:00","updated_at":"2026-05-18T03:26:54.078792+00:00"}