{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Q5EUZGNJPWA67OKAQJHOSYQKNZ","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":"4dff9562d4ea065081eb6a2a39fdbf182a1fa74312b6fc3c706ecd17c05b9a3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-20T14:07:43Z","title_canon_sha256":"8ce5c5f472ce702c72ab744d7560b32cce1f4075c9e2160b0f307e293acc3983"},"schema_version":"1.0","source":{"id":"2505.14386","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.14386","created_at":"2026-07-05T11:06:00Z"},{"alias_kind":"arxiv_version","alias_value":"2505.14386v1","created_at":"2026-07-05T11:06:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14386","created_at":"2026-07-05T11:06:00Z"},{"alias_kind":"pith_short_12","alias_value":"Q5EUZGNJPWA6","created_at":"2026-07-05T11:06:00Z"},{"alias_kind":"pith_short_16","alias_value":"Q5EUZGNJPWA67OKA","created_at":"2026-07-05T11:06:00Z"},{"alias_kind":"pith_short_8","alias_value":"Q5EUZGNJ","created_at":"2026-07-05T11:06:00Z"}],"graph_snapshots":[{"event_id":"sha256:c884469d3efb5abdeaccc1f926623f6e4efc358b2c4ed1bab8096f0dfe745a74","target":"graph","created_at":"2026-07-05T11:06:00Z","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/2505.14386/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"D\\'aniel Gerbner, Shujing Miao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-20T14:07:43Z","title":"Rainbow Tur\\'an problems for a matching and any other graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14386","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:c46b41be07dafde935c31814d0ad0848a17bb024c96521efadbe1b4039a7c206","target":"record","created_at":"2026-07-05T11:06:00Z","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":"4dff9562d4ea065081eb6a2a39fdbf182a1fa74312b6fc3c706ecd17c05b9a3a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-20T14:07:43Z","title_canon_sha256":"8ce5c5f472ce702c72ab744d7560b32cce1f4075c9e2160b0f307e293acc3983"},"schema_version":"1.0","source":{"id":"2505.14386","kind":"arxiv","version":1}},"canonical_sha256":"87494c99a97d81efb940824ee9620a6e467eca3a3184dae584b0ccc4c37d71a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87494c99a97d81efb940824ee9620a6e467eca3a3184dae584b0ccc4c37d71a5","first_computed_at":"2026-07-05T11:06:00.663328Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:06:00.663328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Io4TdfDsrMUW0BS6f4zsIHaM3AVD8ttiOIpw/3fk3qXZq4PlR6t3apY7DnhfdbwdXxoc8AqOwFzT7VT/AJrcAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:06:00.663936Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.14386","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c46b41be07dafde935c31814d0ad0848a17bb024c96521efadbe1b4039a7c206","sha256:c884469d3efb5abdeaccc1f926623f6e4efc358b2c4ed1bab8096f0dfe745a74"],"state_sha256":"1a7cf5647336b9d0b5a77f9e0291ea4425739a7a9feb6bfe43f0dae6776da88e"}