{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BBMW5WG6CB2YQW44YFOKGGJM2Z","short_pith_number":"pith:BBMW5WG6","canonical_record":{"source":{"id":"2507.19456","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-25T17:42:23Z","cross_cats_sorted":[],"title_canon_sha256":"27afdd17dbedeb1bca9e11820e27ed7b139d129d8e94c95eb742ba9bd53f217f","abstract_canon_sha256":"a6ea86cecd0abc1a353db1440ef927575a93b4b432a7c99ac9edb3a1860560fe"},"schema_version":"1.0"},"canonical_sha256":"08596ed8de1075885b9cc15ca3192cd640b83a3428e32ff79771d5b6da352f01","source":{"kind":"arxiv","id":"2507.19456","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.19456","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"2507.19456v1","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19456","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"BBMW5WG6CB2Y","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"pith_short_16","alias_value":"BBMW5WG6CB2YQW44","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"pith_short_8","alias_value":"BBMW5WG6","created_at":"2026-07-05T11:43:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BBMW5WG6CB2YQW44YFOKGGJM2Z","target":"record","payload":{"canonical_record":{"source":{"id":"2507.19456","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-25T17:42:23Z","cross_cats_sorted":[],"title_canon_sha256":"27afdd17dbedeb1bca9e11820e27ed7b139d129d8e94c95eb742ba9bd53f217f","abstract_canon_sha256":"a6ea86cecd0abc1a353db1440ef927575a93b4b432a7c99ac9edb3a1860560fe"},"schema_version":"1.0"},"canonical_sha256":"08596ed8de1075885b9cc15ca3192cd640b83a3428e32ff79771d5b6da352f01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:25.588115Z","signature_b64":"Uyg97bgmKlNVWXCWSy/D47Dh952+lMKui2OpZ3fFkpXBoU67dHMqT3r0/Vm8LpQQ4eC57QKWC//i81Gak0SiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08596ed8de1075885b9cc15ca3192cd640b83a3428e32ff79771d5b6da352f01","last_reissued_at":"2026-07-05T11:43:25.587620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:25.587620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.19456","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-05T11:43:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vOFvR2rbOG6UNlUYUpKM9R6NQEcxK+CtYSYx2/6HF5tAZ6dOPP41kBlO3j6h/RdK5F86pLNoNEkIDf0+KmYSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:03:45.471725Z"},"content_sha256":"0ffd54cd357d23b79cdefa170bb4bb7f780646de85c686f65fdcaa3c3b8fdeb7","schema_version":"1.0","event_id":"sha256:0ffd54cd357d23b79cdefa170bb4bb7f780646de85c686f65fdcaa3c3b8fdeb7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BBMW5WG6CB2YQW44YFOKGGJM2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Odd Ramsey numbers of multipartite graphs and hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Coy Schwieder, Emily Heath, Nicholas Crawford, Owen Henderschedt, Shira Zerbib","submitted_at":"2025-07-25T17:42:23Z","abstract_excerpt":"Given a hypergraph $G$ and a subhypergraph $H$ of $G$, the \\emph{odd Ramsey number} $r_{odd}(G,H)$ is the minimum number of colors needed to edge-color $G$ so that every copy of $H$ intersects some color class in an odd number of edges. Generalizing a result of \\cite{BHZ} in two different ways, in this paper we prove $r_{odd} \\left(K_{n,n}, K_{2,t} \\right)=\\frac{n}{t} + o(n)$ for all $t\\geq 2$, and $r_{odd} \\left(\\mathcal{K}^{(k)}_{n,\\dots,n}, \\mathcal{K}_{1,\\dots,1,2,2} \\right) = \\frac{n}{2} + o(n)$ for all $k\\geq 2$. The latter is the first result studying odd Ramsey numbers for hypergraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19456","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/2507.19456/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-05T11:43:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9rSdePFcBHcm70zIlvwVfE6UDP54WkF3v272LWDvGiNOxlwZ1crf1aZ9PmBx9K0cSZp5aO2zItYm1NhGSCL9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:03:45.472088Z"},"content_sha256":"b9e188bded66028a7ddc94a7a833ad640672bdd60ed9b00b2ae499b418a9cfe5","schema_version":"1.0","event_id":"sha256:b9e188bded66028a7ddc94a7a833ad640672bdd60ed9b00b2ae499b418a9cfe5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BBMW5WG6CB2YQW44YFOKGGJM2Z/bundle.json","state_url":"https://pith.science/pith/BBMW5WG6CB2YQW44YFOKGGJM2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BBMW5WG6CB2YQW44YFOKGGJM2Z/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-07-07T09:03:45Z","links":{"resolver":"https://pith.science/pith/BBMW5WG6CB2YQW44YFOKGGJM2Z","bundle":"https://pith.science/pith/BBMW5WG6CB2YQW44YFOKGGJM2Z/bundle.json","state":"https://pith.science/pith/BBMW5WG6CB2YQW44YFOKGGJM2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BBMW5WG6CB2YQW44YFOKGGJM2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BBMW5WG6CB2YQW44YFOKGGJM2Z","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":"a6ea86cecd0abc1a353db1440ef927575a93b4b432a7c99ac9edb3a1860560fe","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-25T17:42:23Z","title_canon_sha256":"27afdd17dbedeb1bca9e11820e27ed7b139d129d8e94c95eb742ba9bd53f217f"},"schema_version":"1.0","source":{"id":"2507.19456","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.19456","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"2507.19456v1","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.19456","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"BBMW5WG6CB2Y","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"pith_short_16","alias_value":"BBMW5WG6CB2YQW44","created_at":"2026-07-05T11:43:25Z"},{"alias_kind":"pith_short_8","alias_value":"BBMW5WG6","created_at":"2026-07-05T11:43:25Z"}],"graph_snapshots":[{"event_id":"sha256:b9e188bded66028a7ddc94a7a833ad640672bdd60ed9b00b2ae499b418a9cfe5","target":"graph","created_at":"2026-07-05T11:43:25Z","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/2507.19456/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a hypergraph $G$ and a subhypergraph $H$ of $G$, the \\emph{odd Ramsey number} $r_{odd}(G,H)$ is the minimum number of colors needed to edge-color $G$ so that every copy of $H$ intersects some color class in an odd number of edges. Generalizing a result of \\cite{BHZ} in two different ways, in this paper we prove $r_{odd} \\left(K_{n,n}, K_{2,t} \\right)=\\frac{n}{t} + o(n)$ for all $t\\geq 2$, and $r_{odd} \\left(\\mathcal{K}^{(k)}_{n,\\dots,n}, \\mathcal{K}_{1,\\dots,1,2,2} \\right) = \\frac{n}{2} + o(n)$ for all $k\\geq 2$. The latter is the first result studying odd Ramsey numbers for hypergraphs.","authors_text":"Coy Schwieder, Emily Heath, Nicholas Crawford, Owen Henderschedt, Shira Zerbib","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-25T17:42:23Z","title":"Odd Ramsey numbers of multipartite graphs and hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.19456","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:0ffd54cd357d23b79cdefa170bb4bb7f780646de85c686f65fdcaa3c3b8fdeb7","target":"record","created_at":"2026-07-05T11:43:25Z","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":"a6ea86cecd0abc1a353db1440ef927575a93b4b432a7c99ac9edb3a1860560fe","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-25T17:42:23Z","title_canon_sha256":"27afdd17dbedeb1bca9e11820e27ed7b139d129d8e94c95eb742ba9bd53f217f"},"schema_version":"1.0","source":{"id":"2507.19456","kind":"arxiv","version":1}},"canonical_sha256":"08596ed8de1075885b9cc15ca3192cd640b83a3428e32ff79771d5b6da352f01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08596ed8de1075885b9cc15ca3192cd640b83a3428e32ff79771d5b6da352f01","first_computed_at":"2026-07-05T11:43:25.587620Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:43:25.587620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uyg97bgmKlNVWXCWSy/D47Dh952+lMKui2OpZ3fFkpXBoU67dHMqT3r0/Vm8LpQQ4eC57QKWC//i81Gak0SiDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:43:25.588115Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.19456","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ffd54cd357d23b79cdefa170bb4bb7f780646de85c686f65fdcaa3c3b8fdeb7","sha256:b9e188bded66028a7ddc94a7a833ad640672bdd60ed9b00b2ae499b418a9cfe5"],"state_sha256":"348f0bff30e75467a0812f309f925adfd611e0c7e35e85390802a276825f8b93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4TxJGyebRbOjhmEtncNXWgSYydg4Zeste5Du0BBcWTWzQXFKn9Pg6q4uDdnO+PlvhcG5kAlBOlmpbMW7IGtFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:03:45.473998Z","bundle_sha256":"9f251a86ae6ccbe481517069fdda256bdd07c769e71319255f6c2e7b6960afc0"}}