{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MMG7OQZMFYUDJ4XQAVXQEP44TY","short_pith_number":"pith:MMG7OQZM","canonical_record":{"source":{"id":"1807.11890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-31T16:06:50Z","cross_cats_sorted":[],"title_canon_sha256":"1ee10ed672ec208818c580a9616cc1e6329b68d2f0a294b33cf0d7915450e187","abstract_canon_sha256":"60d654641d6420c6ba7c39aee57bb383f3d8c3cd6a82ce2084f5919258406cf8"},"schema_version":"1.0"},"canonical_sha256":"630df7432c2e2834f2f0056f023f9c9e1867d041ff6e7043b27217eea7e31bff","source":{"kind":"arxiv","id":"1807.11890","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11890","created_at":"2026-05-18T00:09:20Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11890v1","created_at":"2026-05-18T00:09:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11890","created_at":"2026-05-18T00:09:20Z"},{"alias_kind":"pith_short_12","alias_value":"MMG7OQZMFYUD","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MMG7OQZMFYUDJ4XQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MMG7OQZM","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MMG7OQZMFYUDJ4XQAVXQEP44TY","target":"record","payload":{"canonical_record":{"source":{"id":"1807.11890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-31T16:06:50Z","cross_cats_sorted":[],"title_canon_sha256":"1ee10ed672ec208818c580a9616cc1e6329b68d2f0a294b33cf0d7915450e187","abstract_canon_sha256":"60d654641d6420c6ba7c39aee57bb383f3d8c3cd6a82ce2084f5919258406cf8"},"schema_version":"1.0"},"canonical_sha256":"630df7432c2e2834f2f0056f023f9c9e1867d041ff6e7043b27217eea7e31bff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:20.830967Z","signature_b64":"ng3ekbHvx50CBk2G2Py/Baq7T5LT8rPVtQA78bKs/vjA+DK3UEEuSE3k3OIBh1GbD4Vm3S9L2hSWKw0YjsjjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"630df7432c2e2834f2f0056f023f9c9e1867d041ff6e7043b27217eea7e31bff","last_reissued_at":"2026-05-18T00:09:20.830404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:20.830404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.11890","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-18T00:09:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1mYlIxKcjHkP5dRxAJU7twUzcEyYrt6hNixFNyc4tN4AKvPXPAQ3WzFcrtAsNDg+8zoRrGJjs2M3TdZGnbx9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:54:14.975638Z"},"content_sha256":"6edddee125a3c05d21c2f8ed1e3694d0f5755b1ddfbcfe672fdac16f20696cc5","schema_version":"1.0","event_id":"sha256:6edddee125a3c05d21c2f8ed1e3694d0f5755b1ddfbcfe672fdac16f20696cc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MMG7OQZMFYUDJ4XQAVXQEP44TY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal Ramsey graphs for cyclicity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anusch Taraz, Damian Reding","submitted_at":"2018-07-31T16:06:50Z","abstract_excerpt":"We study graphs with the property that every edge-colouring admits a monochromatic cycle (the length of which may depend freely on the colouring) and describe those graphs that are minimal with this property. We show that every member in this class reduces recursively to one of the base graphs $K_5-e$ or $K_4\\vee K_4$ (two copies of $K_4$ identified at an edge), which implies that an arbitrary $n$-vertex graph with $e(G)\\geq 2n-1$ must contain one of those as a minor. We also describe three explicit constructions governing the reverse process. As an application we are able to establish Ramsey "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11890","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-18T00:09:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzThHNKeKfloSmil/xNhZe0vwvsnhr5x0s7g28K04RQxGBenbmjpEYd07z0OiQl7dU37NHn3OzGpE7jgGOnYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:54:14.975990Z"},"content_sha256":"921412f9a88cea279f351ca20b5b1aa42f797ad6f306dc55d57de362ca7e1f30","schema_version":"1.0","event_id":"sha256:921412f9a88cea279f351ca20b5b1aa42f797ad6f306dc55d57de362ca7e1f30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMG7OQZMFYUDJ4XQAVXQEP44TY/bundle.json","state_url":"https://pith.science/pith/MMG7OQZMFYUDJ4XQAVXQEP44TY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMG7OQZMFYUDJ4XQAVXQEP44TY/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-05-30T06:54:14Z","links":{"resolver":"https://pith.science/pith/MMG7OQZMFYUDJ4XQAVXQEP44TY","bundle":"https://pith.science/pith/MMG7OQZMFYUDJ4XQAVXQEP44TY/bundle.json","state":"https://pith.science/pith/MMG7OQZMFYUDJ4XQAVXQEP44TY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMG7OQZMFYUDJ4XQAVXQEP44TY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MMG7OQZMFYUDJ4XQAVXQEP44TY","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":"60d654641d6420c6ba7c39aee57bb383f3d8c3cd6a82ce2084f5919258406cf8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-31T16:06:50Z","title_canon_sha256":"1ee10ed672ec208818c580a9616cc1e6329b68d2f0a294b33cf0d7915450e187"},"schema_version":"1.0","source":{"id":"1807.11890","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11890","created_at":"2026-05-18T00:09:20Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11890v1","created_at":"2026-05-18T00:09:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11890","created_at":"2026-05-18T00:09:20Z"},{"alias_kind":"pith_short_12","alias_value":"MMG7OQZMFYUD","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MMG7OQZMFYUDJ4XQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MMG7OQZM","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:921412f9a88cea279f351ca20b5b1aa42f797ad6f306dc55d57de362ca7e1f30","target":"graph","created_at":"2026-05-18T00:09:20Z","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":"We study graphs with the property that every edge-colouring admits a monochromatic cycle (the length of which may depend freely on the colouring) and describe those graphs that are minimal with this property. We show that every member in this class reduces recursively to one of the base graphs $K_5-e$ or $K_4\\vee K_4$ (two copies of $K_4$ identified at an edge), which implies that an arbitrary $n$-vertex graph with $e(G)\\geq 2n-1$ must contain one of those as a minor. We also describe three explicit constructions governing the reverse process. As an application we are able to establish Ramsey ","authors_text":"Anusch Taraz, Damian Reding","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-31T16:06:50Z","title":"Minimal Ramsey graphs for cyclicity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11890","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:6edddee125a3c05d21c2f8ed1e3694d0f5755b1ddfbcfe672fdac16f20696cc5","target":"record","created_at":"2026-05-18T00:09:20Z","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":"60d654641d6420c6ba7c39aee57bb383f3d8c3cd6a82ce2084f5919258406cf8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-31T16:06:50Z","title_canon_sha256":"1ee10ed672ec208818c580a9616cc1e6329b68d2f0a294b33cf0d7915450e187"},"schema_version":"1.0","source":{"id":"1807.11890","kind":"arxiv","version":1}},"canonical_sha256":"630df7432c2e2834f2f0056f023f9c9e1867d041ff6e7043b27217eea7e31bff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"630df7432c2e2834f2f0056f023f9c9e1867d041ff6e7043b27217eea7e31bff","first_computed_at":"2026-05-18T00:09:20.830404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:20.830404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ng3ekbHvx50CBk2G2Py/Baq7T5LT8rPVtQA78bKs/vjA+DK3UEEuSE3k3OIBh1GbD4Vm3S9L2hSWKw0YjsjjDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:20.830967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.11890","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6edddee125a3c05d21c2f8ed1e3694d0f5755b1ddfbcfe672fdac16f20696cc5","sha256:921412f9a88cea279f351ca20b5b1aa42f797ad6f306dc55d57de362ca7e1f30"],"state_sha256":"18e53f9e7df6f8f7c61c8106741ec921ddea14a44ffce000d59852ca78a9f0ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gVWivRzhEfJ//BH0pf1En5A/p5kIF4Ti1E3n7SJMNR2yaBhRm9h75O2TwV1snflfmLTMhKDj91ORFIJIVtb1Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:54:14.978441Z","bundle_sha256":"6f2b8a0085825a21b89290c521870216f6f213492e97a00f79c0a876f3704b0a"}}