{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:PCC2Z4FPN4DTHQU5U56ZOFNRDS","short_pith_number":"pith:PCC2Z4FP","canonical_record":{"source":{"id":"2208.05829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-11T13:54:29Z","cross_cats_sorted":[],"title_canon_sha256":"12915dd9f4895eeeb9b592694c3bed26235c3de4f2c739ce23aead288708ece3","abstract_canon_sha256":"25004b79d9a6d21c6f60cc95788ab81282a147800b96eaa28c0a01591cb5dba9"},"schema_version":"1.0"},"canonical_sha256":"7885acf0af6f0733c29da77d9715b11cbeac3f3e5f1a56cb16d5610d2fde6fa6","source":{"kind":"arxiv","id":"2208.05829","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.05829","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"arxiv_version","alias_value":"2208.05829v2","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.05829","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"pith_short_12","alias_value":"PCC2Z4FPN4DT","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"pith_short_16","alias_value":"PCC2Z4FPN4DTHQU5","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"pith_short_8","alias_value":"PCC2Z4FP","created_at":"2026-07-05T10:07:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:PCC2Z4FPN4DTHQU5U56ZOFNRDS","target":"record","payload":{"canonical_record":{"source":{"id":"2208.05829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-11T13:54:29Z","cross_cats_sorted":[],"title_canon_sha256":"12915dd9f4895eeeb9b592694c3bed26235c3de4f2c739ce23aead288708ece3","abstract_canon_sha256":"25004b79d9a6d21c6f60cc95788ab81282a147800b96eaa28c0a01591cb5dba9"},"schema_version":"1.0"},"canonical_sha256":"7885acf0af6f0733c29da77d9715b11cbeac3f3e5f1a56cb16d5610d2fde6fa6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:00.230156Z","signature_b64":"yy4NxNJfjGMNZUCXDZ0fgGjOwYeZbOScjvzfUHHDo/+5yX5E8FSZhoRsJayvU9YW0cHJhG9bPHwc7e9H2NhqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7885acf0af6f0733c29da77d9715b11cbeac3f3e5f1a56cb16d5610d2fde6fa6","last_reissued_at":"2026-07-05T10:07:00.229697Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:00.229697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.05829","source_version":2,"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-05T10:07:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vyConsjhcdKXotHLLogYaBJa4eU75RXlTEaHq3eS09rJ8pT+JWdplWrPlxv0hc1Y+bQbUVs1yt15OviP1WxgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T12:55:35.803647Z"},"content_sha256":"316cc25c922d1888b55905f182a085cbe795061032515810a4adf23dca22652a","schema_version":"1.0","event_id":"sha256:316cc25c922d1888b55905f182a085cbe795061032515810a4adf23dca22652a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:PCC2Z4FPN4DTHQU5U56ZOFNRDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fan-complete Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fan Chung, Qizhong Lin","submitted_at":"2022-08-11T13:54:29Z","abstract_excerpt":"For graphs $G$ and $H$, we consider Ramsey numbers $r(G,H)$ with tight lower bounds, namely, $r(G,H) \\geq (\\chi(G)-1)(|H|-1)+1,$ where $\\chi(G)$ denotes the chromatic number of $G$ and $|H|$ denotes the number of vertices in $H$. We say $H$ is $G$-good if the equality holds.\n  Let $G+H$ be the join graph obtained from graphs $G$ and $H$ by adding all edges between the disjoint vertex sets of $G$ and $H$. Let $nH$ denote the union graph of $n$ disjoint copies of $H$. We show that $K_1+nH$ is $K_p$-good if $n$ is sufficiently large. In particular, the fan-graph $F_n=K_1 + n K_2$ is $K_p$-good if"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.05829","kind":"arxiv","version":2},"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/2208.05829/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-05T10:07:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+oSmPWmjHtea3oxcxt0NQ9up+/g0DPWWgDv5iMdOKzSekisPOjVq7vrnsHAru8U8Cer7osyZCriseED463JBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T12:55:35.804224Z"},"content_sha256":"4c91ed2c3b5934b6e7399ce6282c7d0bb458fa5b54a3537fff2212f33a300954","schema_version":"1.0","event_id":"sha256:4c91ed2c3b5934b6e7399ce6282c7d0bb458fa5b54a3537fff2212f33a300954"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCC2Z4FPN4DTHQU5U56ZOFNRDS/bundle.json","state_url":"https://pith.science/pith/PCC2Z4FPN4DTHQU5U56ZOFNRDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCC2Z4FPN4DTHQU5U56ZOFNRDS/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-08-12T12:55:35Z","links":{"resolver":"https://pith.science/pith/PCC2Z4FPN4DTHQU5U56ZOFNRDS","bundle":"https://pith.science/pith/PCC2Z4FPN4DTHQU5U56ZOFNRDS/bundle.json","state":"https://pith.science/pith/PCC2Z4FPN4DTHQU5U56ZOFNRDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCC2Z4FPN4DTHQU5U56ZOFNRDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:PCC2Z4FPN4DTHQU5U56ZOFNRDS","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":"25004b79d9a6d21c6f60cc95788ab81282a147800b96eaa28c0a01591cb5dba9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-11T13:54:29Z","title_canon_sha256":"12915dd9f4895eeeb9b592694c3bed26235c3de4f2c739ce23aead288708ece3"},"schema_version":"1.0","source":{"id":"2208.05829","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.05829","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"arxiv_version","alias_value":"2208.05829v2","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.05829","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"pith_short_12","alias_value":"PCC2Z4FPN4DT","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"pith_short_16","alias_value":"PCC2Z4FPN4DTHQU5","created_at":"2026-07-05T10:07:00Z"},{"alias_kind":"pith_short_8","alias_value":"PCC2Z4FP","created_at":"2026-07-05T10:07:00Z"}],"graph_snapshots":[{"event_id":"sha256:4c91ed2c3b5934b6e7399ce6282c7d0bb458fa5b54a3537fff2212f33a300954","target":"graph","created_at":"2026-07-05T10:07:00Z","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/2208.05829/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For graphs $G$ and $H$, we consider Ramsey numbers $r(G,H)$ with tight lower bounds, namely, $r(G,H) \\geq (\\chi(G)-1)(|H|-1)+1,$ where $\\chi(G)$ denotes the chromatic number of $G$ and $|H|$ denotes the number of vertices in $H$. We say $H$ is $G$-good if the equality holds.\n  Let $G+H$ be the join graph obtained from graphs $G$ and $H$ by adding all edges between the disjoint vertex sets of $G$ and $H$. Let $nH$ denote the union graph of $n$ disjoint copies of $H$. We show that $K_1+nH$ is $K_p$-good if $n$ is sufficiently large. In particular, the fan-graph $F_n=K_1 + n K_2$ is $K_p$-good if","authors_text":"Fan Chung, Qizhong Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-11T13:54:29Z","title":"Fan-complete Ramsey numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.05829","kind":"arxiv","version":2},"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:316cc25c922d1888b55905f182a085cbe795061032515810a4adf23dca22652a","target":"record","created_at":"2026-07-05T10:07:00Z","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":"25004b79d9a6d21c6f60cc95788ab81282a147800b96eaa28c0a01591cb5dba9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-08-11T13:54:29Z","title_canon_sha256":"12915dd9f4895eeeb9b592694c3bed26235c3de4f2c739ce23aead288708ece3"},"schema_version":"1.0","source":{"id":"2208.05829","kind":"arxiv","version":2}},"canonical_sha256":"7885acf0af6f0733c29da77d9715b11cbeac3f3e5f1a56cb16d5610d2fde6fa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7885acf0af6f0733c29da77d9715b11cbeac3f3e5f1a56cb16d5610d2fde6fa6","first_computed_at":"2026-07-05T10:07:00.229697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:07:00.229697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yy4NxNJfjGMNZUCXDZ0fgGjOwYeZbOScjvzfUHHDo/+5yX5E8FSZhoRsJayvU9YW0cHJhG9bPHwc7e9H2NhqBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:07:00.230156Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.05829","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:316cc25c922d1888b55905f182a085cbe795061032515810a4adf23dca22652a","sha256:4c91ed2c3b5934b6e7399ce6282c7d0bb458fa5b54a3537fff2212f33a300954"],"state_sha256":"58ea461b05d05c87bc28b9d9a9704a2c9da620b6c09da4cacb05eab12b1bb05e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmSmuy3ERENcbHTMxhAS4ZzPVR3FhZbCR0Qgax8LPZuQI46OHbvTZd7sbTmh/MooBECEvwAJ0LP6mS0KEErwDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T12:55:35.809897Z","bundle_sha256":"71273d523ddc653e93ee9bbc79666f35529e793e7768f629b3c773d836ad7960"}}