{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GHIJ2HUZZWIN22LMNKW4JLX62R","short_pith_number":"pith:GHIJ2HUZ","schema_version":"1.0","canonical_sha256":"31d09d1e99cd90dd696c6aadc4aefed479ce9a9f1931df1c86472dd623f48b11","source":{"kind":"arxiv","id":"2412.19461","version":1},"attestation_state":"computed","paper":{"title":"On tight tree-complete hypergraph Ramsey numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiaxi Nie","submitted_at":"2024-12-27T05:15:59Z","abstract_excerpt":"Chv\\'atal showed that for any tree $T$ with $k$ edges the Ramsey number $R(T,n)=k(n-1)+1$ (\"Tree-complete graph Ramsey numbers.\" Journal of Graph Theory 1.1 (1977): 93-93). For $r=3$ or $4$, we show that, if $T$ is an $r$-uniform non-trivial tight tree, then the hypergraph Ramsey number $R(T,n)=\\Theta(n^{r-1})$. The 3-uniform result comes from observing a construction of Cooper and Mubayi. The main contribution of this paper is the 4-uniform construction, which is inspired by the Cooper-Mubayi 3-uniform construction."},"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":"2412.19461","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-12-27T05:15:59Z","cross_cats_sorted":[],"title_canon_sha256":"8203e5903396b6bebe3c6423421b8a1546385d3f92ab2b6539a53cbc248c8f8b","abstract_canon_sha256":"da01e150a5a32f26ec3fc193813dd23c66a6012cfcf4e5f13a33214437498d83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:36.015789Z","signature_b64":"Qr3vk4GJ0A/J48JKf7Dx6X/kqK4atZTnZd8m6Vr6lSW6qFRauLnHWR8LikSKUrk+/ARs9nSjyFF6oN5u9yqhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31d09d1e99cd90dd696c6aadc4aefed479ce9a9f1931df1c86472dd623f48b11","last_reissued_at":"2026-07-05T09:54:36.015326Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:36.015326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On tight tree-complete hypergraph Ramsey numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiaxi Nie","submitted_at":"2024-12-27T05:15:59Z","abstract_excerpt":"Chv\\'atal showed that for any tree $T$ with $k$ edges the Ramsey number $R(T,n)=k(n-1)+1$ (\"Tree-complete graph Ramsey numbers.\" Journal of Graph Theory 1.1 (1977): 93-93). For $r=3$ or $4$, we show that, if $T$ is an $r$-uniform non-trivial tight tree, then the hypergraph Ramsey number $R(T,n)=\\Theta(n^{r-1})$. The 3-uniform result comes from observing a construction of Cooper and Mubayi. The main contribution of this paper is the 4-uniform construction, which is inspired by the Cooper-Mubayi 3-uniform construction."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.19461","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/2412.19461/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":"2412.19461","created_at":"2026-07-05T09:54:36.015385+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.19461v1","created_at":"2026-07-05T09:54:36.015385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.19461","created_at":"2026-07-05T09:54:36.015385+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHIJ2HUZZWIN","created_at":"2026-07-05T09:54:36.015385+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHIJ2HUZZWIN22LM","created_at":"2026-07-05T09:54:36.015385+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHIJ2HUZ","created_at":"2026-07-05T09:54:36.015385+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/GHIJ2HUZZWIN22LMNKW4JLX62R","json":"https://pith.science/pith/GHIJ2HUZZWIN22LMNKW4JLX62R.json","graph_json":"https://pith.science/api/pith-number/GHIJ2HUZZWIN22LMNKW4JLX62R/graph.json","events_json":"https://pith.science/api/pith-number/GHIJ2HUZZWIN22LMNKW4JLX62R/events.json","paper":"https://pith.science/paper/GHIJ2HUZ"},"agent_actions":{"view_html":"https://pith.science/pith/GHIJ2HUZZWIN22LMNKW4JLX62R","download_json":"https://pith.science/pith/GHIJ2HUZZWIN22LMNKW4JLX62R.json","view_paper":"https://pith.science/paper/GHIJ2HUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.19461&json=true","fetch_graph":"https://pith.science/api/pith-number/GHIJ2HUZZWIN22LMNKW4JLX62R/graph.json","fetch_events":"https://pith.science/api/pith-number/GHIJ2HUZZWIN22LMNKW4JLX62R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHIJ2HUZZWIN22LMNKW4JLX62R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHIJ2HUZZWIN22LMNKW4JLX62R/action/storage_attestation","attest_author":"https://pith.science/pith/GHIJ2HUZZWIN22LMNKW4JLX62R/action/author_attestation","sign_citation":"https://pith.science/pith/GHIJ2HUZZWIN22LMNKW4JLX62R/action/citation_signature","submit_replication":"https://pith.science/pith/GHIJ2HUZZWIN22LMNKW4JLX62R/action/replication_record"}},"created_at":"2026-07-05T09:54:36.015385+00:00","updated_at":"2026-07-05T09:54:36.015385+00:00"}