{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LAA75EDPLU4O4HBO4FWF7A4VWX","short_pith_number":"pith:LAA75EDP","canonical_record":{"source":{"id":"2507.05641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-08T03:38:01Z","cross_cats_sorted":[],"title_canon_sha256":"e075ef0540bed4243f406b0dbb6ee7a1dd275a5faaece6321a2bb5d379b89d80","abstract_canon_sha256":"35870cedbe1ba05f7e6d12cef8cf36049a7c1407e0a4158b8ca749a69f046fb8"},"schema_version":"1.0"},"canonical_sha256":"5801fe906f5d38ee1c2ee16c5f8395b5c65dfb2234dee53b2b8a1b77ec39e66a","source":{"kind":"arxiv","id":"2507.05641","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.05641","created_at":"2026-07-05T11:34:11Z"},{"alias_kind":"arxiv_version","alias_value":"2507.05641v2","created_at":"2026-07-05T11:34:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05641","created_at":"2026-07-05T11:34:11Z"},{"alias_kind":"pith_short_12","alias_value":"LAA75EDPLU4O","created_at":"2026-07-05T11:34:11Z"},{"alias_kind":"pith_short_16","alias_value":"LAA75EDPLU4O4HBO","created_at":"2026-07-05T11:34:11Z"},{"alias_kind":"pith_short_8","alias_value":"LAA75EDP","created_at":"2026-07-05T11:34:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LAA75EDPLU4O4HBO4FWF7A4VWX","target":"record","payload":{"canonical_record":{"source":{"id":"2507.05641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-08T03:38:01Z","cross_cats_sorted":[],"title_canon_sha256":"e075ef0540bed4243f406b0dbb6ee7a1dd275a5faaece6321a2bb5d379b89d80","abstract_canon_sha256":"35870cedbe1ba05f7e6d12cef8cf36049a7c1407e0a4158b8ca749a69f046fb8"},"schema_version":"1.0"},"canonical_sha256":"5801fe906f5d38ee1c2ee16c5f8395b5c65dfb2234dee53b2b8a1b77ec39e66a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:11.851848Z","signature_b64":"jlf3eCV6hqVk8T7IJUXojRXbCSPzqziaQvsqvVV6oP3QjNj5KB/uYU91OMqJB+OEb4g5dX1pzWP7DRYdF8LqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5801fe906f5d38ee1c2ee16c5f8395b5c65dfb2234dee53b2b8a1b77ec39e66a","last_reissued_at":"2026-07-05T11:34:11.851368Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:11.851368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.05641","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-05T11:34:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+cgUexO1CEmOwaHppHEwri8A4W2Mznbf2SvRXUZTs+fSIGQCDF5n9TpgL97TKPAtIzNxwqSGBxRtDa9fknrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:39:43.693014Z"},"content_sha256":"f29260e4615ed592eb9e5d8c430841dd0c1ca0fcbce4024764c7a4ea13765757","schema_version":"1.0","event_id":"sha256:f29260e4615ed592eb9e5d8c430841dd0c1ca0fcbce4024764c7a4ea13765757"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LAA75EDPLU4O4HBO4FWF7A4VWX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Off-Diagonal Ramsey Numbers for Linear Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hung-Hsun Hans Yu, Jiaxi Nie, Xiaoyu He, Yuval Wigderson","submitted_at":"2025-07-08T03:38:01Z","abstract_excerpt":"We study off-diagonal Ramsey numbers $r(H, K_n^{(k)})$ of $k$-uniform hypergraphs, where $H$ is a fixed linear $k$-uniform hypergraph and $K_n^{(k)}$ is complete on $n$ vertices. Recently, Conlon et al.\\ disproved the folklore conjecture that $r(H, K_n^{(3)})$ always grows polynomially in $n$. In this paper we show that much larger growth rates are possible in higher uniformity. In uniformity $k\\ge 4$, we prove that for any constant $C>0$, there exists a linear $k$-uniform hypergraph $H$ for which $$r(H,K_n^{(k)}) \\geq \\textup{twr}_{k-2}(2^{(\\log n)^C}).$$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05641","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/2507.05641/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-05T11:34:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HjZblllsG0XJE4Gi/oxS23+XQCArkKD7riS7WRavz9937XvboSk9FYh+VtcWni0jC+VNCVvVUnZY1KZDxKbJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:39:43.693838Z"},"content_sha256":"90b66e58ef313c440c0295b01497f0dc4bbefbe9a3d4fda220822f98ff5ec92d","schema_version":"1.0","event_id":"sha256:90b66e58ef313c440c0295b01497f0dc4bbefbe9a3d4fda220822f98ff5ec92d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAA75EDPLU4O4HBO4FWF7A4VWX/bundle.json","state_url":"https://pith.science/pith/LAA75EDPLU4O4HBO4FWF7A4VWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAA75EDPLU4O4HBO4FWF7A4VWX/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-07T02:39:43Z","links":{"resolver":"https://pith.science/pith/LAA75EDPLU4O4HBO4FWF7A4VWX","bundle":"https://pith.science/pith/LAA75EDPLU4O4HBO4FWF7A4VWX/bundle.json","state":"https://pith.science/pith/LAA75EDPLU4O4HBO4FWF7A4VWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAA75EDPLU4O4HBO4FWF7A4VWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LAA75EDPLU4O4HBO4FWF7A4VWX","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":"35870cedbe1ba05f7e6d12cef8cf36049a7c1407e0a4158b8ca749a69f046fb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-08T03:38:01Z","title_canon_sha256":"e075ef0540bed4243f406b0dbb6ee7a1dd275a5faaece6321a2bb5d379b89d80"},"schema_version":"1.0","source":{"id":"2507.05641","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.05641","created_at":"2026-07-05T11:34:11Z"},{"alias_kind":"arxiv_version","alias_value":"2507.05641v2","created_at":"2026-07-05T11:34:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05641","created_at":"2026-07-05T11:34:11Z"},{"alias_kind":"pith_short_12","alias_value":"LAA75EDPLU4O","created_at":"2026-07-05T11:34:11Z"},{"alias_kind":"pith_short_16","alias_value":"LAA75EDPLU4O4HBO","created_at":"2026-07-05T11:34:11Z"},{"alias_kind":"pith_short_8","alias_value":"LAA75EDP","created_at":"2026-07-05T11:34:11Z"}],"graph_snapshots":[{"event_id":"sha256:90b66e58ef313c440c0295b01497f0dc4bbefbe9a3d4fda220822f98ff5ec92d","target":"graph","created_at":"2026-07-05T11:34:11Z","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/2507.05641/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study off-diagonal Ramsey numbers $r(H, K_n^{(k)})$ of $k$-uniform hypergraphs, where $H$ is a fixed linear $k$-uniform hypergraph and $K_n^{(k)}$ is complete on $n$ vertices. Recently, Conlon et al.\\ disproved the folklore conjecture that $r(H, K_n^{(3)})$ always grows polynomially in $n$. In this paper we show that much larger growth rates are possible in higher uniformity. In uniformity $k\\ge 4$, we prove that for any constant $C>0$, there exists a linear $k$-uniform hypergraph $H$ for which $$r(H,K_n^{(k)}) \\geq \\textup{twr}_{k-2}(2^{(\\log n)^C}).$$","authors_text":"Hung-Hsun Hans Yu, Jiaxi Nie, Xiaoyu He, Yuval Wigderson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-08T03:38:01Z","title":"Off-Diagonal Ramsey Numbers for Linear Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05641","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:f29260e4615ed592eb9e5d8c430841dd0c1ca0fcbce4024764c7a4ea13765757","target":"record","created_at":"2026-07-05T11:34:11Z","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":"35870cedbe1ba05f7e6d12cef8cf36049a7c1407e0a4158b8ca749a69f046fb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-08T03:38:01Z","title_canon_sha256":"e075ef0540bed4243f406b0dbb6ee7a1dd275a5faaece6321a2bb5d379b89d80"},"schema_version":"1.0","source":{"id":"2507.05641","kind":"arxiv","version":2}},"canonical_sha256":"5801fe906f5d38ee1c2ee16c5f8395b5c65dfb2234dee53b2b8a1b77ec39e66a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5801fe906f5d38ee1c2ee16c5f8395b5c65dfb2234dee53b2b8a1b77ec39e66a","first_computed_at":"2026-07-05T11:34:11.851368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:34:11.851368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jlf3eCV6hqVk8T7IJUXojRXbCSPzqziaQvsqvVV6oP3QjNj5KB/uYU91OMqJB+OEb4g5dX1pzWP7DRYdF8LqDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:34:11.851848Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.05641","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f29260e4615ed592eb9e5d8c430841dd0c1ca0fcbce4024764c7a4ea13765757","sha256:90b66e58ef313c440c0295b01497f0dc4bbefbe9a3d4fda220822f98ff5ec92d"],"state_sha256":"5a7934fc04c0c28e0214f536a4dc6fb42003e2419e3bb4fee1e3ac7270200a1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XbeuL9LKowj9qM+4Pte4cE72/mlLm/ElWCQ4ncKxOVrIgMMRyI9mTZ3ryOLx7FQRDIMDCbboT9MG5FhDjZ9iBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T02:39:43.699764Z","bundle_sha256":"ae1c45b69c2795db919a24ca6d29e25829ebe29cb85c78a88652ab47e5f2de5e"}}