{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:LCIZQDM6GTXOUNKFQIYYSGD5JL","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":"367c6c419d0e3b7f3e9e153096930b6b897969482d0f5f9495772d4e089df81d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-02-20T14:15:02Z","title_canon_sha256":"c0101fef00b8a63e95d751bc30334207700820125cb43c113eb6bda24fff296d"},"schema_version":"1.0","source":{"id":"2202.09822","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.09822","created_at":"2026-07-05T03:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"2202.09822v1","created_at":"2026-07-05T03:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.09822","created_at":"2026-07-05T03:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"LCIZQDM6GTXO","created_at":"2026-07-05T03:58:26Z"},{"alias_kind":"pith_short_16","alias_value":"LCIZQDM6GTXOUNKF","created_at":"2026-07-05T03:58:26Z"},{"alias_kind":"pith_short_8","alias_value":"LCIZQDM6","created_at":"2026-07-05T03:58:26Z"}],"graph_snapshots":[{"event_id":"sha256:c47c6ae65e0457fe5a5fdabdd768cd6e17bd86a8f4726e06a35d1b01f42b1fbd","target":"graph","created_at":"2026-07-05T03:58:26Z","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/2202.09822/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a finite simple graph $G$, an odd cover of $G$ is a collection of complete bipartite graphs, or bicliques, in which each edge of $G$ appears in an odd number of bicliques and each non-edge of $G$ appears in an even number of bicliques. We denote the minimum cardinality of an odd cover of $G$ by $b_2(G)$ and prove that $b_2(G)$ is bounded below by half of the rank over $\\mathbb{F}_2$ of the adjacency matrix of $G$. We show that this lower bound is tight in the case when $G$ is a bipartite graph and almost tight when $G$ is an odd cycle. However, we also present an infinite family of graph","authors_text":"Alexander Clifton, Calum Buchanan, Eric Culver, Jason O'Neill, Jiaxi Nie, Mei Yin, Puck Rombach","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-02-20T14:15:02Z","title":"Odd Covers of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.09822","kind":"arxiv","version":1},"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:5ce73ef627eac1e6f97942dca72cefbcb6a3d4c6e86d2f4a8ea4d792f15fce92","target":"record","created_at":"2026-07-05T03:58:26Z","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":"367c6c419d0e3b7f3e9e153096930b6b897969482d0f5f9495772d4e089df81d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-02-20T14:15:02Z","title_canon_sha256":"c0101fef00b8a63e95d751bc30334207700820125cb43c113eb6bda24fff296d"},"schema_version":"1.0","source":{"id":"2202.09822","kind":"arxiv","version":1}},"canonical_sha256":"5891980d9e34eeea3545823189187d4acecf436b044727ce0e384e7e7966e3e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5891980d9e34eeea3545823189187d4acecf436b044727ce0e384e7e7966e3e2","first_computed_at":"2026-07-05T03:58:26.537661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:58:26.537661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lGgah/lpi26HYbce2b4E+1uKITN/bjJqVwmh7oWd6QJTt8LgHKD/ZVxHyKaL2f0YOI1tIT1a0FOr0LNAaM2dDg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:58:26.538081Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.09822","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ce73ef627eac1e6f97942dca72cefbcb6a3d4c6e86d2f4a8ea4d792f15fce92","sha256:c47c6ae65e0457fe5a5fdabdd768cd6e17bd86a8f4726e06a35d1b01f42b1fbd"],"state_sha256":"674a1a558de9e857bc637b370387b7d94e6a4402af19db8d3c989e138a2a38d3"}