{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Q63E53NNSOWY6RXSYPZS4UQHM6","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":"6a5f51988a672982d5c5d4655eb3c49656a34217a4cdfcc36b7ccda9082a2b60","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-01-21T20:42:12Z","title_canon_sha256":"d110739f83028032d5b8f637e41e5660672ff3e5b61fa1df27a6197b9efe0a24"},"schema_version":"1.0","source":{"id":"2401.11590","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.11590","created_at":"2026-07-05T09:40:16Z"},{"alias_kind":"arxiv_version","alias_value":"2401.11590v2","created_at":"2026-07-05T09:40:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.11590","created_at":"2026-07-05T09:40:16Z"},{"alias_kind":"pith_short_12","alias_value":"Q63E53NNSOWY","created_at":"2026-07-05T09:40:16Z"},{"alias_kind":"pith_short_16","alias_value":"Q63E53NNSOWY6RXS","created_at":"2026-07-05T09:40:16Z"},{"alias_kind":"pith_short_8","alias_value":"Q63E53NN","created_at":"2026-07-05T09:40:16Z"}],"graph_snapshots":[{"event_id":"sha256:cf17d166933520f54ee34aa8f3aed019074e22e76b659e28ce0009ab7b2ea689","target":"graph","created_at":"2026-07-05T09:40:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.11590/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Benny Sudakov, David Munh\\'a Correia, Jun-Ting Hsieh, Pravesh K. Kothari, Sidhanth Mohanty","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-01-21T20:42:12Z","title":"Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.11590","kind":"arxiv","version":2},"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:96a70fb5619b2e3b3c895317e87c24dbf4782fc9067fec3f109f84c0e49bb281","target":"record","created_at":"2026-07-05T09:40:16Z","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":"6a5f51988a672982d5c5d4655eb3c49656a34217a4cdfcc36b7ccda9082a2b60","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-01-21T20:42:12Z","title_canon_sha256":"d110739f83028032d5b8f637e41e5660672ff3e5b61fa1df27a6197b9efe0a24"},"schema_version":"1.0","source":{"id":"2401.11590","kind":"arxiv","version":2}},"canonical_sha256":"87b64eedad93ad8f46f2c3f32e520767a5a7d71517e3756442cf9b10d5c56e6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87b64eedad93ad8f46f2c3f32e520767a5a7d71517e3756442cf9b10d5c56e6c","first_computed_at":"2026-07-05T09:40:16.094818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:40:16.094818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EVGw6DCU+/KRH5UQrTihju05ilJqg3VwID0DJJ0GcBEfuhSaYhIk9VVGyG8ddgKVytj4PQkayFIzkIZOHOZYCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:40:16.095322Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.11590","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96a70fb5619b2e3b3c895317e87c24dbf4782fc9067fec3f109f84c0e49bb281","sha256:cf17d166933520f54ee34aa8f3aed019074e22e76b659e28ce0009ab7b2ea689"],"state_sha256":"5a3e7d94300df2de02df6ce0d25470f950de12a24e139d0c6c9d7af8219119f6"}