{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CBP4HF52Q742FN2G3APV33SSA3","short_pith_number":"pith:CBP4HF52","schema_version":"1.0","canonical_sha256":"105fc397ba87f9a2b746d81f5dee5206dff11494db8707f64985b59f88dc0130","source":{"kind":"arxiv","id":"2412.07708","version":1},"attestation_state":"computed","paper":{"title":"Monochromatic odd cycles in edge-coloured complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Zach Hunter","submitted_at":"2024-12-10T17:57:14Z","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)$."},"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":"2412.07708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-10T17:57:14Z","cross_cats_sorted":[],"title_canon_sha256":"4365cd7d0de74781fb4a437a68909af29385b8c1b0c116e2443a119d17046260","abstract_canon_sha256":"3298bf2ab8ea488666751b9a71fc139874855b1d1f7023434698590d76436fa5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:14.315005Z","signature_b64":"tjO2A8gPpoBmEmbuKibi7bcZ6a5o0KLKlarRsJA1knSBis/0BB1KesLalZcxN4ylMhDhQHc3XdtcQixu5cMpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"105fc397ba87f9a2b746d81f5dee5206dff11494db8707f64985b59f88dc0130","last_reissued_at":"2026-07-05T09:47:14.314478Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:14.314478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monochromatic odd cycles in edge-coloured complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Zach Hunter","submitted_at":"2024-12-10T17:57:14Z","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)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.07708","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/2412.07708/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":"2412.07708","created_at":"2026-07-05T09:47:14.314557+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.07708v1","created_at":"2026-07-05T09:47:14.314557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.07708","created_at":"2026-07-05T09:47:14.314557+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBP4HF52Q742","created_at":"2026-07-05T09:47:14.314557+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBP4HF52Q742FN2G","created_at":"2026-07-05T09:47:14.314557+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBP4HF52","created_at":"2026-07-05T09:47:14.314557+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15147","citing_title":"Improved Ramsey bounds for generalized Schur equations","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CBP4HF52Q742FN2G3APV33SSA3","json":"https://pith.science/pith/CBP4HF52Q742FN2G3APV33SSA3.json","graph_json":"https://pith.science/api/pith-number/CBP4HF52Q742FN2G3APV33SSA3/graph.json","events_json":"https://pith.science/api/pith-number/CBP4HF52Q742FN2G3APV33SSA3/events.json","paper":"https://pith.science/paper/CBP4HF52"},"agent_actions":{"view_html":"https://pith.science/pith/CBP4HF52Q742FN2G3APV33SSA3","download_json":"https://pith.science/pith/CBP4HF52Q742FN2G3APV33SSA3.json","view_paper":"https://pith.science/paper/CBP4HF52","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.07708&json=true","fetch_graph":"https://pith.science/api/pith-number/CBP4HF52Q742FN2G3APV33SSA3/graph.json","fetch_events":"https://pith.science/api/pith-number/CBP4HF52Q742FN2G3APV33SSA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBP4HF52Q742FN2G3APV33SSA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBP4HF52Q742FN2G3APV33SSA3/action/storage_attestation","attest_author":"https://pith.science/pith/CBP4HF52Q742FN2G3APV33SSA3/action/author_attestation","sign_citation":"https://pith.science/pith/CBP4HF52Q742FN2G3APV33SSA3/action/citation_signature","submit_replication":"https://pith.science/pith/CBP4HF52Q742FN2G3APV33SSA3/action/replication_record"}},"created_at":"2026-07-05T09:47:14.314557+00:00","updated_at":"2026-07-05T09:47:14.314557+00:00"}