{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Q63E53NNSOWY6RXSYPZS4UQHM6","short_pith_number":"pith:Q63E53NN","schema_version":"1.0","canonical_sha256":"87b64eedad93ad8f46f2c3f32e520767a5a7d71517e3756442cf9b10d5c56e6c","source":{"kind":"arxiv","id":"2401.11590","version":2},"attestation_state":"computed","paper":{"title":"Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Benny Sudakov, David Munh\\'a Correia, Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty","submitted_at":"2024-01-21T20:42:12Z","abstract_excerpt":"Given a $k$-uniform hypergraph $H$ on $n$ vertices, an even cover in $H$ is a collection of hyperedges that touch each vertex an even number of times. Even covers are a generalization of cycles in graphs and are equivalent to linearly dependent subsets of a system of linear equations modulo $2$. As a result, they arise naturally in the context of well-studied questions in coding theory and refuting unsatisfiable $k$-SAT formulas. Analogous to the irregular Moore bound of Alon, Hoory, and Linial (2002), in 2008, Feige conjectured an extremal trade-off between the number of hyperedges and the le"},"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":"2401.11590","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-01-21T20:42:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d110739f83028032d5b8f637e41e5660672ff3e5b61fa1df27a6197b9efe0a24","abstract_canon_sha256":"6a5f51988a672982d5c5d4655eb3c49656a34217a4cdfcc36b7ccda9082a2b60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:16.095322Z","signature_b64":"EVGw6DCU+/KRH5UQrTihju05ilJqg3VwID0DJJ0GcBEfuhSaYhIk9VVGyG8ddgKVytj4PQkayFIzkIZOHOZYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87b64eedad93ad8f46f2c3f32e520767a5a7d71517e3756442cf9b10d5c56e6c","last_reissued_at":"2026-07-05T09:40:16.094818Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:16.094818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Benny Sudakov, David Munh\\'a Correia, Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty","submitted_at":"2024-01-21T20:42:12Z","abstract_excerpt":"Given a $k$-uniform hypergraph $H$ on $n$ vertices, an even cover in $H$ is a collection of hyperedges that touch each vertex an even number of times. Even covers are a generalization of cycles in graphs and are equivalent to linearly dependent subsets of a system of linear equations modulo $2$. As a result, they arise naturally in the context of well-studied questions in coding theory and refuting unsatisfiable $k$-SAT formulas. Analogous to the irregular Moore bound of Alon, Hoory, and Linial (2002), in 2008, Feige conjectured an extremal trade-off between the number of hyperedges and the le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11590","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.11590/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2401.11590","created_at":"2026-07-05T09:40:16.094878+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.11590v2","created_at":"2026-07-05T09:40:16.094878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11590","created_at":"2026-07-05T09:40:16.094878+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q63E53NNSOWY","created_at":"2026-07-05T09:40:16.094878+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q63E53NNSOWY6RXS","created_at":"2026-07-05T09:40:16.094878+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q63E53NN","created_at":"2026-07-05T09:40:16.094878+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08597","citing_title":"Kikuchi Graphs of Random Hypergraphs are Approximately Johnson","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q63E53NNSOWY6RXSYPZS4UQHM6","json":"https://pith.science/pith/Q63E53NNSOWY6RXSYPZS4UQHM6.json","graph_json":"https://pith.science/api/pith-number/Q63E53NNSOWY6RXSYPZS4UQHM6/graph.json","events_json":"https://pith.science/api/pith-number/Q63E53NNSOWY6RXSYPZS4UQHM6/events.json","paper":"https://pith.science/paper/Q63E53NN"},"agent_actions":{"view_html":"https://pith.science/pith/Q63E53NNSOWY6RXSYPZS4UQHM6","download_json":"https://pith.science/pith/Q63E53NNSOWY6RXSYPZS4UQHM6.json","view_paper":"https://pith.science/paper/Q63E53NN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.11590&json=true","fetch_graph":"https://pith.science/api/pith-number/Q63E53NNSOWY6RXSYPZS4UQHM6/graph.json","fetch_events":"https://pith.science/api/pith-number/Q63E53NNSOWY6RXSYPZS4UQHM6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q63E53NNSOWY6RXSYPZS4UQHM6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q63E53NNSOWY6RXSYPZS4UQHM6/action/storage_attestation","attest_author":"https://pith.science/pith/Q63E53NNSOWY6RXSYPZS4UQHM6/action/author_attestation","sign_citation":"https://pith.science/pith/Q63E53NNSOWY6RXSYPZS4UQHM6/action/citation_signature","submit_replication":"https://pith.science/pith/Q63E53NNSOWY6RXSYPZS4UQHM6/action/replication_record"}},"created_at":"2026-07-05T09:40:16.094878+00:00","updated_at":"2026-07-05T09:40:16.094878+00:00"}