{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5ULCAGHPEC3PYKHY3QAMPPBGQ2","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":"1c006b129989cdbac07701fba07fa80cfa4181a082e87a3d867fb5713c9490d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-08T10:30:59Z","title_canon_sha256":"998855d2ef6dd9dea4ee5dfa125460a225f03ea82893ee367e7def324e167851"},"schema_version":"1.0","source":{"id":"2410.05887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.05887","created_at":"2026-07-05T09:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"2410.05887v1","created_at":"2026-07-05T09:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.05887","created_at":"2026-07-05T09:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"5ULCAGHPEC3P","created_at":"2026-07-05T09:17:52Z"},{"alias_kind":"pith_short_16","alias_value":"5ULCAGHPEC3PYKHY","created_at":"2026-07-05T09:17:52Z"},{"alias_kind":"pith_short_8","alias_value":"5ULCAGHP","created_at":"2026-07-05T09:17:52Z"}],"graph_snapshots":[{"event_id":"sha256:9b7c0e917fbd75a09af69076c30448be7b4e4e8b2a8d29d49e3229d8af63fc51","target":"graph","created_at":"2026-07-05T09:17:52Z","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/2410.05887/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In his study of graph codes, Alon introduced the concept of the odd-Ramsey number of a family of graphs $\\mathcal{H}$ in $K_n$, defined as the minimum number of colours needed to colour the edges of $K_n$ so that every copy of a graph $H\\in \\mathcal{H}$ intersects some colour class in an odd number of edges. In this paper, we focus on complete bipartite graphs. First, we completely resolve the problem when $\\mathcal{H}$ is the family of all spanning complete bipartite graphs on $n$ vertices. We then focus on its subfamilies, that is, $\\{K_{t,n-t}\\colon t\\in T\\}$ for a fixed set of integers $T\\","authors_text":"Kalina Petrova, Shagnik Das, Simona Boyadzhiyska, Thomas Lesgourgues","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-08T10:30:59Z","title":"Odd-Ramsey numbers of complete bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.05887","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:15b7afcaecb5a1e40bd2c238408002fb1a578f7c46de89bb166eb3fc2790216d","target":"record","created_at":"2026-07-05T09:17:52Z","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":"1c006b129989cdbac07701fba07fa80cfa4181a082e87a3d867fb5713c9490d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-08T10:30:59Z","title_canon_sha256":"998855d2ef6dd9dea4ee5dfa125460a225f03ea82893ee367e7def324e167851"},"schema_version":"1.0","source":{"id":"2410.05887","kind":"arxiv","version":1}},"canonical_sha256":"ed162018ef20b6fc28f8dc00c7bc2686ad758f10ba25a702b11e64719235edc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed162018ef20b6fc28f8dc00c7bc2686ad758f10ba25a702b11e64719235edc0","first_computed_at":"2026-07-05T09:17:52.305111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:17:52.305111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0qNAT8tHOEnYOe4CSWSZneo95RENEXlqjk90ABD/ML85PAXeRpRzh6UnWG4IiNARzo0OJ3xndaXuvxhgZSX9Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:17:52.305572Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.05887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15b7afcaecb5a1e40bd2c238408002fb1a578f7c46de89bb166eb3fc2790216d","sha256:9b7c0e917fbd75a09af69076c30448be7b4e4e8b2a8d29d49e3229d8af63fc51"],"state_sha256":"c59d148480b2a178c34bec556cf4acad996613932a56b6ae06cfb443d078d5fb"}