{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:62AIPMANZOB6NGT6WFVHXMZJ5N","short_pith_number":"pith:62AIPMAN","schema_version":"1.0","canonical_sha256":"f68087b00dcb83e69a7eb16a7bb329eb743a26c8f23a3430a3f9d8424380b425","source":{"kind":"arxiv","id":"1107.5177","version":1},"attestation_state":"computed","paper":{"title":"Monochromatic cycles and the monochromatic circumference in 2-coloured graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Matthew White","submitted_at":"2011-07-26T11:28:45Z","abstract_excerpt":"Li, Nikiforov and Schelp conjectured that a 2-edge coloured graph G with order n and minimal degree strictly greater than 3n/4 contains a monochromatic cycle of length l, for all l at least four and at most n/2. We prove this conjecture for sufficiently large n and also find all 2-edge coloured graphs with minimal degree equal to 3n/4 that do not contain all such cycles. Finally we show that, for all positive constants d and sufficiently large n, a 2-edge coloured graph G of order n with minimal degree at least 3n/4 either contains a monochromatic cycle of length at least (2/3+d/2)n, or, in on"},"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":"1107.5177","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-26T11:28:45Z","cross_cats_sorted":[],"title_canon_sha256":"8fed52f8d422188718addb44c68546f8c4fb323a476d390e10a31538bb36dec4","abstract_canon_sha256":"e34ab05fa69621db03fa91aa9d685cf5ea2be09c43519cd6eb538197e00e36cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:52.831138Z","signature_b64":"SJKKA6bv5ZlTIQI+/mnO/rzUy2XdtNA/l7Xrr5rfYFlkT7jkMR3VNAi2exri+KgG16zEHYppl3XXo7eFmLdUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f68087b00dcb83e69a7eb16a7bb329eb743a26c8f23a3430a3f9d8424380b425","last_reissued_at":"2026-05-18T04:16:52.830470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:52.830470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monochromatic cycles and the monochromatic circumference in 2-coloured graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Matthew White","submitted_at":"2011-07-26T11:28:45Z","abstract_excerpt":"Li, Nikiforov and Schelp conjectured that a 2-edge coloured graph G with order n and minimal degree strictly greater than 3n/4 contains a monochromatic cycle of length l, for all l at least four and at most n/2. We prove this conjecture for sufficiently large n and also find all 2-edge coloured graphs with minimal degree equal to 3n/4 that do not contain all such cycles. Finally we show that, for all positive constants d and sufficiently large n, a 2-edge coloured graph G of order n with minimal degree at least 3n/4 either contains a monochromatic cycle of length at least (2/3+d/2)n, or, in on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5177","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":""},"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":"1107.5177","created_at":"2026-05-18T04:16:52.830568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.5177v1","created_at":"2026-05-18T04:16:52.830568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5177","created_at":"2026-05-18T04:16:52.830568+00:00"},{"alias_kind":"pith_short_12","alias_value":"62AIPMANZOB6","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"62AIPMANZOB6NGT6","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"62AIPMAN","created_at":"2026-05-18T12:26:22.705136+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/62AIPMANZOB6NGT6WFVHXMZJ5N","json":"https://pith.science/pith/62AIPMANZOB6NGT6WFVHXMZJ5N.json","graph_json":"https://pith.science/api/pith-number/62AIPMANZOB6NGT6WFVHXMZJ5N/graph.json","events_json":"https://pith.science/api/pith-number/62AIPMANZOB6NGT6WFVHXMZJ5N/events.json","paper":"https://pith.science/paper/62AIPMAN"},"agent_actions":{"view_html":"https://pith.science/pith/62AIPMANZOB6NGT6WFVHXMZJ5N","download_json":"https://pith.science/pith/62AIPMANZOB6NGT6WFVHXMZJ5N.json","view_paper":"https://pith.science/paper/62AIPMAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.5177&json=true","fetch_graph":"https://pith.science/api/pith-number/62AIPMANZOB6NGT6WFVHXMZJ5N/graph.json","fetch_events":"https://pith.science/api/pith-number/62AIPMANZOB6NGT6WFVHXMZJ5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62AIPMANZOB6NGT6WFVHXMZJ5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62AIPMANZOB6NGT6WFVHXMZJ5N/action/storage_attestation","attest_author":"https://pith.science/pith/62AIPMANZOB6NGT6WFVHXMZJ5N/action/author_attestation","sign_citation":"https://pith.science/pith/62AIPMANZOB6NGT6WFVHXMZJ5N/action/citation_signature","submit_replication":"https://pith.science/pith/62AIPMANZOB6NGT6WFVHXMZJ5N/action/replication_record"}},"created_at":"2026-05-18T04:16:52.830568+00:00","updated_at":"2026-05-18T04:16:52.830568+00:00"}