{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Q5EUZGNJPWA67OKAQJHOSYQKNZ","short_pith_number":"pith:Q5EUZGNJ","schema_version":"1.0","canonical_sha256":"87494c99a97d81efb940824ee9620a6e467eca3a3184dae584b0ccc4c37d71a5","source":{"kind":"arxiv","id":"2505.14386","version":1},"attestation_state":"computed","paper":{"title":"Rainbow Tur\\'an problems for a matching and any other graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\'aniel Gerbner, Shujing Miao","submitted_at":"2025-05-20T14:07:43Z","abstract_excerpt":"For a family of graphs $\\cF$, a graph is called $\\cF$-free if it does not contain any member of $\\cF$ as a subgraph. Given a collection of graphs $(G_1,\\ldots,G_t)$ on the same vertex set $V$ of size $n$, a rainbow graph on $V$ is obtained by taking at most one edge from each $G_i$. We say that a collection is rainbow $\\cF$-free if it contains no rainbow copy of any member of $\\cF$. In this paper, we study the maximum values of $min_{i\\in [t]}|E(G_i)|$, $\\sum_{i=1}^{t}|E(G_i)|$ and $\\prod_{i=1}^{t}|E(G_i)|$ among rainbow $\\{F,M_{s+1}\\}$-free collections $(G_1,\\ldots,G_t)$ on $n$ vertices."},"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":"2505.14386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-20T14:07:43Z","cross_cats_sorted":[],"title_canon_sha256":"8ce5c5f472ce702c72ab744d7560b32cce1f4075c9e2160b0f307e293acc3983","abstract_canon_sha256":"4dff9562d4ea065081eb6a2a39fdbf182a1fa74312b6fc3c706ecd17c05b9a3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:00.663936Z","signature_b64":"Io4TdfDsrMUW0BS6f4zsIHaM3AVD8ttiOIpw/3fk3qXZq4PlR6t3apY7DnhfdbwdXxoc8AqOwFzT7VT/AJrcAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87494c99a97d81efb940824ee9620a6e467eca3a3184dae584b0ccc4c37d71a5","last_reissued_at":"2026-07-05T11:06:00.663328Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:00.663328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow Tur\\'an problems for a matching and any other graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\'aniel Gerbner, Shujing Miao","submitted_at":"2025-05-20T14:07:43Z","abstract_excerpt":"For a family of graphs $\\cF$, a graph is called $\\cF$-free if it does not contain any member of $\\cF$ as a subgraph. Given a collection of graphs $(G_1,\\ldots,G_t)$ on the same vertex set $V$ of size $n$, a rainbow graph on $V$ is obtained by taking at most one edge from each $G_i$. We say that a collection is rainbow $\\cF$-free if it contains no rainbow copy of any member of $\\cF$. In this paper, we study the maximum values of $min_{i\\in [t]}|E(G_i)|$, $\\sum_{i=1}^{t}|E(G_i)|$ and $\\prod_{i=1}^{t}|E(G_i)|$ among rainbow $\\{F,M_{s+1}\\}$-free collections $(G_1,\\ldots,G_t)$ on $n$ vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14386","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.14386/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.14386","created_at":"2026-07-05T11:06:00.663402+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.14386v1","created_at":"2026-07-05T11:06:00.663402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14386","created_at":"2026-07-05T11:06:00.663402+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5EUZGNJPWA6","created_at":"2026-07-05T11:06:00.663402+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5EUZGNJPWA67OKA","created_at":"2026-07-05T11:06:00.663402+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5EUZGNJ","created_at":"2026-07-05T11:06:00.663402+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01768","citing_title":"Hypergraph extensions of the Alon--Frankl Theorem and rainbow Tur\\'an problems","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01768","citing_title":"Hypergraph extensions of the Alon--Frankl Theorem and rainbow Tur\\'an problems","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q5EUZGNJPWA67OKAQJHOSYQKNZ","json":"https://pith.science/pith/Q5EUZGNJPWA67OKAQJHOSYQKNZ.json","graph_json":"https://pith.science/api/pith-number/Q5EUZGNJPWA67OKAQJHOSYQKNZ/graph.json","events_json":"https://pith.science/api/pith-number/Q5EUZGNJPWA67OKAQJHOSYQKNZ/events.json","paper":"https://pith.science/paper/Q5EUZGNJ"},"agent_actions":{"view_html":"https://pith.science/pith/Q5EUZGNJPWA67OKAQJHOSYQKNZ","download_json":"https://pith.science/pith/Q5EUZGNJPWA67OKAQJHOSYQKNZ.json","view_paper":"https://pith.science/paper/Q5EUZGNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.14386&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5EUZGNJPWA67OKAQJHOSYQKNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5EUZGNJPWA67OKAQJHOSYQKNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5EUZGNJPWA67OKAQJHOSYQKNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5EUZGNJPWA67OKAQJHOSYQKNZ/action/storage_attestation","attest_author":"https://pith.science/pith/Q5EUZGNJPWA67OKAQJHOSYQKNZ/action/author_attestation","sign_citation":"https://pith.science/pith/Q5EUZGNJPWA67OKAQJHOSYQKNZ/action/citation_signature","submit_replication":"https://pith.science/pith/Q5EUZGNJPWA67OKAQJHOSYQKNZ/action/replication_record"}},"created_at":"2026-07-05T11:06:00.663402+00:00","updated_at":"2026-07-05T11:06:00.663402+00:00"}