{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:K7IBIAA7I776ETKRTJRJCIOOSW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"abd637b9395d116e29aa0f3466cad4eca7b7b349d8bbf3025824d3abba05094a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-27T19:50:29Z","title_canon_sha256":"d421c8051a25ca772239f701fef686461aef498dd18e41701c6ff39cadacb2b9"},"schema_version":"1.0","source":{"id":"1304.7402","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7402","created_at":"2026-05-18T03:26:54Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7402v1","created_at":"2026-05-18T03:26:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7402","created_at":"2026-05-18T03:26:54Z"},{"alias_kind":"pith_short_12","alias_value":"K7IBIAA7I776","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"K7IBIAA7I776ETKR","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"K7IBIAA7","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:8c6f0610c1e0d18c7d93abab71865ad363284be2a985c7cb5f66480c86bd13a2","target":"graph","created_at":"2026-05-18T03:26:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Daqing Wan, Fang-Wei Fu, Jun Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-27T19:50:29Z","title":"Stopping Sets of Algebraic Geometry Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7402","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:87c214c9a148d942559224ba46d90af8a86fad04c7c78903c18020865b7b506b","target":"record","created_at":"2026-05-18T03:26:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"abd637b9395d116e29aa0f3466cad4eca7b7b349d8bbf3025824d3abba05094a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-27T19:50:29Z","title_canon_sha256":"d421c8051a25ca772239f701fef686461aef498dd18e41701c6ff39cadacb2b9"},"schema_version":"1.0","source":{"id":"1304.7402","kind":"arxiv","version":1}},"canonical_sha256":"57d014001f47ffe24d519a629121ce95b9d87ad84f81d431c3640c867e92bb23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57d014001f47ffe24d519a629121ce95b9d87ad84f81d431c3640c867e92bb23","first_computed_at":"2026-05-18T03:26:54.078610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:54.078610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/5pBewswmpgrH1CGtnlb8Yi2Kzh6+5ztyx6vJwfEOgwOjjQX7fKoMTs/tIH6LYfIexj0IBDWfBiyz/YTUxB/DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:54.079663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7402","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87c214c9a148d942559224ba46d90af8a86fad04c7c78903c18020865b7b506b","sha256:8c6f0610c1e0d18c7d93abab71865ad363284be2a985c7cb5f66480c86bd13a2"],"state_sha256":"6b549136507934cedbdb026e27376f6779b564581cd916390bb172a01d984164"}