{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5ISM7VCFSR43HOAAIDAFIWTIV3","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":"8e0a8ded453bd5e7e0e4241cc681053e98e68a699eabc28f057bc42ebc99e04d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-10T15:35:06Z","title_canon_sha256":"3bb43fd2d4ef59ae5c14c5472498bb24f38797a8405c60318586b0ced6b657a9"},"schema_version":"1.0","source":{"id":"1209.2033","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2033","created_at":"2026-05-18T03:45:41Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2033v2","created_at":"2026-05-18T03:45:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2033","created_at":"2026-05-18T03:45:41Z"},{"alias_kind":"pith_short_12","alias_value":"5ISM7VCFSR43","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5ISM7VCFSR43HOAA","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5ISM7VCF","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:67e38c3221a1d9670d20247973650f68c699d1ab10e82ee2b1e76ce3a31b4765","target":"graph","created_at":"2026-05-18T03:45:41Z","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":"Let $K_{n}^{r}$ denote the complete $r$-uniform hypergraph on $n$ vertices. A matching $M$ in a hypergraph is a set of pairwise vertex disjoint edges. Recent Ramsey-type results rely on lemmas about the size of monochromatic matchings. A starting point for this study comes from a well-known result of Alon, Frankl, and Lov\\'asz (1986). Our motivation is to find the smallest $n$ such that every $t$-coloring of $K_{n}^{r}$ contains an $s$-colored matching of size $k$. It has been conjectured that in every coloring of the edges of $K_n^r$ with 3 colors there is a 2-colored matching of size at leas","authors_text":"Ago Riet, Daniel Gerbner, Diana Piguet, Dominik Vu, Lindsay Erickson, Neal Bushaw, Peter Csorba, Tamas Terpai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-10T15:35:06Z","title":"2-Colored Matchings in a 3-Colored K^{3}_{12}"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2033","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:835dfd2768557f8e9303cc32c79f3353de49f1216b466bc29263851047f6610e","target":"record","created_at":"2026-05-18T03:45:41Z","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":"8e0a8ded453bd5e7e0e4241cc681053e98e68a699eabc28f057bc42ebc99e04d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-10T15:35:06Z","title_canon_sha256":"3bb43fd2d4ef59ae5c14c5472498bb24f38797a8405c60318586b0ced6b657a9"},"schema_version":"1.0","source":{"id":"1209.2033","kind":"arxiv","version":2}},"canonical_sha256":"ea24cfd4459479b3b80040c0545a68aec3821e3e5059ec0b0e66bc77b78cf79c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea24cfd4459479b3b80040c0545a68aec3821e3e5059ec0b0e66bc77b78cf79c","first_computed_at":"2026-05-18T03:45:41.252518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:41.252518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GsWDf4Vwv7Zea8C1rfPfEjHq5nGHY8SZ6u6NEN69gguhuvxrb3JBGUDFO/6WmmuvCmLhDVHa0AZFNxTn4tQnCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:41.253234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.2033","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:835dfd2768557f8e9303cc32c79f3353de49f1216b466bc29263851047f6610e","sha256:67e38c3221a1d9670d20247973650f68c699d1ab10e82ee2b1e76ce3a31b4765"],"state_sha256":"d7c000c941f974c5095133cab4f0cf20067c39b180aaef07610dd5565b0db3df"}