{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GDBSBG4YZWHRECTF3EAU4VYJDV","short_pith_number":"pith:GDBSBG4Y","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"},"canonical_sha256":"30c3209b98cd8f120a65d9014e57091d4435b9d46e3a978b48be3796132211ab","source":{"kind":"arxiv","id":"1906.03888","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03888","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03888v1","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03888","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"GDBSBG4YZWHR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GDBSBG4YZWHRECTF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GDBSBG4Y","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GDBSBG4YZWHRECTF3EAU4VYJDV","target":"record","payload":{"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"},"canonical_sha256":"30c3209b98cd8f120a65d9014e57091d4435b9d46e3a978b48be3796132211ab","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"},"source_kind":"arxiv","source_id":"1906.03888","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-17T23:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vU9vNBWDGLQCgwwa4FPWHrSIJSsa9aqoUroQwI6rFqipRhKEPFdYKHvAMBp+2h0LJe4qOnfHifN/t8Qh88L7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:24:38.047083Z"},"content_sha256":"aa8565ffaf2ea309cda14a744a5fae485ace7240cedb4d22f5911d9b1a12e71a","schema_version":"1.0","event_id":"sha256:aa8565ffaf2ea309cda14a744a5fae485ace7240cedb4d22f5911d9b1a12e71a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GDBSBG4YZWHRECTF3EAU4VYJDV","target":"graph","payload":{"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"},"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-17T23:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RJs3b+YX3+WYK4iZaZ3/+zOe7R764680MOafvtfxAoqX9dn1OPYpBq2DT1/J1Z0qeKX7EslG9aqYwAGcocuICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:24:38.047432Z"},"content_sha256":"0bd37df6ec21cb55ad2efe630a671b8e011f22aa27d092392dba339e52731d0e","schema_version":"1.0","event_id":"sha256:0bd37df6ec21cb55ad2efe630a671b8e011f22aa27d092392dba339e52731d0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDBSBG4YZWHRECTF3EAU4VYJDV/bundle.json","state_url":"https://pith.science/pith/GDBSBG4YZWHRECTF3EAU4VYJDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDBSBG4YZWHRECTF3EAU4VYJDV/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-06-02T11:24:38Z","links":{"resolver":"https://pith.science/pith/GDBSBG4YZWHRECTF3EAU4VYJDV","bundle":"https://pith.science/pith/GDBSBG4YZWHRECTF3EAU4VYJDV/bundle.json","state":"https://pith.science/pith/GDBSBG4YZWHRECTF3EAU4VYJDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDBSBG4YZWHRECTF3EAU4VYJDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GDBSBG4YZWHRECTF3EAU4VYJDV","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":"2e4b1c8a8592435d6234a98a75d966409f257e627d947166070494266db3809e","cross_cats_sorted":["cs.DM","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-10T10:40:17Z","title_canon_sha256":"4940d22cd27918e338936fd2fa528d96652ec03346f41be685029798fe41767f"},"schema_version":"1.0","source":{"id":"1906.03888","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03888","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03888v1","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03888","created_at":"2026-05-17T23:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"GDBSBG4YZWHR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GDBSBG4YZWHRECTF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GDBSBG4Y","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:0bd37df6ec21cb55ad2efe630a671b8e011f22aa27d092392dba339e52731d0e","target":"graph","created_at":"2026-05-17T23:43:44Z","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"},"paper":{"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","authors_text":"David Chodounsk\\'y, Jan Hubi\\v{c}ka, Lluis Vena, Martin Balko, Mat\\v{e}j Kone\\v{c}n\\'y","cross_cats":["cs.DM","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-10T10:40:17Z","title":"Big Ramsey degrees of 3-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03888","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:aa8565ffaf2ea309cda14a744a5fae485ace7240cedb4d22f5911d9b1a12e71a","target":"record","created_at":"2026-05-17T23:43:44Z","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":"2e4b1c8a8592435d6234a98a75d966409f257e627d947166070494266db3809e","cross_cats_sorted":["cs.DM","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-10T10:40:17Z","title_canon_sha256":"4940d22cd27918e338936fd2fa528d96652ec03346f41be685029798fe41767f"},"schema_version":"1.0","source":{"id":"1906.03888","kind":"arxiv","version":1}},"canonical_sha256":"30c3209b98cd8f120a65d9014e57091d4435b9d46e3a978b48be3796132211ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30c3209b98cd8f120a65d9014e57091d4435b9d46e3a978b48be3796132211ab","first_computed_at":"2026-05-17T23:43:44.650592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:44.650592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K87zY/XrlK5T7bcBaTQ5f5ANTGPCrFg/y7vR/XcI48/f2E7dwqwxJqXyvUG+btrT6noylnvXYU3i5JoODM1MAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:44.651158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03888","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa8565ffaf2ea309cda14a744a5fae485ace7240cedb4d22f5911d9b1a12e71a","sha256:0bd37df6ec21cb55ad2efe630a671b8e011f22aa27d092392dba339e52731d0e"],"state_sha256":"7f999c6f3a5c44cb4d5b85f03362246a3b3100a52880cecf5527fc95a5c445c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADM2RUC9IjFPNuTc/BFFBqlb77ePqWrFgolcoqz+nb/7mdWNkZtZdsjCZFSUtDtCVigQkk3s8utTjF6O4Xg7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:24:38.049306Z","bundle_sha256":"7983adfab0603765bc7d96d9d71cb41690f70151f2761132dbb02cbbf9d978d7"}}