{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2LK6SAIPSPMVG754WABLG7IKTW","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":"13977cdda210f766c7b2ef1bfeac4b4390e05a23cc5a4b5a3142659264b06256","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-18T12:41:53Z","title_canon_sha256":"98a99172106e2ef9ae0b4f411a481ac8ba0e3ce491a34283fea3af7c47c7545a"},"schema_version":"1.0","source":{"id":"2605.18323","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18323","created_at":"2026-05-20T00:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18323v1","created_at":"2026-05-20T00:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18323","created_at":"2026-05-20T00:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"2LK6SAIPSPMV","created_at":"2026-05-20T00:05:55Z"},{"alias_kind":"pith_short_16","alias_value":"2LK6SAIPSPMVG754","created_at":"2026-05-20T00:05:55Z"},{"alias_kind":"pith_short_8","alias_value":"2LK6SAIP","created_at":"2026-05-20T00:05:55Z"}],"graph_snapshots":[{"event_id":"sha256:c8c9b424a35aa3cdd75b0a8e895d6b6a4b6f3eb00ec32998c6ef178ef618c82f","target":"graph","created_at":"2026-05-20T00:05:55Z","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":3,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."}],"snapshot_sha256":"316199670de72d82fba5eb13dd34ca241ccbe62b76c01e28905b72b7908cf1b8"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.18323/integrity.json","findings":[],"snapshot_sha256":"e5fca57ddc7fe2f0e6003f705116e9b2c9b244c516ec7bb7ffbdca2ba6c219d8","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Lei Huang","cross_cats":["math.IT"],"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.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-18T12:41:53Z","title":"Existence and Counting Bounds for High-Memory Spatially-Coupled Codes via the Combinatorial Nullstellensatz"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18323","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T23:58:53.585156Z","id":"8516a501-fc73-4f55-8c2c-f3d7bb0074ea","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"","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.","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."}},"verdict_id":"8516a501-fc73-4f55-8c2c-f3d7bb0074ea"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:85efa537bcaa1355c72d2b80cd21e3187a4b42f76c62a2b13006b02f7724abe5","target":"record","created_at":"2026-05-20T00:05:55Z","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":"13977cdda210f766c7b2ef1bfeac4b4390e05a23cc5a4b5a3142659264b06256","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-18T12:41:53Z","title_canon_sha256":"98a99172106e2ef9ae0b4f411a481ac8ba0e3ce491a34283fea3af7c47c7545a"},"schema_version":"1.0","source":{"id":"2605.18323","kind":"arxiv","version":1}},"canonical_sha256":"d2d5e9010f93d9537fbcb002b37d0a9d930e1283ba6d1983b092793d08b5a3c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2d5e9010f93d9537fbcb002b37d0a9d930e1283ba6d1983b092793d08b5a3c1","first_computed_at":"2026-05-20T00:05:55.174913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:55.174913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"evTXMVQM9zEX6vmmdUW+lqLQjDE7VhPu678NpTSyWEbW24uCAdjunGxuneDqN2hZaDhyYcrcoUSiSoaC/xZ5CA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:55.175807Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18323","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85efa537bcaa1355c72d2b80cd21e3187a4b42f76c62a2b13006b02f7724abe5","sha256:c8c9b424a35aa3cdd75b0a8e895d6b6a4b6f3eb00ec32998c6ef178ef618c82f"],"state_sha256":"9d2591f743d21b1f4bf5c0cd2de287b41cd7b2a5265112d1100ead51c15eba29"}