{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:D5SH5OG2F545SJNRTEDTWG7R5X","short_pith_number":"pith:D5SH5OG2","canonical_record":{"source":{"id":"2109.02877","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-07T05:26:45Z","cross_cats_sorted":[],"title_canon_sha256":"6efa6dc040961747d7fbb800a45f0c986e0d343836ed7df3f08cefae748ec717","abstract_canon_sha256":"29e9fde4f2e6c58536cd0aef28c5fdc43995c5585613c5ba7804e490e7cf399d"},"schema_version":"1.0"},"canonical_sha256":"1f647eb8da2f79d925b199073b1bf1edd56dbd957823028637669b3bdfe181ef","source":{"kind":"arxiv","id":"2109.02877","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.02877","created_at":"2026-07-05T03:12:20Z"},{"alias_kind":"arxiv_version","alias_value":"2109.02877v1","created_at":"2026-07-05T03:12:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.02877","created_at":"2026-07-05T03:12:20Z"},{"alias_kind":"pith_short_12","alias_value":"D5SH5OG2F545","created_at":"2026-07-05T03:12:20Z"},{"alias_kind":"pith_short_16","alias_value":"D5SH5OG2F545SJNR","created_at":"2026-07-05T03:12:20Z"},{"alias_kind":"pith_short_8","alias_value":"D5SH5OG2","created_at":"2026-07-05T03:12:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:D5SH5OG2F545SJNRTEDTWG7R5X","target":"record","payload":{"canonical_record":{"source":{"id":"2109.02877","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-07T05:26:45Z","cross_cats_sorted":[],"title_canon_sha256":"6efa6dc040961747d7fbb800a45f0c986e0d343836ed7df3f08cefae748ec717","abstract_canon_sha256":"29e9fde4f2e6c58536cd0aef28c5fdc43995c5585613c5ba7804e490e7cf399d"},"schema_version":"1.0"},"canonical_sha256":"1f647eb8da2f79d925b199073b1bf1edd56dbd957823028637669b3bdfe181ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:12:20.626421Z","signature_b64":"fwTpmmG+4jpgx8O5CYqmjybEJGIZiZlfHebY4GO72bkiSbeqOFaFv3oe2Hb4SThllwMtCN0HT46bz6eOF+l4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f647eb8da2f79d925b199073b1bf1edd56dbd957823028637669b3bdfe181ef","last_reissued_at":"2026-07-05T03:12:20.626004Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:12:20.626004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.02877","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-07-05T03:12:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1eI5lQqZqs8fvhVb9P5+UPL69FidzLYK2zfnhcCCzkGm+7i+KaoPl59wK/PdK264ev+o88otnjqRKx8DvhWBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T00:55:38.159259Z"},"content_sha256":"82ea67f7ada7c6d4f56cb5b8e84599447f2dc76373e90900444cd400cf0dae3b","schema_version":"1.0","event_id":"sha256:82ea67f7ada7c6d4f56cb5b8e84599447f2dc76373e90900444cd400cf0dae3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:D5SH5OG2F545SJNRTEDTWG7R5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the minimum degree of minimal Ramsey graphs for cliques versus cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anita Liebenau, Anurag Bishnoi, Dennis Clemens, Pranshu Gupta, Simona Boyadzhiyska, Thomas Lesgourgues","submitted_at":"2021-09-07T05:26:45Z","abstract_excerpt":"A graph $G$ is said to be $q$-Ramsey for a $q$-tuple of graphs $(H_1,\\ldots,H_q)$, denoted by $G\\to_q(H_1,\\ldots,H_q)$, if every $q$-edge-coloring of $G$ contains a monochromatic copy of $H_i$ in color $i,$ for some $i\\in[q]$. Let $s_q(H_1,\\ldots,H_q)$ denote the smallest minimum degree of $G$ over all graphs $G$ that are minimal $q$-Ramsey for $(H_1,\\ldots,H_q)$ (with respect to subgraph inclusion). The study of this parameter was initiated in 1976 by Burr, Erd\\H{o}s and Lov\\'asz, who determined its value precisely for a pair of cliques. Over the past two decades the parameter $s_q$ has been "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.02877","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/2109.02877/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"},"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-07-05T03:12:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KAaYyTxl0HZ/3XlFJExCnA0AovTv/5pA72qzNrxjNuUZC18C0gsFVHbukd9UySC107vyfEZSzKXsnnkKm3weDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T00:55:38.159999Z"},"content_sha256":"415a9aa36da5c440f8db3b222c742ef0968a080841bdb0fe70b0f3c0a289b9e1","schema_version":"1.0","event_id":"sha256:415a9aa36da5c440f8db3b222c742ef0968a080841bdb0fe70b0f3c0a289b9e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5SH5OG2F545SJNRTEDTWG7R5X/bundle.json","state_url":"https://pith.science/pith/D5SH5OG2F545SJNRTEDTWG7R5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5SH5OG2F545SJNRTEDTWG7R5X/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-12T00:55:38Z","links":{"resolver":"https://pith.science/pith/D5SH5OG2F545SJNRTEDTWG7R5X","bundle":"https://pith.science/pith/D5SH5OG2F545SJNRTEDTWG7R5X/bundle.json","state":"https://pith.science/pith/D5SH5OG2F545SJNRTEDTWG7R5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5SH5OG2F545SJNRTEDTWG7R5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:D5SH5OG2F545SJNRTEDTWG7R5X","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":"29e9fde4f2e6c58536cd0aef28c5fdc43995c5585613c5ba7804e490e7cf399d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-07T05:26:45Z","title_canon_sha256":"6efa6dc040961747d7fbb800a45f0c986e0d343836ed7df3f08cefae748ec717"},"schema_version":"1.0","source":{"id":"2109.02877","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.02877","created_at":"2026-07-05T03:12:20Z"},{"alias_kind":"arxiv_version","alias_value":"2109.02877v1","created_at":"2026-07-05T03:12:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.02877","created_at":"2026-07-05T03:12:20Z"},{"alias_kind":"pith_short_12","alias_value":"D5SH5OG2F545","created_at":"2026-07-05T03:12:20Z"},{"alias_kind":"pith_short_16","alias_value":"D5SH5OG2F545SJNR","created_at":"2026-07-05T03:12:20Z"},{"alias_kind":"pith_short_8","alias_value":"D5SH5OG2","created_at":"2026-07-05T03:12:20Z"}],"graph_snapshots":[{"event_id":"sha256:415a9aa36da5c440f8db3b222c742ef0968a080841bdb0fe70b0f3c0a289b9e1","target":"graph","created_at":"2026-07-05T03:12: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2109.02877/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is said to be $q$-Ramsey for a $q$-tuple of graphs $(H_1,\\ldots,H_q)$, denoted by $G\\to_q(H_1,\\ldots,H_q)$, if every $q$-edge-coloring of $G$ contains a monochromatic copy of $H_i$ in color $i,$ for some $i\\in[q]$. Let $s_q(H_1,\\ldots,H_q)$ denote the smallest minimum degree of $G$ over all graphs $G$ that are minimal $q$-Ramsey for $(H_1,\\ldots,H_q)$ (with respect to subgraph inclusion). The study of this parameter was initiated in 1976 by Burr, Erd\\H{o}s and Lov\\'asz, who determined its value precisely for a pair of cliques. Over the past two decades the parameter $s_q$ has been ","authors_text":"Anita Liebenau, Anurag Bishnoi, Dennis Clemens, Pranshu Gupta, Simona Boyadzhiyska, Thomas Lesgourgues","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-07T05:26:45Z","title":"On the minimum degree of minimal Ramsey graphs for cliques versus cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.02877","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:82ea67f7ada7c6d4f56cb5b8e84599447f2dc76373e90900444cd400cf0dae3b","target":"record","created_at":"2026-07-05T03:12: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":"29e9fde4f2e6c58536cd0aef28c5fdc43995c5585613c5ba7804e490e7cf399d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-07T05:26:45Z","title_canon_sha256":"6efa6dc040961747d7fbb800a45f0c986e0d343836ed7df3f08cefae748ec717"},"schema_version":"1.0","source":{"id":"2109.02877","kind":"arxiv","version":1}},"canonical_sha256":"1f647eb8da2f79d925b199073b1bf1edd56dbd957823028637669b3bdfe181ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f647eb8da2f79d925b199073b1bf1edd56dbd957823028637669b3bdfe181ef","first_computed_at":"2026-07-05T03:12:20.626004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:12:20.626004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fwTpmmG+4jpgx8O5CYqmjybEJGIZiZlfHebY4GO72bkiSbeqOFaFv3oe2Hb4SThllwMtCN0HT46bz6eOF+l4Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:12:20.626421Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.02877","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82ea67f7ada7c6d4f56cb5b8e84599447f2dc76373e90900444cd400cf0dae3b","sha256:415a9aa36da5c440f8db3b222c742ef0968a080841bdb0fe70b0f3c0a289b9e1"],"state_sha256":"72f7aad9dfbea6414d3d5ecfbba6a5484681954e5c92c665128edd1665effa52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LOsZunf9AdaQbnVp2szT0/CqDAXNp24dKWC+Bxs9gsOO/igd+u0sgDZbT/pPS4IU74H/r6bly8PJkUvCwksAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T00:55:38.164045Z","bundle_sha256":"aad18e15bdda9efb5f4aa99a0baec278fe3cc57680e9e71edd2b6ede83d27301"}}