{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7E3KBL7PGKK5RNSKYC7A5FVDMK","short_pith_number":"pith:7E3KBL7P","schema_version":"1.0","canonical_sha256":"f936a0afef3295d8b64ac0be0e96a3629d02bf1c0800c47d976dd8679c77d8ce","source":{"kind":"arxiv","id":"2408.08598","version":1},"attestation_state":"computed","paper":{"title":"On odd covers of cliques and disjoint unions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Clifton, Calum Buchanan, Eric Culver, Jiaxi Nie, Kenta Ozeki, Mei Yin, P\\'eter Frankl, Puck Rombach","submitted_at":"2024-08-16T08:20:11Z","abstract_excerpt":"Babai and Frankl posed the ``odd cover problem\" of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always $\\lceil n / 2 \\rceil$ or $\\lceil n / 2 \\rceil + 1$ and that it is the former whenever $n$ is a multiple of $8$. In this paper, we determine this value to be $\\lceil n / 2 \\rceil$ whenever $n$ is odd or equivalent to $18$ modulo $24$. We also further the study of odd covers of graphs which are "},"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":"2408.08598","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-16T08:20:11Z","cross_cats_sorted":[],"title_canon_sha256":"62c43411114db6e10558adf42b7097fab7329ceac36dc8563278b8b50a39bc73","abstract_canon_sha256":"98d0b6c1eee1b7e7670663a30d8dd29a1ab6e7621fdb31cc1caf80194db12a5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:56:06.321375Z","signature_b64":"+/JUd7Ph7kjygD3pC7zZwsOS0fEnrrgrAyclTv7V8KsB66lKmtKoG6LlUD7mYRgdY3HhptRnsQSqRJLOqE9qDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f936a0afef3295d8b64ac0be0e96a3629d02bf1c0800c47d976dd8679c77d8ce","last_reissued_at":"2026-07-05T08:56:06.320853Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:56:06.320853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On odd covers of cliques and disjoint unions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander Clifton, Calum Buchanan, Eric Culver, Jiaxi Nie, Kenta Ozeki, Mei Yin, P\\'eter Frankl, Puck Rombach","submitted_at":"2024-08-16T08:20:11Z","abstract_excerpt":"Babai and Frankl posed the ``odd cover problem\" of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always $\\lceil n / 2 \\rceil$ or $\\lceil n / 2 \\rceil + 1$ and that it is the former whenever $n$ is a multiple of $8$. In this paper, we determine this value to be $\\lceil n / 2 \\rceil$ whenever $n$ is odd or equivalent to $18$ modulo $24$. We also further the study of odd covers of graphs which are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08598","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/2408.08598/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":"2408.08598","created_at":"2026-07-05T08:56:06.320913+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.08598v1","created_at":"2026-07-05T08:56:06.320913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08598","created_at":"2026-07-05T08:56:06.320913+00:00"},{"alias_kind":"pith_short_12","alias_value":"7E3KBL7PGKK5","created_at":"2026-07-05T08:56:06.320913+00:00"},{"alias_kind":"pith_short_16","alias_value":"7E3KBL7PGKK5RNSK","created_at":"2026-07-05T08:56:06.320913+00:00"},{"alias_kind":"pith_short_8","alias_value":"7E3KBL7P","created_at":"2026-07-05T08:56:06.320913+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08506","citing_title":"Almost balanced ordered biclique covering of graphs","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05491","citing_title":"A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7E3KBL7PGKK5RNSKYC7A5FVDMK","json":"https://pith.science/pith/7E3KBL7PGKK5RNSKYC7A5FVDMK.json","graph_json":"https://pith.science/api/pith-number/7E3KBL7PGKK5RNSKYC7A5FVDMK/graph.json","events_json":"https://pith.science/api/pith-number/7E3KBL7PGKK5RNSKYC7A5FVDMK/events.json","paper":"https://pith.science/paper/7E3KBL7P"},"agent_actions":{"view_html":"https://pith.science/pith/7E3KBL7PGKK5RNSKYC7A5FVDMK","download_json":"https://pith.science/pith/7E3KBL7PGKK5RNSKYC7A5FVDMK.json","view_paper":"https://pith.science/paper/7E3KBL7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.08598&json=true","fetch_graph":"https://pith.science/api/pith-number/7E3KBL7PGKK5RNSKYC7A5FVDMK/graph.json","fetch_events":"https://pith.science/api/pith-number/7E3KBL7PGKK5RNSKYC7A5FVDMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7E3KBL7PGKK5RNSKYC7A5FVDMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7E3KBL7PGKK5RNSKYC7A5FVDMK/action/storage_attestation","attest_author":"https://pith.science/pith/7E3KBL7PGKK5RNSKYC7A5FVDMK/action/author_attestation","sign_citation":"https://pith.science/pith/7E3KBL7PGKK5RNSKYC7A5FVDMK/action/citation_signature","submit_replication":"https://pith.science/pith/7E3KBL7PGKK5RNSKYC7A5FVDMK/action/replication_record"}},"created_at":"2026-07-05T08:56:06.320913+00:00","updated_at":"2026-07-05T08:56:06.320913+00:00"}