{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CBP4HF52Q742FN2G3APV33SSA3","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":"3298bf2ab8ea488666751b9a71fc139874855b1d1f7023434698590d76436fa5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-10T17:57:14Z","title_canon_sha256":"4365cd7d0de74781fb4a437a68909af29385b8c1b0c116e2443a119d17046260"},"schema_version":"1.0","source":{"id":"2412.07708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.07708","created_at":"2026-07-05T09:47:14Z"},{"alias_kind":"arxiv_version","alias_value":"2412.07708v1","created_at":"2026-07-05T09:47:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.07708","created_at":"2026-07-05T09:47:14Z"},{"alias_kind":"pith_short_12","alias_value":"CBP4HF52Q742","created_at":"2026-07-05T09:47:14Z"},{"alias_kind":"pith_short_16","alias_value":"CBP4HF52Q742FN2G","created_at":"2026-07-05T09:47:14Z"},{"alias_kind":"pith_short_8","alias_value":"CBP4HF52","created_at":"2026-07-05T09:47:14Z"}],"graph_snapshots":[{"event_id":"sha256:871c5eb4afbe20d1c807280a9fba0125a5eaf53aa0685f873dd41841df82c218","target":"graph","created_at":"2026-07-05T09:47:14Z","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/2412.07708/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"It is easy to see that every $q$-edge-colouring of the complete graph on $2^q+1$ vertices must contain a monochromatic odd cycle. A natural question raised by Erd\\H{o}s and Graham in $1973$ asks for the smallest $L(q)$ such that every $q$-edge-colouring of $K_{2^q+1}$ must contain a monochromatic odd cycle of length at most $L(q)$. In here, we show that $L(q)=O\\left(\\frac{2^q}{q^{1-o(1)}}\\right)$ giving the first non-trivial upper bound on $L(q)$.","authors_text":"Ant\\'onio Gir\\~ao, Zach Hunter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-10T17:57:14Z","title":"Monochromatic odd cycles in edge-coloured complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.07708","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:7a721af3be34df439441b0cfe437d06f8fe8aed2afc41794fa8f98a6e0a87d0c","target":"record","created_at":"2026-07-05T09:47:14Z","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":"3298bf2ab8ea488666751b9a71fc139874855b1d1f7023434698590d76436fa5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-10T17:57:14Z","title_canon_sha256":"4365cd7d0de74781fb4a437a68909af29385b8c1b0c116e2443a119d17046260"},"schema_version":"1.0","source":{"id":"2412.07708","kind":"arxiv","version":1}},"canonical_sha256":"105fc397ba87f9a2b746d81f5dee5206dff11494db8707f64985b59f88dc0130","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"105fc397ba87f9a2b746d81f5dee5206dff11494db8707f64985b59f88dc0130","first_computed_at":"2026-07-05T09:47:14.314478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:47:14.314478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tjO2A8gPpoBmEmbuKibi7bcZ6a5o0KLKlarRsJA1knSBis/0BB1KesLalZcxN4ylMhDhQHc3XdtcQixu5cMpDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:47:14.315005Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.07708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a721af3be34df439441b0cfe437d06f8fe8aed2afc41794fa8f98a6e0a87d0c","sha256:871c5eb4afbe20d1c807280a9fba0125a5eaf53aa0685f873dd41841df82c218"],"state_sha256":"455141bdaff4330dfc9eb94c68a99f941b0434e8a73f31b7d7ac1a7a0744a409"}