{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WMHQKBNGCVJUZFGCTVDRODHO3F","short_pith_number":"pith:WMHQKBNG","canonical_record":{"source":{"id":"1908.04129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-12T12:51:34Z","cross_cats_sorted":[],"title_canon_sha256":"f42cc0bab31078de07dbfb4a1dd9d3c3c40b0de22e7a8cbc28f986ba13f21f17","abstract_canon_sha256":"c2970df0d4ac70a209913f156e97caf85f3b9b0d0c9ee0096b5929774605ee00"},"schema_version":"1.0"},"canonical_sha256":"b30f0505a615534c94c29d47170ceed979a43b6565179dd255d70380e03ec2a5","source":{"kind":"arxiv","id":"1908.04129","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04129","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04129v1","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04129","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"pith_short_12","alias_value":"WMHQKBNGCVJU","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"pith_short_16","alias_value":"WMHQKBNGCVJUZFGC","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"pith_short_8","alias_value":"WMHQKBNG","created_at":"2026-07-04T23:53:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WMHQKBNGCVJUZFGCTVDRODHO3F","target":"record","payload":{"canonical_record":{"source":{"id":"1908.04129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-12T12:51:34Z","cross_cats_sorted":[],"title_canon_sha256":"f42cc0bab31078de07dbfb4a1dd9d3c3c40b0de22e7a8cbc28f986ba13f21f17","abstract_canon_sha256":"c2970df0d4ac70a209913f156e97caf85f3b9b0d0c9ee0096b5929774605ee00"},"schema_version":"1.0"},"canonical_sha256":"b30f0505a615534c94c29d47170ceed979a43b6565179dd255d70380e03ec2a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:53:20.998088Z","signature_b64":"Lhh3KWOuYylJ3YpkBtCF37fEVP1FnUQg5MEs5sKLC3jS+4LXghJ2BU4k/GkkNmpF/RvQzTSQg1CVA58TGhYmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b30f0505a615534c94c29d47170ceed979a43b6565179dd255d70380e03ec2a5","last_reissued_at":"2026-07-04T23:53:20.997595Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:53:20.997595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.04129","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T23:53:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cIk3qkW9SfoRmhlzkkObECDLyzh+HuQE/FoarmnMTzqlRYcXfB80k4Iv2237KZGqASDXd8+fyEKucQ5KUhH3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T21:07:52.441605Z"},"content_sha256":"fef3832abe8013a855dacc5717d48ee1d2127132cdf3a690a3002eecac159fc7","schema_version":"1.0","event_id":"sha256:fef3832abe8013a855dacc5717d48ee1d2127132cdf3a690a3002eecac159fc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WMHQKBNGCVJUZFGCTVDRODHO3F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the anti-Ramsey number of forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chunqiu Fang, Ervin Gy\\H{o}ri, Jimeng Xiao, Mei Lu","submitted_at":"2019-08-12T12:51:34Z","abstract_excerpt":"We call a subgraph of an edge-colored graph rainbow subgraph, if all of its edges have different colors. The anti-Ramsey number of a graph $G$ in a complete graph $K_{n}$, denoted by $ar(K_{n}, G)$, is the maximum number of colors in an edge-coloring of $K_{n}$ with no rainbow subgraph copy of $G$. In this paper, we determine the exact value of the anti-Ramsey number for star forests and the approximate value of the anti-Ramsey number for linear forests. Furthermore, we compute the exact value of $ar(K_{n}, 2P_{4})$ for $n\\ge 8$ and $ar(K_{n}, S_{p,q})$ for large $n$, where $S_{p,q}$ is the do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04129","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/1908.04129/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T23:53:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4HuwhWxWU35V+pe67ok0/jRDkaiOr1hvR6sfnXppRy/g0eElAF9YBS2PnIZAjlmGhGKRxZ3APLHz9VBRwu4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T21:07:52.442135Z"},"content_sha256":"42a7ff0417cfd2178314f02578119998cbbe7e84e06c038d45e937687053d6d4","schema_version":"1.0","event_id":"sha256:42a7ff0417cfd2178314f02578119998cbbe7e84e06c038d45e937687053d6d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMHQKBNGCVJUZFGCTVDRODHO3F/bundle.json","state_url":"https://pith.science/pith/WMHQKBNGCVJUZFGCTVDRODHO3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMHQKBNGCVJUZFGCTVDRODHO3F/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T21:07:52Z","links":{"resolver":"https://pith.science/pith/WMHQKBNGCVJUZFGCTVDRODHO3F","bundle":"https://pith.science/pith/WMHQKBNGCVJUZFGCTVDRODHO3F/bundle.json","state":"https://pith.science/pith/WMHQKBNGCVJUZFGCTVDRODHO3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMHQKBNGCVJUZFGCTVDRODHO3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WMHQKBNGCVJUZFGCTVDRODHO3F","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":"c2970df0d4ac70a209913f156e97caf85f3b9b0d0c9ee0096b5929774605ee00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-12T12:51:34Z","title_canon_sha256":"f42cc0bab31078de07dbfb4a1dd9d3c3c40b0de22e7a8cbc28f986ba13f21f17"},"schema_version":"1.0","source":{"id":"1908.04129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04129","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04129v1","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04129","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"pith_short_12","alias_value":"WMHQKBNGCVJU","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"pith_short_16","alias_value":"WMHQKBNGCVJUZFGC","created_at":"2026-07-04T23:53:20Z"},{"alias_kind":"pith_short_8","alias_value":"WMHQKBNG","created_at":"2026-07-04T23:53:20Z"}],"graph_snapshots":[{"event_id":"sha256:42a7ff0417cfd2178314f02578119998cbbe7e84e06c038d45e937687053d6d4","target":"graph","created_at":"2026-07-04T23:53:20Z","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/1908.04129/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We call a subgraph of an edge-colored graph rainbow subgraph, if all of its edges have different colors. The anti-Ramsey number of a graph $G$ in a complete graph $K_{n}$, denoted by $ar(K_{n}, G)$, is the maximum number of colors in an edge-coloring of $K_{n}$ with no rainbow subgraph copy of $G$. In this paper, we determine the exact value of the anti-Ramsey number for star forests and the approximate value of the anti-Ramsey number for linear forests. Furthermore, we compute the exact value of $ar(K_{n}, 2P_{4})$ for $n\\ge 8$ and $ar(K_{n}, S_{p,q})$ for large $n$, where $S_{p,q}$ is the do","authors_text":"Chunqiu Fang, Ervin Gy\\H{o}ri, Jimeng Xiao, Mei Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-12T12:51:34Z","title":"On the anti-Ramsey number of forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04129","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:fef3832abe8013a855dacc5717d48ee1d2127132cdf3a690a3002eecac159fc7","target":"record","created_at":"2026-07-04T23:53:20Z","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":"c2970df0d4ac70a209913f156e97caf85f3b9b0d0c9ee0096b5929774605ee00","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-12T12:51:34Z","title_canon_sha256":"f42cc0bab31078de07dbfb4a1dd9d3c3c40b0de22e7a8cbc28f986ba13f21f17"},"schema_version":"1.0","source":{"id":"1908.04129","kind":"arxiv","version":1}},"canonical_sha256":"b30f0505a615534c94c29d47170ceed979a43b6565179dd255d70380e03ec2a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b30f0505a615534c94c29d47170ceed979a43b6565179dd255d70380e03ec2a5","first_computed_at":"2026-07-04T23:53:20.997595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:53:20.997595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lhh3KWOuYylJ3YpkBtCF37fEVP1FnUQg5MEs5sKLC3jS+4LXghJ2BU4k/GkkNmpF/RvQzTSQg1CVA58TGhYmBA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:53:20.998088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fef3832abe8013a855dacc5717d48ee1d2127132cdf3a690a3002eecac159fc7","sha256:42a7ff0417cfd2178314f02578119998cbbe7e84e06c038d45e937687053d6d4"],"state_sha256":"50f5611b64a7eb5ea269438c36e1c49ab1bc77a218f35a0f249a9ccb38c4828a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n25tWMOeVVoPcWWwcG199uiZzR9zuo5hnq8mg0OvMMEtwdUgMNAUPfD4OT2DFLO6iJYqnuAvVBo47zf0bjbyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T21:07:52.447906Z","bundle_sha256":"e8d69d16d13a21ce9906db06210e6ad6ec79376678b146bab20fb2602a0b3683"}}