{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MEN4THR7A4PGEWMR3XPDFZDJMW","short_pith_number":"pith:MEN4THR7","canonical_record":{"source":{"id":"1712.03226","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-08T03:34:12Z","cross_cats_sorted":[],"title_canon_sha256":"152ff42199f0da95d6d74f40a5f836790f7dea8fd557519dae33e973d36aba12","abstract_canon_sha256":"eb6ca18fe0679c6800d8dafc88fa4dffc8d6c5affedb393407085fe3fdf1954d"},"schema_version":"1.0"},"canonical_sha256":"611bc99e3f071e625991ddde32e469659b1699a9d13f8ddc4e756d1166aeddf3","source":{"kind":"arxiv","id":"1712.03226","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03226","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03226v5","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03226","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"pith_short_12","alias_value":"MEN4THR7A4PG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MEN4THR7A4PGEWMR","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MEN4THR7","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MEN4THR7A4PGEWMR3XPDFZDJMW","target":"record","payload":{"canonical_record":{"source":{"id":"1712.03226","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-08T03:34:12Z","cross_cats_sorted":[],"title_canon_sha256":"152ff42199f0da95d6d74f40a5f836790f7dea8fd557519dae33e973d36aba12","abstract_canon_sha256":"eb6ca18fe0679c6800d8dafc88fa4dffc8d6c5affedb393407085fe3fdf1954d"},"schema_version":"1.0"},"canonical_sha256":"611bc99e3f071e625991ddde32e469659b1699a9d13f8ddc4e756d1166aeddf3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:22.824402Z","signature_b64":"z35hfzNZrnIWWUHzybGqcr4WbkiUkkdjVcz/9xuDhjfGZWqH1m+1w0iXeG+BI2H4v3tifBFOx4TRJTXDoJtaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"611bc99e3f071e625991ddde32e469659b1699a9d13f8ddc4e756d1166aeddf3","last_reissued_at":"2026-05-17T23:48:22.823947Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:22.823947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.03226","source_version":5,"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-17T23:48:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/ZrmkjQHj4s/7V5BWZtrLIRNVVBJq87gzC0WO8V01QnkjhjozkvkR8zh0waLS/T3bQK2+qJ6sEqCMXE6vPEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:18:25.106150Z"},"content_sha256":"4d0716b1fba4d366759fe4a7af20bbe19d06f52844938f2c7d933cdcede2e48d","schema_version":"1.0","event_id":"sha256:4d0716b1fba4d366759fe4a7af20bbe19d06f52844938f2c7d933cdcede2e48d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MEN4THR7A4PGEWMR3XPDFZDJMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Redundant edges in Ramsey graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yan Li, Ye Wang, Yusheng Li","submitted_at":"2017-12-08T03:34:12Z","abstract_excerpt":"For graphs $G$, $F$ and $H$, let $G\\rightarrow (F,H)$ signify that any edge coloring of $G$ in red and blue contains a red $F$ or a blue $H$. The Ramsey number $R(F,H)=\\min\\{r|\\; K_r\\rightarrow (F,H)\\}$. In this note, we consider redundant edges in Ramsey graphs, which are associate with critical Ramsey numbers. For an integer $k\\ge 1$, let ${\\mathbb G}=\\{G_k,G_{k+1},\\dots \\}$ be a class of graphs with $\\delta(G_n)\\ge 1$. We define the critical Ramsey number $R_{\\mathbb G}(F,H)$ with respect to $\\mathbb G$ to be $\\max\\{n|\\; K_r\\setminus G_n \\rightarrow(F,H),\\,G_n\\in{\\mathbb G}\\big\\}$, where $r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03226","kind":"arxiv","version":5},"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-17T23:48:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xDr+xBEOHKl1LzuPT8r8s9PswofcrIUlH12VXLzBG0YPygXeUQX/8pErjVSsQxRRr+cIOohhVFOxf4/UeW2YCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:18:25.106842Z"},"content_sha256":"beea7e27164bdd5127ff3e381215908986d9b2d0b28b5da62cd04074cb090ddb","schema_version":"1.0","event_id":"sha256:beea7e27164bdd5127ff3e381215908986d9b2d0b28b5da62cd04074cb090ddb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MEN4THR7A4PGEWMR3XPDFZDJMW/bundle.json","state_url":"https://pith.science/pith/MEN4THR7A4PGEWMR3XPDFZDJMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MEN4THR7A4PGEWMR3XPDFZDJMW/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-06-08T05:18:25Z","links":{"resolver":"https://pith.science/pith/MEN4THR7A4PGEWMR3XPDFZDJMW","bundle":"https://pith.science/pith/MEN4THR7A4PGEWMR3XPDFZDJMW/bundle.json","state":"https://pith.science/pith/MEN4THR7A4PGEWMR3XPDFZDJMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MEN4THR7A4PGEWMR3XPDFZDJMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MEN4THR7A4PGEWMR3XPDFZDJMW","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":"eb6ca18fe0679c6800d8dafc88fa4dffc8d6c5affedb393407085fe3fdf1954d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-08T03:34:12Z","title_canon_sha256":"152ff42199f0da95d6d74f40a5f836790f7dea8fd557519dae33e973d36aba12"},"schema_version":"1.0","source":{"id":"1712.03226","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03226","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03226v5","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03226","created_at":"2026-05-17T23:48:22Z"},{"alias_kind":"pith_short_12","alias_value":"MEN4THR7A4PG","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MEN4THR7A4PGEWMR","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MEN4THR7","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:beea7e27164bdd5127ff3e381215908986d9b2d0b28b5da62cd04074cb090ddb","target":"graph","created_at":"2026-05-17T23:48:22Z","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":"For graphs $G$, $F$ and $H$, let $G\\rightarrow (F,H)$ signify that any edge coloring of $G$ in red and blue contains a red $F$ or a blue $H$. The Ramsey number $R(F,H)=\\min\\{r|\\; K_r\\rightarrow (F,H)\\}$. In this note, we consider redundant edges in Ramsey graphs, which are associate with critical Ramsey numbers. For an integer $k\\ge 1$, let ${\\mathbb G}=\\{G_k,G_{k+1},\\dots \\}$ be a class of graphs with $\\delta(G_n)\\ge 1$. We define the critical Ramsey number $R_{\\mathbb G}(F,H)$ with respect to $\\mathbb G$ to be $\\max\\{n|\\; K_r\\setminus G_n \\rightarrow(F,H),\\,G_n\\in{\\mathbb G}\\big\\}$, where $r","authors_text":"Yan Li, Ye Wang, Yusheng Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-08T03:34:12Z","title":"Redundant edges in Ramsey graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03226","kind":"arxiv","version":5},"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:4d0716b1fba4d366759fe4a7af20bbe19d06f52844938f2c7d933cdcede2e48d","target":"record","created_at":"2026-05-17T23:48:22Z","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":"eb6ca18fe0679c6800d8dafc88fa4dffc8d6c5affedb393407085fe3fdf1954d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-08T03:34:12Z","title_canon_sha256":"152ff42199f0da95d6d74f40a5f836790f7dea8fd557519dae33e973d36aba12"},"schema_version":"1.0","source":{"id":"1712.03226","kind":"arxiv","version":5}},"canonical_sha256":"611bc99e3f071e625991ddde32e469659b1699a9d13f8ddc4e756d1166aeddf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"611bc99e3f071e625991ddde32e469659b1699a9d13f8ddc4e756d1166aeddf3","first_computed_at":"2026-05-17T23:48:22.823947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:22.823947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z35hfzNZrnIWWUHzybGqcr4WbkiUkkdjVcz/9xuDhjfGZWqH1m+1w0iXeG+BI2H4v3tifBFOx4TRJTXDoJtaCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:22.824402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03226","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d0716b1fba4d366759fe4a7af20bbe19d06f52844938f2c7d933cdcede2e48d","sha256:beea7e27164bdd5127ff3e381215908986d9b2d0b28b5da62cd04074cb090ddb"],"state_sha256":"3fb4351ebf544ca056af3b52b4fdaf15ef35207f86b89f03057ff2510864a5a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oe/HhTqrtqZu2gXntMhJR+qt/88qREYm/h55AOjJxq0eUD3UNlRdE3Jf1ASxjzbYF0co2OmlqELW31FiBTtECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:18:25.110574Z","bundle_sha256":"70c1f5ec00bc57b332da37cf73de619f936541737d65eaae6636b66750dffa65"}}