{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GDBSBG4YZWHRECTF3EAU4VYJDV","short_pith_number":"pith:GDBSBG4Y","schema_version":"1.0","canonical_sha256":"30c3209b98cd8f120a65d9014e57091d4435b9d46e3a978b48be3796132211ab","source":{"kind":"arxiv","id":"1906.03888","version":1},"attestation_state":"computed","paper":{"title":"Big Ramsey degrees of 3-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.LO"],"primary_cat":"math.CO","authors_text":"David Chodounsk\\'y, Jan Hubi\\v{c}ka, Lluis Vena, Martin Balko, Mat\\v{e}j Kone\\v{c}n\\'y","submitted_at":"2019-06-10T10:40:17Z","abstract_excerpt":"Given a countably infinite hypergraph $\\mathcal R$ and a finite hypergraph $\\mathcal A$, the big Ramsey degree of $\\mathcal A$ in $\\mathcal R$ is the least number $L$ such that, for every finite $k$ and every $k$-colouring of the embeddings of $\\mathcal A$ to $\\mathcal R$, there exists an embedding $f$ from $\\mathcal R$ to $\\mathcal R$ such that all the embeddings of $\\mathcal A$ to the image $f(\\mathcal R)$ have at most $L$ different colours.\n  We describe the big Ramsey degrees of the random countably infinite 3-uniform hypergraph, thereby solving a question of Sauer. We also give a new pres"},"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":"1906.03888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-10T10:40:17Z","cross_cats_sorted":["cs.DM","math.LO"],"title_canon_sha256":"4940d22cd27918e338936fd2fa528d96652ec03346f41be685029798fe41767f","abstract_canon_sha256":"2e4b1c8a8592435d6234a98a75d966409f257e627d947166070494266db3809e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:44.651158Z","signature_b64":"K87zY/XrlK5T7bcBaTQ5f5ANTGPCrFg/y7vR/XcI48/f2E7dwqwxJqXyvUG+btrT6noylnvXYU3i5JoODM1MAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30c3209b98cd8f120a65d9014e57091d4435b9d46e3a978b48be3796132211ab","last_reissued_at":"2026-05-17T23:43:44.650592Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:44.650592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Big Ramsey degrees of 3-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.LO"],"primary_cat":"math.CO","authors_text":"David Chodounsk\\'y, Jan Hubi\\v{c}ka, Lluis Vena, Martin Balko, Mat\\v{e}j Kone\\v{c}n\\'y","submitted_at":"2019-06-10T10:40:17Z","abstract_excerpt":"Given a countably infinite hypergraph $\\mathcal R$ and a finite hypergraph $\\mathcal A$, the big Ramsey degree of $\\mathcal A$ in $\\mathcal R$ is the least number $L$ such that, for every finite $k$ and every $k$-colouring of the embeddings of $\\mathcal A$ to $\\mathcal R$, there exists an embedding $f$ from $\\mathcal R$ to $\\mathcal R$ such that all the embeddings of $\\mathcal A$ to the image $f(\\mathcal R)$ have at most $L$ different colours.\n  We describe the big Ramsey degrees of the random countably infinite 3-uniform hypergraph, thereby solving a question of Sauer. We also give a new pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03888","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":""},"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":"1906.03888","created_at":"2026-05-17T23:43:44.650671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.03888v1","created_at":"2026-05-17T23:43:44.650671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03888","created_at":"2026-05-17T23:43:44.650671+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDBSBG4YZWHR","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDBSBG4YZWHRECTF","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDBSBG4Y","created_at":"2026-05-18T12:33:18.533446+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/GDBSBG4YZWHRECTF3EAU4VYJDV","json":"https://pith.science/pith/GDBSBG4YZWHRECTF3EAU4VYJDV.json","graph_json":"https://pith.science/api/pith-number/GDBSBG4YZWHRECTF3EAU4VYJDV/graph.json","events_json":"https://pith.science/api/pith-number/GDBSBG4YZWHRECTF3EAU4VYJDV/events.json","paper":"https://pith.science/paper/GDBSBG4Y"},"agent_actions":{"view_html":"https://pith.science/pith/GDBSBG4YZWHRECTF3EAU4VYJDV","download_json":"https://pith.science/pith/GDBSBG4YZWHRECTF3EAU4VYJDV.json","view_paper":"https://pith.science/paper/GDBSBG4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.03888&json=true","fetch_graph":"https://pith.science/api/pith-number/GDBSBG4YZWHRECTF3EAU4VYJDV/graph.json","fetch_events":"https://pith.science/api/pith-number/GDBSBG4YZWHRECTF3EAU4VYJDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDBSBG4YZWHRECTF3EAU4VYJDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDBSBG4YZWHRECTF3EAU4VYJDV/action/storage_attestation","attest_author":"https://pith.science/pith/GDBSBG4YZWHRECTF3EAU4VYJDV/action/author_attestation","sign_citation":"https://pith.science/pith/GDBSBG4YZWHRECTF3EAU4VYJDV/action/citation_signature","submit_replication":"https://pith.science/pith/GDBSBG4YZWHRECTF3EAU4VYJDV/action/replication_record"}},"created_at":"2026-05-17T23:43:44.650671+00:00","updated_at":"2026-05-17T23:43:44.650671+00:00"}