{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5ULCAGHPEC3PYKHY3QAMPPBGQ2","short_pith_number":"pith:5ULCAGHP","schema_version":"1.0","canonical_sha256":"ed162018ef20b6fc28f8dc00c7bc2686ad758f10ba25a702b11e64719235edc0","source":{"kind":"arxiv","id":"2410.05887","version":1},"attestation_state":"computed","paper":{"title":"Odd-Ramsey numbers of complete bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kalina Petrova, Shagnik Das, Simona Boyadzhiyska, Thomas Lesgourgues","submitted_at":"2024-10-08T10:30:59Z","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\\"},"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":"2410.05887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-10-08T10:30:59Z","cross_cats_sorted":[],"title_canon_sha256":"998855d2ef6dd9dea4ee5dfa125460a225f03ea82893ee367e7def324e167851","abstract_canon_sha256":"1c006b129989cdbac07701fba07fa80cfa4181a082e87a3d867fb5713c9490d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:17:52.305572Z","signature_b64":"0qNAT8tHOEnYOe4CSWSZneo95RENEXlqjk90ABD/ML85PAXeRpRzh6UnWG4IiNARzo0OJ3xndaXuvxhgZSX9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed162018ef20b6fc28f8dc00c7bc2686ad758f10ba25a702b11e64719235edc0","last_reissued_at":"2026-07-05T09:17:52.305111Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:17:52.305111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Odd-Ramsey numbers of complete bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kalina Petrova, Shagnik Das, Simona Boyadzhiyska, Thomas Lesgourgues","submitted_at":"2024-10-08T10:30:59Z","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\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.05887","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/2410.05887/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":"2410.05887","created_at":"2026-07-05T09:17:52.305167+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.05887v1","created_at":"2026-07-05T09:17:52.305167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.05887","created_at":"2026-07-05T09:17:52.305167+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ULCAGHPEC3P","created_at":"2026-07-05T09:17:52.305167+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ULCAGHPEC3PYKHY","created_at":"2026-07-05T09:17:52.305167+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ULCAGHP","created_at":"2026-07-05T09:17:52.305167+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.19456","citing_title":"Odd Ramsey numbers of multipartite graphs and hypergraphs","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2","json":"https://pith.science/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2.json","graph_json":"https://pith.science/api/pith-number/5ULCAGHPEC3PYKHY3QAMPPBGQ2/graph.json","events_json":"https://pith.science/api/pith-number/5ULCAGHPEC3PYKHY3QAMPPBGQ2/events.json","paper":"https://pith.science/paper/5ULCAGHP"},"agent_actions":{"view_html":"https://pith.science/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2","download_json":"https://pith.science/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2.json","view_paper":"https://pith.science/paper/5ULCAGHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.05887&json=true","fetch_graph":"https://pith.science/api/pith-number/5ULCAGHPEC3PYKHY3QAMPPBGQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/5ULCAGHPEC3PYKHY3QAMPPBGQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2/action/storage_attestation","attest_author":"https://pith.science/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2/action/author_attestation","sign_citation":"https://pith.science/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2/action/citation_signature","submit_replication":"https://pith.science/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2/action/replication_record"}},"created_at":"2026-07-05T09:17:52.305167+00:00","updated_at":"2026-07-05T09:17:52.305167+00:00"}