{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:62AIPMANZOB6NGT6WFVHXMZJ5N","short_pith_number":"pith:62AIPMAN","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"},"canonical_sha256":"f68087b00dcb83e69a7eb16a7bb329eb743a26c8f23a3430a3f9d8424380b425","source":{"kind":"arxiv","id":"1107.5177","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5177","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5177v1","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5177","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"62AIPMANZOB6","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"62AIPMANZOB6NGT6","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"62AIPMAN","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:62AIPMANZOB6NGT6WFVHXMZJ5N","target":"record","payload":{"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"},"canonical_sha256":"f68087b00dcb83e69a7eb16a7bb329eb743a26c8f23a3430a3f9d8424380b425","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"},"source_kind":"arxiv","source_id":"1107.5177","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-05-18T04:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"96RQcg+aGFvbJZWhJjmnbK6vNp60CyQT1yTWNpXqAw8SaD5DykwK1eOdWCmsqJ48fqaCa0MVui7kIpIctrABCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:39:04.732553Z"},"content_sha256":"b287d71053c57c3b64ae103f56d09f76206cdc4f86580e1259c4113b32a86eb8","schema_version":"1.0","event_id":"sha256:b287d71053c57c3b64ae103f56d09f76206cdc4f86580e1259c4113b32a86eb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:62AIPMANZOB6NGT6WFVHXMZJ5N","target":"graph","payload":{"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"},"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-05-18T04:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwYeYsFiGPeag7hYvEM8yY4U9AtRI999LVuWYaCFHH9s1/6FgF/NJTAmAYP9gy62yRE8/Pq2hwznPNNsHd2iAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:39:04.733083Z"},"content_sha256":"83a295bdd8beeed7700cca886b62a311816a5c5f9aab5fbf0bc051ac47d242ed","schema_version":"1.0","event_id":"sha256:83a295bdd8beeed7700cca886b62a311816a5c5f9aab5fbf0bc051ac47d242ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62AIPMANZOB6NGT6WFVHXMZJ5N/bundle.json","state_url":"https://pith.science/pith/62AIPMANZOB6NGT6WFVHXMZJ5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62AIPMANZOB6NGT6WFVHXMZJ5N/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-07T02:39:04Z","links":{"resolver":"https://pith.science/pith/62AIPMANZOB6NGT6WFVHXMZJ5N","bundle":"https://pith.science/pith/62AIPMANZOB6NGT6WFVHXMZJ5N/bundle.json","state":"https://pith.science/pith/62AIPMANZOB6NGT6WFVHXMZJ5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62AIPMANZOB6NGT6WFVHXMZJ5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:62AIPMANZOB6NGT6WFVHXMZJ5N","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":"e34ab05fa69621db03fa91aa9d685cf5ea2be09c43519cd6eb538197e00e36cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-26T11:28:45Z","title_canon_sha256":"8fed52f8d422188718addb44c68546f8c4fb323a476d390e10a31538bb36dec4"},"schema_version":"1.0","source":{"id":"1107.5177","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5177","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5177v1","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5177","created_at":"2026-05-18T04:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"62AIPMANZOB6","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"62AIPMANZOB6NGT6","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"62AIPMAN","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:83a295bdd8beeed7700cca886b62a311816a5c5f9aab5fbf0bc051ac47d242ed","target":"graph","created_at":"2026-05-18T04:16: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"},"paper":{"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","authors_text":"Alex Scott, Matthew White","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-26T11:28:45Z","title":"Monochromatic cycles and the monochromatic circumference in 2-coloured graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5177","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:b287d71053c57c3b64ae103f56d09f76206cdc4f86580e1259c4113b32a86eb8","target":"record","created_at":"2026-05-18T04:16: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":"e34ab05fa69621db03fa91aa9d685cf5ea2be09c43519cd6eb538197e00e36cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-26T11:28:45Z","title_canon_sha256":"8fed52f8d422188718addb44c68546f8c4fb323a476d390e10a31538bb36dec4"},"schema_version":"1.0","source":{"id":"1107.5177","kind":"arxiv","version":1}},"canonical_sha256":"f68087b00dcb83e69a7eb16a7bb329eb743a26c8f23a3430a3f9d8424380b425","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f68087b00dcb83e69a7eb16a7bb329eb743a26c8f23a3430a3f9d8424380b425","first_computed_at":"2026-05-18T04:16:52.830470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:52.830470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SJKKA6bv5ZlTIQI+/mnO/rzUy2XdtNA/l7Xrr5rfYFlkT7jkMR3VNAi2exri+KgG16zEHYppl3XXo7eFmLdUBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:52.831138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5177","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b287d71053c57c3b64ae103f56d09f76206cdc4f86580e1259c4113b32a86eb8","sha256:83a295bdd8beeed7700cca886b62a311816a5c5f9aab5fbf0bc051ac47d242ed"],"state_sha256":"0ac6d31fd83afe123639053a69f25a3e0fb4312d0db58a0d290a3601b7920f69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YNwb/4GbJ13+Ml6WWZGDZh/T1EA9NR6CPqAE6tyZfz/DKSXING8IlZRHtEwsZgtN/SLxEcub1aOJxh0NJnETCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T02:39:04.735321Z","bundle_sha256":"9f449ea139b3391655b9d3be51013e450e228213853e3471021278cecb4238d3"}}