{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MRMFSLL56RKYUENSH74XILNMQO","short_pith_number":"pith:MRMFSLL5","canonical_record":{"source":{"id":"2605.14007","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T18:12:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f430cdd24c4dce717a3c54c7d259b3ce2dd0ed2d56c0a48902eecb2f47e42826","abstract_canon_sha256":"3b60a5212f51cf2ed406f3196d1e773646e47697c5440c1bc94e659ce467dfa6"},"schema_version":"1.0"},"canonical_sha256":"6458592d7df4558a11b23ff9742dac83a56fdac4e052b07fef2615a8ba4b3fe4","source":{"kind":"arxiv","id":"2605.14007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14007","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14007v1","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14007","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"pith_short_12","alias_value":"MRMFSLL56RKY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MRMFSLL56RKYUENS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MRMFSLL5","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MRMFSLL56RKYUENSH74XILNMQO","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14007","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T18:12:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f430cdd24c4dce717a3c54c7d259b3ce2dd0ed2d56c0a48902eecb2f47e42826","abstract_canon_sha256":"3b60a5212f51cf2ed406f3196d1e773646e47697c5440c1bc94e659ce467dfa6"},"schema_version":"1.0"},"canonical_sha256":"6458592d7df4558a11b23ff9742dac83a56fdac4e052b07fef2615a8ba4b3fe4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:13.098787Z","signature_b64":"QmMVPEM6Zb8GLKS4LLidPBWctXW/Vm02FFpxWFDSwG76NjLFtfeSaJrQJtlXnQ131kULmtc3geXd23JJA4jQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6458592d7df4558a11b23ff9742dac83a56fdac4e052b07fef2615a8ba4b3fe4","last_reissued_at":"2026-05-17T23:39:13.098198Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:13.098198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14007","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qjw5cE1LD9XF/44TA4W7783vOb5TqjuHsqzgLygALUCLklJhh2TzPCD+BjTeFNyI2eIAUT7XWVFyTO6EPmANBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:45:17.658195Z"},"content_sha256":"250a4cd31deb85c0070d8d649b6587856f09e618cdc760c9298abb93ab12a4ee","schema_version":"1.0","event_id":"sha256:250a4cd31deb85c0070d8d649b6587856f09e618cdc760c9298abb93ab12a4ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MRMFSLL56RKYUENSH74XILNMQO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Redundancy of Low-Arity Symmetric Boolean CSPs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Symmetric Boolean CSPs of arity at most 5 have their non-redundancy growth rates classified as O(n), O(n^2), or O(n^3), with all arity-4 cases and most arity-5 cases resolved.","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Amatya Sharma, Santhoshini Velusamy","submitted_at":"2026-05-13T18:12:58Z","abstract_excerpt":"Non-redundancy, introduced by Bessiere, Carbonnel, and Katsirelos (AAAI 2020), is a structural parameter for Constraint Satisfaction Problems ($\\mathsf{CSPs}$) that governs kernelization, exact and approximate sparsification, and exact streaming complexity. It is the largest size of a $\\mathsf{CSP}$ instance admitting no smaller subinstance with the same satisfying assignments.\n  We study non-redundancy $\\mathsf{NRD}_n(R)$ for Boolean symmetric $\\mathsf{CSPs}$ defined by an $r$-ary relation $R$ whose value depends only on Hamming weight. An instance of $\\mathsf{CSP}(R)$ has $n$ variables and c"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our main result is a near-complete classification of the asymptotic growth of NRD_n(R) for symmetric Boolean predicates of arity at most 5. We resolve every predicate of arity at most 4 and all but two predicates of arity 5.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The computational experiments are assumed to have exhaustively enumerated and correctly classified all symmetric Boolean relations of arity at most 4 and all but two of arity 5; the algebraic criteria for t-balancedness are assumed to be tight for the unresolved cases.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Symmetric Boolean CSP predicates of arity at most 5 have their non-redundancy NRD_n(R) classified as O(n^t) for small t, with all arity-4 cases and all but two arity-5 cases resolved via t-balancedness and OR-reductions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Symmetric Boolean CSPs of arity at most 5 have their non-redundancy growth rates classified as O(n), O(n^2), or O(n^3), with all arity-4 cases and most arity-5 cases resolved.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7e3a578c01d85ba6e1b54d44735c117b4c4889f4325a0b5be715000449af3e85"},"source":{"id":"2605.14007","kind":"arxiv","version":1},"verdict":{"id":"54f31192-e114-4be3-9373-9a4397d2f708","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:49:10.628545Z","strongest_claim":"Our main result is a near-complete classification of the asymptotic growth of NRD_n(R) for symmetric Boolean predicates of arity at most 5. We resolve every predicate of arity at most 4 and all but two predicates of arity 5.","one_line_summary":"Symmetric Boolean CSP predicates of arity at most 5 have their non-redundancy NRD_n(R) classified as O(n^t) for small t, with all arity-4 cases and all but two arity-5 cases resolved via t-balancedness and OR-reductions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The computational experiments are assumed to have exhaustively enumerated and correctly classified all symmetric Boolean relations of arity at most 4 and all but two of arity 5; the algebraic criteria for t-balancedness are assumed to be tight for the unresolved cases.","pith_extraction_headline":"Symmetric Boolean CSPs of arity at most 5 have their non-redundancy growth rates classified as O(n), O(n^2), or O(n^3), with all arity-4 cases and most arity-5 cases resolved."},"references":{"count":16,"sample":[{"doi":"","year":2012,"title":"Half-Approximating Maximum Dicut in the Streaming Setting","work_id":"b902cfef-5d2b-4f7a-971d-73300907962a","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1109/focs.2019.00021.url:https://doi.org/10.1109/focs.2019.00021","year":2019,"title":"Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT","work_id":"2a6489cc-5f17-49ed-a87f-6b630c6ec80c","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.4230/lipics.approx/random.2022","year":2022,"title":"Schloss Dagstuhl — Leibniz- Zentrum f ¨ur Informatik, July 2022, 38:1–38:23.DOI: 10.4230/LIPIcs.APPROX/RANDOM.2022","work_id":"dcb4cb2b-3e1a-43da-b366-d3a9cd4e896a","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3519935.3519983","year":2005,"title":"by Stefano Leonardi and Anupam Gupta","work_id":"9aec5d54-ecb0-4d1e-b646-03874b2aa8be","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"Near-Optimal Space Lower Bounds for Streaming CSPs","work_id":"b59e946f-e50f-4616-a6d4-bb1585259b7f","ref_index":5,"cited_arxiv_id":"2604.01400","is_internal_anchor":true}],"resolved_work":16,"snapshot_sha256":"5f350f5021c5ac003e7727f2ee5563dc0de8bf92e653a1e5f327bce32a3660ef","internal_anchors":3},"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"},"verdict_id":"54f31192-e114-4be3-9373-9a4397d2f708"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LGU+GQJ5qdJsOC9I+dRmnJlKCFC36Z2OJFVc04kXp8/Sb9ZaqrKntGQkJmeopMWDBylzNdPymn4kDctzFyuzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:45:17.659370Z"},"content_sha256":"2b0c1486233c5eb04124d401bff4e488daeb14eb99197536057a5962ce64b4f8","schema_version":"1.0","event_id":"sha256:2b0c1486233c5eb04124d401bff4e488daeb14eb99197536057a5962ce64b4f8"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:MRMFSLL56RKYUENSH74XILNMQO","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/lipics.itcs.2023.80.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.80) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"LIPIcs. Schloss Dagstuhl– Leibniz-Zentrum f ¨ur Informatik, 2023, 80:1–80:15.DOI: 10.4230/LIPIcs.ITCS.2023.80.URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.80. [KS09] Marek Karpinski and Warren Schudy. “Linear ti","arxiv_id":"2605.14007","detector":"doi_compliance","evidence":{"ref_index":11,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"LIPIcs. Schloss Dagstuhl– Leibniz-Zentrum f ¨ur Informatik, 2023, 80:1–80:15.DOI: 10.4230/LIPIcs.ITCS.2023.80.URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.80. [KS09] Marek Karpinski and Warren Schudy. “Linear ti","reconstructed_doi":"10.4230/lipics.itcs.2023.80.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.80"},"severity":"advisory","ref_index":11,"audited_at":"2026-05-19T06:00:06.730437Z","event_type":"pith.integrity.v1","detected_doi":"10.4230/lipics.itcs.2023.80.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.80","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"328d68d03ad77fe5421a154231aa18de83b78ff808a8d2ff19cedd8a3ef3ae8b","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":83,"payload_sha256":"4992272b7d91afd9576c9cf342a353d78fbfe8de8f450bac780b3a9a4ed1c4e2","signature_b64":"2yZFL2J4jFm+uoOTw7TN/tKDtqAG/P+VHEQR6pXHIKAGYC6ht9I2KVgQ1taTEvF6EdoCVvtsoENF74YoiB1tAA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T06:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdEhHCaLAsM83cDy+G442KAh9FtCBC/FcQbdEzbqwaQyoeZScT/BSAjg3zON2llV5mqmidYiLsakTqdPLgDzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:45:17.660883Z"},"content_sha256":"638d53e415e623740ef244182085862244961a6d5ecd74d9e8fac477219c17e0","schema_version":"1.0","event_id":"sha256:638d53e415e623740ef244182085862244961a6d5ecd74d9e8fac477219c17e0"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:MRMFSLL56RKYUENSH74XILNMQO","target":"integrity","payload":{"note":"Identifier '10.1109/focs.2019.00021.url:https://doi.org/10.1109/focs.2019.00021' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Ed. by David Zuckerman. IEEE Computer Society, 2019, pp. 180–201.DOI: 10.1109/FOCS.2019.00021.URL:https://doi.org/10.1109/FOCS.2019.00021. [ALMS25] Aditya Anand, Euiwoong Lee, Davide Mazzali, and Amatya Sharma. “Min-CSPs on Complete Instanc","arxiv_id":"2605.14007","detector":"doi_compliance","evidence":{"doi":"10.1109/focs.2019.00021.url:https://doi.org/10.1109/focs.2019.00021","arxiv_id":null,"ref_index":2,"raw_excerpt":"Ed. by David Zuckerman. IEEE Computer Society, 2019, pp. 180–201.DOI: 10.1109/FOCS.2019.00021.URL:https://doi.org/10.1109/FOCS.2019.00021. [ALMS25] Aditya Anand, Euiwoong Lee, Davide Mazzali, and Amatya Sharma. “Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT”. In:Approximation, Random- ization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RA","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":2,"audited_at":"2026-05-19T06:00:06.730437Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/focs.2019.00021.url:https://doi.org/10.1109/focs.2019.00021","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"e144faaf89e10cac8f8d7299b7a0cdb1ccd5543aa5fe1849e9fd934bb38fcba0","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":82,"payload_sha256":"85207e7e2f7ce816d12151201b9dc855b4158085224b9c4822aead2a5371bc01","signature_b64":"7A0uWwbiwn4rztiwyV0olMbaPPUl/190O7jfn1XPCEpIuukb3WvDdeXT8yCeMkjlzZfeKQA2/OU3dSH19f53Ag==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T06:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nJpuAQEeqkslyuh/4zTLGJzU9U7h1nk2qyygB0K6kIcsf6DQZdWgjGm37AuLe58sREQo3thX4Y1bXNGnZs3qAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:45:17.661292Z"},"content_sha256":"591ef223bb554d1a84e5e0a0150613375afd2138616cd40065df914b2cbb452c","schema_version":"1.0","event_id":"sha256:591ef223bb554d1a84e5e0a0150613375afd2138616cd40065df914b2cbb452c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MRMFSLL56RKYUENSH74XILNMQO/bundle.json","state_url":"https://pith.science/pith/MRMFSLL56RKYUENSH74XILNMQO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MRMFSLL56RKYUENSH74XILNMQO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-21T15:45:17Z","links":{"resolver":"https://pith.science/pith/MRMFSLL56RKYUENSH74XILNMQO","bundle":"https://pith.science/pith/MRMFSLL56RKYUENSH74XILNMQO/bundle.json","state":"https://pith.science/pith/MRMFSLL56RKYUENSH74XILNMQO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MRMFSLL56RKYUENSH74XILNMQO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MRMFSLL56RKYUENSH74XILNMQO","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3b60a5212f51cf2ed406f3196d1e773646e47697c5440c1bc94e659ce467dfa6","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T18:12:58Z","title_canon_sha256":"f430cdd24c4dce717a3c54c7d259b3ce2dd0ed2d56c0a48902eecb2f47e42826"},"schema_version":"1.0","source":{"id":"2605.14007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14007","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14007v1","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14007","created_at":"2026-05-17T23:39:13Z"},{"alias_kind":"pith_short_12","alias_value":"MRMFSLL56RKY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MRMFSLL56RKYUENS","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MRMFSLL5","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:2b0c1486233c5eb04124d401bff4e488daeb14eb99197536057a5962ce64b4f8","target":"graph","created_at":"2026-05-17T23:39:13Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our main result is a near-complete classification of the asymptotic growth of NRD_n(R) for symmetric Boolean predicates of arity at most 5. We resolve every predicate of arity at most 4 and all but two predicates of arity 5."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The computational experiments are assumed to have exhaustively enumerated and correctly classified all symmetric Boolean relations of arity at most 4 and all but two of arity 5; the algebraic criteria for t-balancedness are assumed to be tight for the unresolved cases."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Symmetric Boolean CSP predicates of arity at most 5 have their non-redundancy NRD_n(R) classified as O(n^t) for small t, with all arity-4 cases and all but two arity-5 cases resolved via t-balancedness and OR-reductions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Symmetric Boolean CSPs of arity at most 5 have their non-redundancy growth rates classified as O(n), O(n^2), or O(n^3), with all arity-4 cases and most arity-5 cases resolved."}],"snapshot_sha256":"7e3a578c01d85ba6e1b54d44735c117b4c4889f4325a0b5be715000449af3e85"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Non-redundancy, introduced by Bessiere, Carbonnel, and Katsirelos (AAAI 2020), is a structural parameter for Constraint Satisfaction Problems ($\\mathsf{CSPs}$) that governs kernelization, exact and approximate sparsification, and exact streaming complexity. It is the largest size of a $\\mathsf{CSP}$ instance admitting no smaller subinstance with the same satisfying assignments.\n  We study non-redundancy $\\mathsf{NRD}_n(R)$ for Boolean symmetric $\\mathsf{CSPs}$ defined by an $r$-ary relation $R$ whose value depends only on Hamming weight. An instance of $\\mathsf{CSP}(R)$ has $n$ variables and c","authors_text":"Amatya Sharma, Santhoshini Velusamy","cross_cats":["cs.CC"],"headline":"Symmetric Boolean CSPs of arity at most 5 have their non-redundancy growth rates classified as O(n), O(n^2), or O(n^3), with all arity-4 cases and most arity-5 cases resolved.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T18:12:58Z","title":"Non-Redundancy of Low-Arity Symmetric Boolean CSPs"},"references":{"count":16,"internal_anchors":3,"resolved_work":16,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Half-Approximating Maximum Dicut in the Streaming Setting","work_id":"b902cfef-5d2b-4f7a-971d-73300907962a","year":2012},{"cited_arxiv_id":"","doi":"10.1109/focs.2019.00021.url:https://doi.org/10.1109/focs.2019.00021","is_internal_anchor":false,"ref_index":2,"title":"Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT","work_id":"2a6489cc-5f17-49ed-a87f-6b630c6ec80c","year":2019},{"cited_arxiv_id":"","doi":"10.4230/lipics.approx/random.2022","is_internal_anchor":false,"ref_index":3,"title":"Schloss Dagstuhl — Leibniz- Zentrum f ¨ur Informatik, July 2022, 38:1–38:23.DOI: 10.4230/LIPIcs.APPROX/RANDOM.2022","work_id":"dcb4cb2b-3e1a-43da-b366-d3a9cd4e896a","year":2022},{"cited_arxiv_id":"","doi":"10.1145/3519935.3519983","is_internal_anchor":false,"ref_index":4,"title":"by Stefano Leonardi and Anupam Gupta","work_id":"9aec5d54-ecb0-4d1e-b646-03874b2aa8be","year":2005},{"cited_arxiv_id":"2604.01400","doi":"","is_internal_anchor":true,"ref_index":5,"title":"Near-Optimal Space Lower Bounds for Streaming CSPs","work_id":"b59e946f-e50f-4616-a6d4-bb1585259b7f","year":1998}],"snapshot_sha256":"5f350f5021c5ac003e7727f2ee5563dc0de8bf92e653a1e5f327bce32a3660ef"},"source":{"id":"2605.14007","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:49:10.628545Z","id":"54f31192-e114-4be3-9373-9a4397d2f708","model_set":{"reader":"grok-4.3"},"one_line_summary":"Symmetric Boolean CSP predicates of arity at most 5 have their non-redundancy NRD_n(R) classified as O(n^t) for small t, with all arity-4 cases and all but two arity-5 cases resolved via t-balancedness and OR-reductions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Symmetric Boolean CSPs of arity at most 5 have their non-redundancy growth rates classified as O(n), O(n^2), or O(n^3), with all arity-4 cases and most arity-5 cases resolved.","strongest_claim":"Our main result is a near-complete classification of the asymptotic growth of NRD_n(R) for symmetric Boolean predicates of arity at most 5. We resolve every predicate of arity at most 4 and all but two predicates of arity 5.","weakest_assumption":"The computational experiments are assumed to have exhaustively enumerated and correctly classified all symmetric Boolean relations of arity at most 4 and all but two of arity 5; the algebraic criteria for t-balancedness are assumed to be tight for the unresolved cases."}},"verdict_id":"54f31192-e114-4be3-9373-9a4397d2f708"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:250a4cd31deb85c0070d8d649b6587856f09e618cdc760c9298abb93ab12a4ee","target":"record","created_at":"2026-05-17T23:39:13Z","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":"3b60a5212f51cf2ed406f3196d1e773646e47697c5440c1bc94e659ce467dfa6","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-13T18:12:58Z","title_canon_sha256":"f430cdd24c4dce717a3c54c7d259b3ce2dd0ed2d56c0a48902eecb2f47e42826"},"schema_version":"1.0","source":{"id":"2605.14007","kind":"arxiv","version":1}},"canonical_sha256":"6458592d7df4558a11b23ff9742dac83a56fdac4e052b07fef2615a8ba4b3fe4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6458592d7df4558a11b23ff9742dac83a56fdac4e052b07fef2615a8ba4b3fe4","first_computed_at":"2026-05-17T23:39:13.098198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:13.098198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QmMVPEM6Zb8GLKS4LLidPBWctXW/Vm02FFpxWFDSwG76NjLFtfeSaJrQJtlXnQ131kULmtc3geXd23JJA4jQCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:13.098787Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14007","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:591ef223bb554d1a84e5e0a0150613375afd2138616cd40065df914b2cbb452c","sha256:638d53e415e623740ef244182085862244961a6d5ecd74d9e8fac477219c17e0"]}],"invalid_events":[],"applied_event_ids":["sha256:250a4cd31deb85c0070d8d649b6587856f09e618cdc760c9298abb93ab12a4ee","sha256:2b0c1486233c5eb04124d401bff4e488daeb14eb99197536057a5962ce64b4f8"],"state_sha256":"0555c28b0ed09d38e661ee74c2fc7b0952fd7ea2514a21d17cb19060ec35a31a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nF9PraGW2fU4Uh9nicXVRbvH2mS8tF0poUbWZcb7cbMXVTgLcmH4oI3AUm81iBIy8FXV1auHuMma6TYmIChBAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T15:45:17.666220Z","bundle_sha256":"995f8d1ad3c04917d147a78346ec014aa33a664c8a24e471c8476f0d8fff4173"}}