{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7E3KBL7PGKK5RNSKYC7A5FVDMK","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":"98d0b6c1eee1b7e7670663a30d8dd29a1ab6e7621fdb31cc1caf80194db12a5f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-16T08:20:11Z","title_canon_sha256":"62c43411114db6e10558adf42b7097fab7329ceac36dc8563278b8b50a39bc73"},"schema_version":"1.0","source":{"id":"2408.08598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.08598","created_at":"2026-07-05T08:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"2408.08598v1","created_at":"2026-07-05T08:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.08598","created_at":"2026-07-05T08:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"7E3KBL7PGKK5","created_at":"2026-07-05T08:56:06Z"},{"alias_kind":"pith_short_16","alias_value":"7E3KBL7PGKK5RNSK","created_at":"2026-07-05T08:56:06Z"},{"alias_kind":"pith_short_8","alias_value":"7E3KBL7P","created_at":"2026-07-05T08:56:06Z"}],"graph_snapshots":[{"event_id":"sha256:1041b5e4984591547b54bfa74f6a2b081dbe22ce50abbf03afc3dce8b23eca4e","target":"graph","created_at":"2026-07-05T08:56:06Z","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/2408.08598/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Alexander Clifton, Calum Buchanan, Eric Culver, Jiaxi Nie, Kenta Ozeki, Mei Yin, P\\'eter Frankl, Puck Rombach","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-16T08:20:11Z","title":"On odd covers of cliques and disjoint unions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.08598","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:9953f75205415950440aa2be0e5b30fc83699e51df1cda4f3068bc4f82b291f9","target":"record","created_at":"2026-07-05T08:56:06Z","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":"98d0b6c1eee1b7e7670663a30d8dd29a1ab6e7621fdb31cc1caf80194db12a5f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-08-16T08:20:11Z","title_canon_sha256":"62c43411114db6e10558adf42b7097fab7329ceac36dc8563278b8b50a39bc73"},"schema_version":"1.0","source":{"id":"2408.08598","kind":"arxiv","version":1}},"canonical_sha256":"f936a0afef3295d8b64ac0be0e96a3629d02bf1c0800c47d976dd8679c77d8ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f936a0afef3295d8b64ac0be0e96a3629d02bf1c0800c47d976dd8679c77d8ce","first_computed_at":"2026-07-05T08:56:06.320853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:56:06.320853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+/JUd7Ph7kjygD3pC7zZwsOS0fEnrrgrAyclTv7V8KsB66lKmtKoG6LlUD7mYRgdY3HhptRnsQSqRJLOqE9qDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:56:06.321375Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.08598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9953f75205415950440aa2be0e5b30fc83699e51df1cda4f3068bc4f82b291f9","sha256:1041b5e4984591547b54bfa74f6a2b081dbe22ce50abbf03afc3dce8b23eca4e"],"state_sha256":"19aca52031ec79b4e9127edc539ed233c04b8e0f44b2e4dd2643bf2ed90aef78"}