{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E377HLW7CFZ5JU3O2AYXDQYV3W","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":"c30aee259a9e3b933f0b19acd800b5ee88c87b35087366f6b7cc21c6fdf15dc0","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-06-01T02:38:22Z","title_canon_sha256":"42b2a6625501e2dc9fc66916252a1801883bdbfa546226123e2740e091555a90"},"schema_version":"1.0","source":{"id":"1906.00132","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00132","created_at":"2026-07-04T23:50:19Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00132v2","created_at":"2026-07-04T23:50:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00132","created_at":"2026-07-04T23:50:19Z"},{"alias_kind":"pith_short_12","alias_value":"E377HLW7CFZ5","created_at":"2026-07-04T23:50:19Z"},{"alias_kind":"pith_short_16","alias_value":"E377HLW7CFZ5JU3O","created_at":"2026-07-04T23:50:19Z"},{"alias_kind":"pith_short_8","alias_value":"E377HLW7","created_at":"2026-07-04T23:50:19Z"}],"graph_snapshots":[{"event_id":"sha256:d7d4d3250c786f5b49134f1cb75973a7315a39742f017b1c54d2bacdd1449976","target":"graph","created_at":"2026-07-04T23:50:19Z","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/1906.00132/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Ramsey number $r_k(p, q)$ is the smallest integer $N$ that satisfies for every red-blue coloring on $k$-subsets of $[N]$, there exist $p$ integers such that any $k$-subset of them is red, or $q$ integers such that any $k$-subset of them is blue. In this paper, we study the lower bounds for small Ramsey numbers on hypergraphs by constructing counter-examples and recurrence relations. We present a new algorithm to prove lower bounds for $r_k(k+1, k+1)$. In particular, our algorithm is able to prove $r_5(6,6) \\ge 72$, where there is only trivial lower bound on $5$-hypergraphs before this work","authors_text":"S. Cliff Liu","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-06-01T02:38:22Z","title":"Lower Bounds for Small Ramsey Numbers on Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00132","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:5f369ad7c84cf192aaab4478ca7dc56f8a152748a60c93fb3f1cd84f18dda2d5","target":"record","created_at":"2026-07-04T23:50:19Z","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":"c30aee259a9e3b933f0b19acd800b5ee88c87b35087366f6b7cc21c6fdf15dc0","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-06-01T02:38:22Z","title_canon_sha256":"42b2a6625501e2dc9fc66916252a1801883bdbfa546226123e2740e091555a90"},"schema_version":"1.0","source":{"id":"1906.00132","kind":"arxiv","version":2}},"canonical_sha256":"26fff3aedf1173d4d36ed03171c315ddbf57ebd593dc5e3ff6411b19e3a70996","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26fff3aedf1173d4d36ed03171c315ddbf57ebd593dc5e3ff6411b19e3a70996","first_computed_at":"2026-07-04T23:50:19.049178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:50:19.049178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1SosrgHaTDulIKYLT4OlskkXrq5R0nRmtqBjrxNr356+k2fW/EQ3sflfRinSCwq6TWxFOqtjS4xGbcwHMRD3Dg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:50:19.049567Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00132","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f369ad7c84cf192aaab4478ca7dc56f8a152748a60c93fb3f1cd84f18dda2d5","sha256:d7d4d3250c786f5b49134f1cb75973a7315a39742f017b1c54d2bacdd1449976"],"state_sha256":"7724b8b794400f24abae78cf2cc3bf645debef90e9d1239d60bcfbcefa4ea975"}