{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LCIZQDM6GTXOUNKFQIYYSGD5JL","short_pith_number":"pith:LCIZQDM6","schema_version":"1.0","canonical_sha256":"5891980d9e34eeea3545823189187d4acecf436b044727ce0e384e7e7966e3e2","source":{"kind":"arxiv","id":"2202.09822","version":1},"attestation_state":"computed","paper":{"title":"Odd Covers of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Clifton, Calum Buchanan, Eric Culver, Jason O'Neill, Jiaxi Nie, Mei Yin, Puck Rombach","submitted_at":"2022-02-20T14:15:02Z","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"},"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":"2202.09822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-02-20T14:15:02Z","cross_cats_sorted":[],"title_canon_sha256":"c0101fef00b8a63e95d751bc30334207700820125cb43c113eb6bda24fff296d","abstract_canon_sha256":"367c6c419d0e3b7f3e9e153096930b6b897969482d0f5f9495772d4e089df81d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:58:26.538081Z","signature_b64":"lGgah/lpi26HYbce2b4E+1uKITN/bjJqVwmh7oWd6QJTt8LgHKD/ZVxHyKaL2f0YOI1tIT1a0FOr0LNAaM2dDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5891980d9e34eeea3545823189187d4acecf436b044727ce0e384e7e7966e3e2","last_reissued_at":"2026-07-05T03:58:26.537661Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:58:26.537661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Odd Covers of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Clifton, Calum Buchanan, Eric Culver, Jason O'Neill, Jiaxi Nie, Mei Yin, Puck Rombach","submitted_at":"2022-02-20T14:15:02Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.09822","kind":"arxiv","version":1},"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/2202.09822/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":"2202.09822","created_at":"2026-07-05T03:58:26.537727+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.09822v1","created_at":"2026-07-05T03:58:26.537727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.09822","created_at":"2026-07-05T03:58:26.537727+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCIZQDM6GTXO","created_at":"2026-07-05T03:58:26.537727+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCIZQDM6GTXOUNKF","created_at":"2026-07-05T03:58:26.537727+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCIZQDM6","created_at":"2026-07-05T03:58:26.537727+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LCIZQDM6GTXOUNKFQIYYSGD5JL","json":"https://pith.science/pith/LCIZQDM6GTXOUNKFQIYYSGD5JL.json","graph_json":"https://pith.science/api/pith-number/LCIZQDM6GTXOUNKFQIYYSGD5JL/graph.json","events_json":"https://pith.science/api/pith-number/LCIZQDM6GTXOUNKFQIYYSGD5JL/events.json","paper":"https://pith.science/paper/LCIZQDM6"},"agent_actions":{"view_html":"https://pith.science/pith/LCIZQDM6GTXOUNKFQIYYSGD5JL","download_json":"https://pith.science/pith/LCIZQDM6GTXOUNKFQIYYSGD5JL.json","view_paper":"https://pith.science/paper/LCIZQDM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.09822&json=true","fetch_graph":"https://pith.science/api/pith-number/LCIZQDM6GTXOUNKFQIYYSGD5JL/graph.json","fetch_events":"https://pith.science/api/pith-number/LCIZQDM6GTXOUNKFQIYYSGD5JL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCIZQDM6GTXOUNKFQIYYSGD5JL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCIZQDM6GTXOUNKFQIYYSGD5JL/action/storage_attestation","attest_author":"https://pith.science/pith/LCIZQDM6GTXOUNKFQIYYSGD5JL/action/author_attestation","sign_citation":"https://pith.science/pith/LCIZQDM6GTXOUNKFQIYYSGD5JL/action/citation_signature","submit_replication":"https://pith.science/pith/LCIZQDM6GTXOUNKFQIYYSGD5JL/action/replication_record"}},"created_at":"2026-07-05T03:58:26.537727+00:00","updated_at":"2026-07-05T03:58:26.537727+00:00"}