{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FHC3GVBXTYOBLGNVJIW2YVIQGR","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":"d1c9c25712fca27e08cf83f39463b4e492f3d51e60d71172ef30967557595206","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-30T08:44:23Z","title_canon_sha256":"b704fc754a1c284cfa853756d67f0e6618b27620fca2e50bfd3b24ed75315177"},"schema_version":"1.0","source":{"id":"2509.25949","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.25949","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"arxiv_version","alias_value":"2509.25949v3","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.25949","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"pith_short_12","alias_value":"FHC3GVBXTYOB","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"FHC3GVBXTYOBLGNV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"FHC3GVBX","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:f33ba560fc7c36931bdade4d2cbe6402e41438356ff9e4c266fb3601a9e2214a","target":"graph","created_at":"2026-05-18T03:09:34Z","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":"A subgraph in an edge-colored graph is called rainbow if all its edges have distinct colors. For a graph $G$ and an integer $n$, the anti-Ramsey number $AR(n,G)$ is the maximum number of colors in an edge-coloring of $K_n$ that contains no rainbow copy of $G$. We study $AR(n, kP_3 \\cup tP_2)$, where $kP_3 \\cup tP_2$ is the linear forest of $k$ disjoint paths on three vertices and a matching of size $t$. Recently, Jie and Jin [Discrete Appl. Math. 386 (2026) 30-57] determined this number for $k\\geq 2$, $t\\geq\\frac{k^2-3k+4}{2}$ and $n=2t+3k$. Here we solve the spanning case $n=3k+2t$ for all $k","authors_text":"Ali Ghalavand, Xueliang Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-30T08:44:23Z","title":"Anti-Ramsey Numbers for Spanning Linear Forests of 3-Vertex Paths and Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.25949","kind":"arxiv","version":3},"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:bb0f7d2ba7deb2edf455cd0ad6df1e1519662999d49be47a6a7d48fc949712bc","target":"record","created_at":"2026-05-18T03:09:34Z","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":"d1c9c25712fca27e08cf83f39463b4e492f3d51e60d71172ef30967557595206","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-30T08:44:23Z","title_canon_sha256":"b704fc754a1c284cfa853756d67f0e6618b27620fca2e50bfd3b24ed75315177"},"schema_version":"1.0","source":{"id":"2509.25949","kind":"arxiv","version":3}},"canonical_sha256":"29c5b354379e1c1599b54a2dac55103441b0352d7f75b4a19fbf2e5aabca2c3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29c5b354379e1c1599b54a2dac55103441b0352d7f75b4a19fbf2e5aabca2c3b","first_computed_at":"2026-05-18T03:09:34.342759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:34.342759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x+UGYpxLBZH78DS1kWPDwyV/bSVx6OwsVV5e6LrS6tcoztRQxBJbIj1VxcRKD8fQU3VXZXVAqOhQrMfDjY3iAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:34.343630Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.25949","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb0f7d2ba7deb2edf455cd0ad6df1e1519662999d49be47a6a7d48fc949712bc","sha256:f33ba560fc7c36931bdade4d2cbe6402e41438356ff9e4c266fb3601a9e2214a"],"state_sha256":"34422af182d830d099e1c43f8c110b4f78737f90e2c93cf571cf22f299ee7d39"}