{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VIVVNOR4K266KYPL5KDWYKG3ZD","short_pith_number":"pith:VIVVNOR4","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"},"canonical_sha256":"aa2b56ba3c56bde561ebea876c28dbc8c8cec19eb6323d8db98fca0a988cd2de","source":{"kind":"arxiv","id":"2605.20949","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20949","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20949v1","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20949","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"pith_short_12","alias_value":"VIVVNOR4K266","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"pith_short_16","alias_value":"VIVVNOR4K266KYPL","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"pith_short_8","alias_value":"VIVVNOR4","created_at":"2026-05-21T01:05:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VIVVNOR4K266KYPL5KDWYKG3ZD","target":"record","payload":{"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"},"canonical_sha256":"aa2b56ba3c56bde561ebea876c28dbc8c8cec19eb6323d8db98fca0a988cd2de","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"},"source_kind":"arxiv","source_id":"2605.20949","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-21T01:05:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qign35AIcUhhAFQX0IBNV1nlJHlcBNgdyFpjPnDpsDi2C/o6DN7GsQ/mHTjG9Wa2rpFFBeOX8EmBMSY7bhyEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:02:06.926286Z"},"content_sha256":"458cfa16a3b27d335c91c97bb0e16ece8af7ede42b529aae3098aed97c8ca582","schema_version":"1.0","event_id":"sha256:458cfa16a3b27d335c91c97bb0e16ece8af7ede42b529aae3098aed97c8ca582"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VIVVNOR4K266KYPL5KDWYKG3ZD","target":"graph","payload":{"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"},"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-21T01:05:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ycKDirEQawFR7PYDozPHXXCN8/9KyQ8cWNW/y22tujnJC2ZEZgvv71kG6BPqWAecOCJB6MXIMcJV5QJjYmhEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:02:06.927012Z"},"content_sha256":"23a869c53e7d10895f1ba4933401e1af6ff4dc51a5eba1a73a78e384f4e9fb25","schema_version":"1.0","event_id":"sha256:23a869c53e7d10895f1ba4933401e1af6ff4dc51a5eba1a73a78e384f4e9fb25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIVVNOR4K266KYPL5KDWYKG3ZD/bundle.json","state_url":"https://pith.science/pith/VIVVNOR4K266KYPL5KDWYKG3ZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIVVNOR4K266KYPL5KDWYKG3ZD/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-22T21:02:06Z","links":{"resolver":"https://pith.science/pith/VIVVNOR4K266KYPL5KDWYKG3ZD","bundle":"https://pith.science/pith/VIVVNOR4K266KYPL5KDWYKG3ZD/bundle.json","state":"https://pith.science/pith/VIVVNOR4K266KYPL5KDWYKG3ZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIVVNOR4K266KYPL5KDWYKG3ZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VIVVNOR4K266KYPL5KDWYKG3ZD","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":"745193ccb0f203a750062f6040673240c622af299c308c06508c38961e318eac","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T09:37:19Z","title_canon_sha256":"211735de09b2fef695e55e95fd80600948f03b683ac2bc16941bed309e027a22"},"schema_version":"1.0","source":{"id":"2605.20949","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20949","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20949v1","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20949","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"pith_short_12","alias_value":"VIVVNOR4K266","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"pith_short_16","alias_value":"VIVVNOR4K266KYPL","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"pith_short_8","alias_value":"VIVVNOR4","created_at":"2026-05-21T01:05:29Z"}],"graph_snapshots":[{"event_id":"sha256:23a869c53e7d10895f1ba4933401e1af6ff4dc51a5eba1a73a78e384f4e9fb25","target":"graph","created_at":"2026-05-21T01:05:29Z","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/2605.20949/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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)}","authors_text":"Vladimir Sviridenkov","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T09:37:19Z","title":"A note on hypergraphs with asymmetric Ramsey properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20949","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:458cfa16a3b27d335c91c97bb0e16ece8af7ede42b529aae3098aed97c8ca582","target":"record","created_at":"2026-05-21T01:05:29Z","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":"745193ccb0f203a750062f6040673240c622af299c308c06508c38961e318eac","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T09:37:19Z","title_canon_sha256":"211735de09b2fef695e55e95fd80600948f03b683ac2bc16941bed309e027a22"},"schema_version":"1.0","source":{"id":"2605.20949","kind":"arxiv","version":1}},"canonical_sha256":"aa2b56ba3c56bde561ebea876c28dbc8c8cec19eb6323d8db98fca0a988cd2de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa2b56ba3c56bde561ebea876c28dbc8c8cec19eb6323d8db98fca0a988cd2de","first_computed_at":"2026-05-21T01:05:29.417883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:29.417883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ot0OIXB/xjcUAMPmx1TF3jRpUMLxR4A0akKBkVY2+AVnauRnKQZ2//zuM3KkYDtY3Zkq8CJmN7qct3606Ww8BA==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:29.418659Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.20949","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:458cfa16a3b27d335c91c97bb0e16ece8af7ede42b529aae3098aed97c8ca582","sha256:23a869c53e7d10895f1ba4933401e1af6ff4dc51a5eba1a73a78e384f4e9fb25"],"state_sha256":"d87457e7ed835a01efe40a42fc593013e7f37463e7e3214719528269d5d98aae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N72bz6s0bU5smft3aaXn98b3iqBvXgAX0I9Js53m3ucm1UjuuHVbGpJxXq6PXsZf2eJ5fnhzXjKPBHdVIuAvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T21:02:06.930712Z","bundle_sha256":"a7b3372444058c6d722acb2e31732466c4bd667b6d64a1a00a5b34d4ea4b9168"}}