{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ST5CFEOEWVFBHNYH2JFPNVKG6L","short_pith_number":"pith:ST5CFEOE","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"},"canonical_sha256":"94fa2291c4b54a13b707d24af6d546f2d58b83403f20be3986cab2d8e0389aee","source":{"kind":"arxiv","id":"1712.04388","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04388","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04388v1","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04388","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"ST5CFEOEWVFB","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"ST5CFEOEWVFBHNYH","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"ST5CFEOE","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ST5CFEOEWVFBHNYH2JFPNVKG6L","target":"record","payload":{"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"},"canonical_sha256":"94fa2291c4b54a13b707d24af6d546f2d58b83403f20be3986cab2d8e0389aee","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"},"source_kind":"arxiv","source_id":"1712.04388","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-05-17T23:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNeA6m7bNBbuAAwhOMqC6MmkxboSmWbD+ZASVMDQWRJSzTEgynEKDjfncE07hpdW9Z/L8xdVE6+wlkKOfpSWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:04:41.827649Z"},"content_sha256":"f1f5ea556fc259d2f87c21b2910c6e0cd5d69779dd199537e82fbd01194b618e","schema_version":"1.0","event_id":"sha256:f1f5ea556fc259d2f87c21b2910c6e0cd5d69779dd199537e82fbd01194b618e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ST5CFEOEWVFBHNYH2JFPNVKG6L","target":"graph","payload":{"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"},"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-05-17T23:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oy+ghwiYNQ7ybWHnMKa5Gvjjrh+nWA+AWiB/5/DplWtuo88jOgOUCCdPceCFnuCWei6bHaqDPKpxK7a50X+FBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:04:41.828049Z"},"content_sha256":"7af50e10b1df3b2c9e88691a0fb3a9455bf9dd6a2538c616775da9a887a9ec98","schema_version":"1.0","event_id":"sha256:7af50e10b1df3b2c9e88691a0fb3a9455bf9dd6a2538c616775da9a887a9ec98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L/bundle.json","state_url":"https://pith.science/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L/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-05-27T07:04:41Z","links":{"resolver":"https://pith.science/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L","bundle":"https://pith.science/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L/bundle.json","state":"https://pith.science/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ST5CFEOEWVFBHNYH2JFPNVKG6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ST5CFEOEWVFBHNYH2JFPNVKG6L","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":"026699e77908e20d05268d7764628ec33578cbbee87b585b515c66edb97ec6ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-12T16:54:44Z","title_canon_sha256":"277b6ccc31371996271a9a5d0861c812614817435115be99752174c79bb16495"},"schema_version":"1.0","source":{"id":"1712.04388","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.04388","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1712.04388v1","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04388","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"ST5CFEOEWVFB","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"ST5CFEOEWVFBHNYH","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"ST5CFEOE","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:7af50e10b1df3b2c9e88691a0fb3a9455bf9dd6a2538c616775da9a887a9ec98","target":"graph","created_at":"2026-05-17T23:40:56Z","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":"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.","authors_text":"Casey Tompkins, Nika Salia, Oscar Zamora","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-12T16:54:44Z","title":"An Erd\\H{o}s-Gallai type theorem for vertex colored graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04388","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:f1f5ea556fc259d2f87c21b2910c6e0cd5d69779dd199537e82fbd01194b618e","target":"record","created_at":"2026-05-17T23:40:56Z","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":"026699e77908e20d05268d7764628ec33578cbbee87b585b515c66edb97ec6ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-12T16:54:44Z","title_canon_sha256":"277b6ccc31371996271a9a5d0861c812614817435115be99752174c79bb16495"},"schema_version":"1.0","source":{"id":"1712.04388","kind":"arxiv","version":1}},"canonical_sha256":"94fa2291c4b54a13b707d24af6d546f2d58b83403f20be3986cab2d8e0389aee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94fa2291c4b54a13b707d24af6d546f2d58b83403f20be3986cab2d8e0389aee","first_computed_at":"2026-05-17T23:40:56.192750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:56.192750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lefwsPJuxDYU1zWOTb/aLbrFzK3CL+o/I4j+6og9okHHTj8iVWdIJxe733TxBda7dwrZgXXPjQHL/OTVk1zxAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:56.193426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.04388","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1f5ea556fc259d2f87c21b2910c6e0cd5d69779dd199537e82fbd01194b618e","sha256:7af50e10b1df3b2c9e88691a0fb3a9455bf9dd6a2538c616775da9a887a9ec98"],"state_sha256":"0ff56e57b5a0bc32f9843ebb483605f9e42c6150098a97bf027836e354437e07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m/nBFlZxauycyPYC6P1FpvDrlR19ad1xpfB8T9+/pQDUCm4IhYBQjrMbR4ga+o0l7nFalP1S/gKcUel3qUxXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:04:41.830422Z","bundle_sha256":"dbedb449745438a940a71b92638e7adfe3a2ffc5cc81d6d208098d21f3f89038"}}