{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:5ULCAGHPEC3PYKHY3QAMPPBGQ2","short_pith_number":"pith:5ULCAGHP","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"},"canonical_sha256":"ed162018ef20b6fc28f8dc00c7bc2686ad758f10ba25a702b11e64719235edc0","source":{"kind":"arxiv","id":"2410.05887","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:5ULCAGHPEC3PYKHY3QAMPPBGQ2","target":"record","payload":{"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"},"canonical_sha256":"ed162018ef20b6fc28f8dc00c7bc2686ad758f10ba25a702b11e64719235edc0","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"},"source_kind":"arxiv","source_id":"2410.05887","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7nt4NQxZV68MkTu2mXJa9xGMPcLEInWxU1dx2CWi0jmyoEIpdRytNlLqZ5i0zR+uzBf637+Tq42/xBJYSdfNDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T18:15:49.001401Z"},"content_sha256":"15b7afcaecb5a1e40bd2c238408002fb1a578f7c46de89bb166eb3fc2790216d","schema_version":"1.0","event_id":"sha256:15b7afcaecb5a1e40bd2c238408002fb1a578f7c46de89bb166eb3fc2790216d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:5ULCAGHPEC3PYKHY3QAMPPBGQ2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d76rWFi+7DEa+dL9MC9D6oBUiiYoYCB+ywNjCb465BEB+JPQbSouBSIWEiZaeDuX5NZecM4WOdYcksvYsHabDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T18:15:49.002363Z"},"content_sha256":"9b7c0e917fbd75a09af69076c30448be7b4e4e8b2a8d29d49e3229d8af63fc51","schema_version":"1.0","event_id":"sha256:9b7c0e917fbd75a09af69076c30448be7b4e4e8b2a8d29d49e3229d8af63fc51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2/bundle.json","state_url":"https://pith.science/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-19T18:15:49Z","links":{"resolver":"https://pith.science/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2","bundle":"https://pith.science/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2/bundle.json","state":"https://pith.science/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ULCAGHPEC3PYKHY3QAMPPBGQ2/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8PYMj/bpBLs3q3VROMBmx0h/izlxhrUQqKBbLJuE5dSZCXkRWiKFLX3EFnAews/MRyTS3f0kbUBGvoJqu2DoCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T18:15:49.007784Z","bundle_sha256":"6e74ddecad12861ebb40bdc677b60450c89542ce1af82f6770cf49dc8eae8bd9"}}