{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2LK6SAIPSPMVG754WABLG7IKTW","short_pith_number":"pith:2LK6SAIP","schema_version":"1.0","canonical_sha256":"d2d5e9010f93d9537fbcb002b37d0a9d930e1283ba6d1983b092793d08b5a3c1","source":{"kind":"arxiv","id":"2605.18323","version":1},"attestation_state":"computed","paper":{"title":"Existence and Counting Bounds for High-Memory Spatially-Coupled Codes via the Combinatorial Nullstellensatz","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Applies Combinatorial Nullstellensatz to derive sufficient memory conditions for SC-LDPC protographs to destroy all 4-cycles and all 4- and 6-cycles, plus lower bounds on the number of such feasible edge-spreading assignments.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lei Huang","submitted_at":"2026-05-18T12:41:53Z","abstract_excerpt":"The finite-length performance of spatially-coupled low-density parity-check (SC-LDPC) codes is strongly affected by short cycle configurations and the harmful structures induced by them. This paper studies SC-LDPC code design directly at the protograph level, where the design variables are the edge-spreading assignments specified by the partition matrix. In contrast to CLLL/Moser--Tardos based constructive frameworks for QC-SC-LDPC codes, we focus on sharper nonconstructive existence and counting bounds. By encoding cycle-activation conditions as polynomial vanishing constraints over finite gr"},"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":"2605.18323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-18T12:41:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"98a99172106e2ef9ae0b4f411a481ac8ba0e3ce491a34283fea3af7c47c7545a","abstract_canon_sha256":"13977cdda210f766c7b2ef1bfeac4b4390e05a23cc5a4b5a3142659264b06256"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:55.175807Z","signature_b64":"evTXMVQM9zEX6vmmdUW+lqLQjDE7VhPu678NpTSyWEbW24uCAdjunGxuneDqN2hZaDhyYcrcoUSiSoaC/xZ5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2d5e9010f93d9537fbcb002b37d0a9d930e1283ba6d1983b092793d08b5a3c1","last_reissued_at":"2026-05-20T00:05:55.174913Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:55.174913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Existence and Counting Bounds for High-Memory Spatially-Coupled Codes via the Combinatorial Nullstellensatz","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Applies Combinatorial Nullstellensatz to derive sufficient memory conditions for SC-LDPC protographs to destroy all 4-cycles and all 4- and 6-cycles, plus lower bounds on the number of such feasible edge-spreading assignments.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lei Huang","submitted_at":"2026-05-18T12:41:53Z","abstract_excerpt":"The finite-length performance of spatially-coupled low-density parity-check (SC-LDPC) codes is strongly affected by short cycle configurations and the harmful structures induced by them. This paper studies SC-LDPC code design directly at the protograph level, where the design variables are the edge-spreading assignments specified by the partition matrix. In contrast to CLLL/Moser--Tardos based constructive frameworks for QC-SC-LDPC codes, we focus on sharper nonconstructive existence and counting bounds. By encoding cycle-activation conditions as polynomial vanishing constraints over finite gr"},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"For fully connected (γ,κ) base graphs, the resulting bounds explicitly characterize the memory required to destroy all 4-cycles as well as all 4- and 6-cycles, and for fixed γ, they are asymptotically tight up to a constant factor compared with known lower bounds.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Cycle-activation conditions for the harmful structures can be encoded as polynomial vanishing constraints over finite grids in a way that permits direct application of the Combinatorial Nullstellensatz to obtain the stated memory thresholds.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Applies Combinatorial Nullstellensatz to derive sufficient memory conditions for SC-LDPC protographs to destroy all 4-cycles and all 4- and 6-cycles, plus lower bounds on the number of such feasible edge-spreading assignments.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"316199670de72d82fba5eb13dd34ca241ccbe62b76c01e28905b72b7908cf1b8"},"source":{"id":"2605.18323","kind":"arxiv","version":1},"verdict":{"id":"8516a501-fc73-4f55-8c2c-f3d7bb0074ea","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T23:58:53.585156Z","strongest_claim":"For fully connected (γ,κ) base graphs, the resulting bounds explicitly characterize the memory required to destroy all 4-cycles as well as all 4- and 6-cycles, and for fixed γ, they are asymptotically tight up to a constant factor compared with known lower bounds.","one_line_summary":"Applies Combinatorial Nullstellensatz to derive sufficient memory conditions for SC-LDPC protographs to destroy all 4-cycles and all 4- and 6-cycles, plus lower bounds on the number of such feasible edge-spreading assignments.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"Cycle-activation conditions for the harmful structures can be encoded as polynomial vanishing constraints over finite grids in a way that permits direct application of the Combinatorial Nullstellensatz to obtain the stated memory thresholds.","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.18323/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.185480Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T23:21:58.859050Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"e5fca57ddc7fe2f0e6003f705116e9b2c9b244c516ec7bb7ffbdca2ba6c219d8"},"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":"2605.18323","created_at":"2026-05-20T00:05:55.175042+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.18323v1","created_at":"2026-05-20T00:05:55.175042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18323","created_at":"2026-05-20T00:05:55.175042+00:00"},{"alias_kind":"pith_short_12","alias_value":"2LK6SAIPSPMV","created_at":"2026-05-20T00:05:55.175042+00:00"},{"alias_kind":"pith_short_16","alias_value":"2LK6SAIPSPMVG754","created_at":"2026-05-20T00:05:55.175042+00:00"},{"alias_kind":"pith_short_8","alias_value":"2LK6SAIP","created_at":"2026-05-20T00:05:55.175042+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/2LK6SAIPSPMVG754WABLG7IKTW","json":"https://pith.science/pith/2LK6SAIPSPMVG754WABLG7IKTW.json","graph_json":"https://pith.science/api/pith-number/2LK6SAIPSPMVG754WABLG7IKTW/graph.json","events_json":"https://pith.science/api/pith-number/2LK6SAIPSPMVG754WABLG7IKTW/events.json","paper":"https://pith.science/paper/2LK6SAIP"},"agent_actions":{"view_html":"https://pith.science/pith/2LK6SAIPSPMVG754WABLG7IKTW","download_json":"https://pith.science/pith/2LK6SAIPSPMVG754WABLG7IKTW.json","view_paper":"https://pith.science/paper/2LK6SAIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.18323&json=true","fetch_graph":"https://pith.science/api/pith-number/2LK6SAIPSPMVG754WABLG7IKTW/graph.json","fetch_events":"https://pith.science/api/pith-number/2LK6SAIPSPMVG754WABLG7IKTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2LK6SAIPSPMVG754WABLG7IKTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2LK6SAIPSPMVG754WABLG7IKTW/action/storage_attestation","attest_author":"https://pith.science/pith/2LK6SAIPSPMVG754WABLG7IKTW/action/author_attestation","sign_citation":"https://pith.science/pith/2LK6SAIPSPMVG754WABLG7IKTW/action/citation_signature","submit_replication":"https://pith.science/pith/2LK6SAIPSPMVG754WABLG7IKTW/action/replication_record"}},"created_at":"2026-05-20T00:05:55.175042+00:00","updated_at":"2026-05-20T00:05:55.175042+00:00"}