{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ST5CFEOEWVFBHNYH2JFPNVKG6L","short_pith_number":"pith:ST5CFEOE","schema_version":"1.0","canonical_sha256":"94fa2291c4b54a13b707d24af6d546f2d58b83403f20be3986cab2d8e0389aee","source":{"kind":"arxiv","id":"1712.04388","version":1},"attestation_state":"computed","paper":{"title":"An Erd\\H{o}s-Gallai type theorem for vertex colored graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Casey Tompkins, Nika Salia, Oscar Zamora","submitted_at":"2017-12-12T16:54:44Z","abstract_excerpt":"While investigating odd-cycle free hypergraphs, Gy\\H{o}ri and Lemons introduced a colored version of the classical theorem of Erd\\H{o}s and Gallai on $P_k$-free graphs. They proved that any graph $G$ with a proper vertex coloring and no path of length $2k+1$ with endpoints of different colors has at most $2kn$ edges. We show that Erd\\H{o}s and Gallai's original sharp upper bound of $kn$ holds for their problem as well. We also introduce a version of this problem for trees and present a generalization of the Erd\\H{o}s-S\\'os conjecture."},"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":"1712.04388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-12T16:54:44Z","cross_cats_sorted":[],"title_canon_sha256":"277b6ccc31371996271a9a5d0861c812614817435115be99752174c79bb16495","abstract_canon_sha256":"026699e77908e20d05268d7764628ec33578cbbee87b585b515c66edb97ec6ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:56.193426Z","signature_b64":"lefwsPJuxDYU1zWOTb/aLbrFzK3CL+o/I4j+6og9okHHTj8iVWdIJxe733TxBda7dwrZgXXPjQHL/OTVk1zxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94fa2291c4b54a13b707d24af6d546f2d58b83403f20be3986cab2d8e0389aee","last_reissued_at":"2026-05-17T23:40:56.192750Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:56.192750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Erd\\H{o}s-Gallai type theorem for vertex colored graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Casey Tompkins, Nika Salia, Oscar Zamora","submitted_at":"2017-12-12T16:54:44Z","abstract_excerpt":"While investigating odd-cycle free hypergraphs, Gy\\H{o}ri and Lemons introduced a colored version of the classical theorem of Erd\\H{o}s and Gallai on $P_k$-free graphs. They proved that any graph $G$ with a proper vertex coloring and no path of length $2k+1$ with endpoints of different colors has at most $2kn$ edges. We show that Erd\\H{o}s and Gallai's original sharp upper bound of $kn$ holds for their problem as well. We also introduce a version of this problem for trees and present a generalization of the Erd\\H{o}s-S\\'os conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04388","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":""},"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":"1712.04388","created_at":"2026-05-17T23:40:56.192862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04388v1","created_at":"2026-05-17T23:40:56.192862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04388","created_at":"2026-05-17T23:40:56.192862+00:00"},{"alias_kind":"pith_short_12","alias_value":"ST5CFEOEWVFB","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"ST5CFEOEWVFBHNYH","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"ST5CFEOE","created_at":"2026-05-18T12:31:43.269735+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/ST5CFEOEWVFBHNYH2JFPNVKG6L","json":"https://pith.science/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L.json","graph_json":"https://pith.science/api/pith-number/ST5CFEOEWVFBHNYH2JFPNVKG6L/graph.json","events_json":"https://pith.science/api/pith-number/ST5CFEOEWVFBHNYH2JFPNVKG6L/events.json","paper":"https://pith.science/paper/ST5CFEOE"},"agent_actions":{"view_html":"https://pith.science/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L","download_json":"https://pith.science/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L.json","view_paper":"https://pith.science/paper/ST5CFEOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04388&json=true","fetch_graph":"https://pith.science/api/pith-number/ST5CFEOEWVFBHNYH2JFPNVKG6L/graph.json","fetch_events":"https://pith.science/api/pith-number/ST5CFEOEWVFBHNYH2JFPNVKG6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L/action/storage_attestation","attest_author":"https://pith.science/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L/action/author_attestation","sign_citation":"https://pith.science/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L/action/citation_signature","submit_replication":"https://pith.science/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L/action/replication_record"}},"created_at":"2026-05-17T23:40:56.192862+00:00","updated_at":"2026-05-17T23:40:56.192862+00:00"}