{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VIVVNOR4K266KYPL5KDWYKG3ZD","short_pith_number":"pith:VIVVNOR4","schema_version":"1.0","canonical_sha256":"aa2b56ba3c56bde561ebea876c28dbc8c8cec19eb6323d8db98fca0a988cd2de","source":{"kind":"arxiv","id":"2605.20949","version":1},"attestation_state":"computed","paper":{"title":"A note on hypergraphs with asymmetric Ramsey properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Vladimir Sviridenkov","submitted_at":"2026-05-20T09:37:19Z","abstract_excerpt":"Let $r,\\ell\\geq2$ be integers. Given $r$-graphs $G$ and $F_1,\\dots,F_\\ell$, we write $G\\to(F_1,\\dots,F_\\ell)$ if every $\\ell$-edge-coloring of $G$ yields a monochromatic copy of $F_i$ in the $i$th color for some $1\\leq i\\leq\\ell$, otherwise we write $G\\not\\to(F_1,\\dots,F_\\ell)$. The Ramsey number $R(F_1,\\dots,F_\\ell)$ is the minimum number of vertices in an $r$-graph $G$ satisfying $G\\to(F_1,\\dots,F_\\ell)$. In this note we prove that for any integers $t_1\\geq\\dots\\geq t_\\ell>r$, there exists an $r$-graph $G$ such that $G\\not\\to(K^{(r)}_{t_1},\\dots,K^{(r)}_{t_\\ell})$ but $G\\to(K^{(r)}_s,K^{(r)}"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.20949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T09:37:19Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"211735de09b2fef695e55e95fd80600948f03b683ac2bc16941bed309e027a22","abstract_canon_sha256":"745193ccb0f203a750062f6040673240c622af299c308c06508c38961e318eac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:29.418659Z","signature_b64":"Ot0OIXB/xjcUAMPmx1TF3jRpUMLxR4A0akKBkVY2+AVnauRnKQZ2//zuM3KkYDtY3Zkq8CJmN7qct3606Ww8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa2b56ba3c56bde561ebea876c28dbc8c8cec19eb6323d8db98fca0a988cd2de","last_reissued_at":"2026-05-21T01:05:29.417883Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:29.417883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on hypergraphs with asymmetric Ramsey properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Vladimir Sviridenkov","submitted_at":"2026-05-20T09:37:19Z","abstract_excerpt":"Let $r,\\ell\\geq2$ be integers. Given $r$-graphs $G$ and $F_1,\\dots,F_\\ell$, we write $G\\to(F_1,\\dots,F_\\ell)$ if every $\\ell$-edge-coloring of $G$ yields a monochromatic copy of $F_i$ in the $i$th color for some $1\\leq i\\leq\\ell$, otherwise we write $G\\not\\to(F_1,\\dots,F_\\ell)$. The Ramsey number $R(F_1,\\dots,F_\\ell)$ is the minimum number of vertices in an $r$-graph $G$ satisfying $G\\to(F_1,\\dots,F_\\ell)$. In this note we prove that for any integers $t_1\\geq\\dots\\geq t_\\ell>r$, there exists an $r$-graph $G$ such that $G\\not\\to(K^{(r)}_{t_1},\\dots,K^{(r)}_{t_\\ell})$ but $G\\to(K^{(r)}_s,K^{(r)}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20949","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/2605.20949/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.20949","created_at":"2026-05-21T01:05:29.418007+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20949v1","created_at":"2026-05-21T01:05:29.418007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20949","created_at":"2026-05-21T01:05:29.418007+00:00"},{"alias_kind":"pith_short_12","alias_value":"VIVVNOR4K266","created_at":"2026-05-21T01:05:29.418007+00:00"},{"alias_kind":"pith_short_16","alias_value":"VIVVNOR4K266KYPL","created_at":"2026-05-21T01:05:29.418007+00:00"},{"alias_kind":"pith_short_8","alias_value":"VIVVNOR4","created_at":"2026-05-21T01:05:29.418007+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VIVVNOR4K266KYPL5KDWYKG3ZD","json":"https://pith.science/pith/VIVVNOR4K266KYPL5KDWYKG3ZD.json","graph_json":"https://pith.science/api/pith-number/VIVVNOR4K266KYPL5KDWYKG3ZD/graph.json","events_json":"https://pith.science/api/pith-number/VIVVNOR4K266KYPL5KDWYKG3ZD/events.json","paper":"https://pith.science/paper/VIVVNOR4"},"agent_actions":{"view_html":"https://pith.science/pith/VIVVNOR4K266KYPL5KDWYKG3ZD","download_json":"https://pith.science/pith/VIVVNOR4K266KYPL5KDWYKG3ZD.json","view_paper":"https://pith.science/paper/VIVVNOR4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20949&json=true","fetch_graph":"https://pith.science/api/pith-number/VIVVNOR4K266KYPL5KDWYKG3ZD/graph.json","fetch_events":"https://pith.science/api/pith-number/VIVVNOR4K266KYPL5KDWYKG3ZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VIVVNOR4K266KYPL5KDWYKG3ZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VIVVNOR4K266KYPL5KDWYKG3ZD/action/storage_attestation","attest_author":"https://pith.science/pith/VIVVNOR4K266KYPL5KDWYKG3ZD/action/author_attestation","sign_citation":"https://pith.science/pith/VIVVNOR4K266KYPL5KDWYKG3ZD/action/citation_signature","submit_replication":"https://pith.science/pith/VIVVNOR4K266KYPL5KDWYKG3ZD/action/replication_record"}},"created_at":"2026-05-21T01:05:29.418007+00:00","updated_at":"2026-05-21T01:05:29.418007+00:00"}