{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5ISM7VCFSR43HOAAIDAFIWTIV3","short_pith_number":"pith:5ISM7VCF","schema_version":"1.0","canonical_sha256":"ea24cfd4459479b3b80040c0545a68aec3821e3e5059ec0b0e66bc77b78cf79c","source":{"kind":"arxiv","id":"1209.2033","version":2},"attestation_state":"computed","paper":{"title":"2-Colored Matchings in a 3-Colored K^{3}_{12}","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ago Riet, Daniel Gerbner, Diana Piguet, Dominik Vu, Lindsay Erickson, Neal Bushaw, Peter Csorba, Tamas Terpai","submitted_at":"2012-09-10T15:35:06Z","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"},"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":"1209.2033","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-10T15:35:06Z","cross_cats_sorted":[],"title_canon_sha256":"3bb43fd2d4ef59ae5c14c5472498bb24f38797a8405c60318586b0ced6b657a9","abstract_canon_sha256":"8e0a8ded453bd5e7e0e4241cc681053e98e68a699eabc28f057bc42ebc99e04d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:41.253234Z","signature_b64":"GsWDf4Vwv7Zea8C1rfPfEjHq5nGHY8SZ6u6NEN69gguhuvxrb3JBGUDFO/6WmmuvCmLhDVHa0AZFNxTn4tQnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea24cfd4459479b3b80040c0545a68aec3821e3e5059ec0b0e66bc77b78cf79c","last_reissued_at":"2026-05-18T03:45:41.252518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:41.252518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"2-Colored Matchings in a 3-Colored K^{3}_{12}","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ago Riet, Daniel Gerbner, Diana Piguet, Dominik Vu, Lindsay Erickson, Neal Bushaw, Peter Csorba, Tamas Terpai","submitted_at":"2012-09-10T15:35:06Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2033","kind":"arxiv","version":2},"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":"1209.2033","created_at":"2026-05-18T03:45:41.252636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2033v2","created_at":"2026-05-18T03:45:41.252636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2033","created_at":"2026-05-18T03:45:41.252636+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ISM7VCFSR43","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ISM7VCFSR43HOAA","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ISM7VCF","created_at":"2026-05-18T12:26:53.410803+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/5ISM7VCFSR43HOAAIDAFIWTIV3","json":"https://pith.science/pith/5ISM7VCFSR43HOAAIDAFIWTIV3.json","graph_json":"https://pith.science/api/pith-number/5ISM7VCFSR43HOAAIDAFIWTIV3/graph.json","events_json":"https://pith.science/api/pith-number/5ISM7VCFSR43HOAAIDAFIWTIV3/events.json","paper":"https://pith.science/paper/5ISM7VCF"},"agent_actions":{"view_html":"https://pith.science/pith/5ISM7VCFSR43HOAAIDAFIWTIV3","download_json":"https://pith.science/pith/5ISM7VCFSR43HOAAIDAFIWTIV3.json","view_paper":"https://pith.science/paper/5ISM7VCF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2033&json=true","fetch_graph":"https://pith.science/api/pith-number/5ISM7VCFSR43HOAAIDAFIWTIV3/graph.json","fetch_events":"https://pith.science/api/pith-number/5ISM7VCFSR43HOAAIDAFIWTIV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ISM7VCFSR43HOAAIDAFIWTIV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ISM7VCFSR43HOAAIDAFIWTIV3/action/storage_attestation","attest_author":"https://pith.science/pith/5ISM7VCFSR43HOAAIDAFIWTIV3/action/author_attestation","sign_citation":"https://pith.science/pith/5ISM7VCFSR43HOAAIDAFIWTIV3/action/citation_signature","submit_replication":"https://pith.science/pith/5ISM7VCFSR43HOAAIDAFIWTIV3/action/replication_record"}},"created_at":"2026-05-18T03:45:41.252636+00:00","updated_at":"2026-05-18T03:45:41.252636+00:00"}