{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JKLZATWVCUXHMY7726QJ7LT7CR","short_pith_number":"pith:JKLZATWV","canonical_record":{"source":{"id":"1801.02023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-06T14:43:01Z","cross_cats_sorted":[],"title_canon_sha256":"e0f43752f90f0c01bb3f5e35534c31f5cadfbc8c65c27bee203b4e2d0e5756f0","abstract_canon_sha256":"9f7f449bff9695f2e013371287b8b303da8959a244f4d131741f9fb0f680ba91"},"schema_version":"1.0"},"canonical_sha256":"4a97904ed5152e7663ffd7a09fae7f14568dc75f76adfd2ee5eb948babd5ec7a","source":{"kind":"arxiv","id":"1801.02023","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02023","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02023v1","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02023","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"pith_short_12","alias_value":"JKLZATWVCUXH","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JKLZATWVCUXHMY77","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JKLZATWV","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JKLZATWVCUXHMY7726QJ7LT7CR","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-06T14:43:01Z","cross_cats_sorted":[],"title_canon_sha256":"e0f43752f90f0c01bb3f5e35534c31f5cadfbc8c65c27bee203b4e2d0e5756f0","abstract_canon_sha256":"9f7f449bff9695f2e013371287b8b303da8959a244f4d131741f9fb0f680ba91"},"schema_version":"1.0"},"canonical_sha256":"4a97904ed5152e7663ffd7a09fae7f14568dc75f76adfd2ee5eb948babd5ec7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:35.150641Z","signature_b64":"lRqQb6R9WfuMuc/9aR5YYcR/IXjWbBlVBhowf507Xvew9gli3CagamQy+4QI43IoFiqmnnnu1dyBetTnHSqcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a97904ed5152e7663ffd7a09fae7f14568dc75f76adfd2ee5eb948babd5ec7a","last_reissued_at":"2026-05-18T00:26:35.149994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:35.149994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02023","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-18T00:26:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"adNi54u2A0GsNS7PO0WVl1v3txvZ/wwFOiiw2UQ07L3OsFjkOTUzqTYTiTOmppRiG8xgPjRpXQzNRcKMG/g6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:12:18.936453Z"},"content_sha256":"24084b53010e09ff46efca6b4bbd66400723cf1954923facb205b46b8a010dc7","schema_version":"1.0","event_id":"sha256:24084b53010e09ff46efca6b4bbd66400723cf1954923facb205b46b8a010dc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JKLZATWVCUXHMY7726QJ7LT7CR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Degree powers in graphs with a forbidden forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henry Liu, Yongtang Shi, Yongxin Lan, Zhongmei Qin","submitted_at":"2018-01-06T14:43:01Z","abstract_excerpt":"Given a positive integer $p$ and a graph $G$ with degree sequence $d_1,\\dots,d_n$, we define $e_p(G)=\\sum_{i=1}^n d_i^p$. Caro and Yuster introduced a Tur\\'an-type problem for $e_p(G)$: Given a positive integer $p$ and a graph $H$, determine the function $ex_p(n,H)$, which is the maximum value of $e_p(G)$ taken over all graphs $G$ on $n$ vertices that do not contain $H$ as a subgraph. Clearly, $ex_1(n,H)=2ex(n,H)$, where $ex(n,H)$ denotes the classical Tur\\'an number. Caro and Yuster determined the function $ex_p(n, P_\\ell)$ for sufficiently large $n$, where $p\\geq 2$ and $P_\\ell$ denotes the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02023","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-18T00:26:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAiO4GXJ2pYdooEjzm6HZJHGViKTMCuYEq9aTjbBaLMMkTGcDIhdKrsMgGHqOHwe0bOJqOu3Yyr23A8lcX2cCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:12:18.936786Z"},"content_sha256":"54fe31b59a0a56ab2d2d93c040ff91b769848ed8aafb6ea164213c4585e651fa","schema_version":"1.0","event_id":"sha256:54fe31b59a0a56ab2d2d93c040ff91b769848ed8aafb6ea164213c4585e651fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKLZATWVCUXHMY7726QJ7LT7CR/bundle.json","state_url":"https://pith.science/pith/JKLZATWVCUXHMY7726QJ7LT7CR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKLZATWVCUXHMY7726QJ7LT7CR/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-06-03T08:12:18Z","links":{"resolver":"https://pith.science/pith/JKLZATWVCUXHMY7726QJ7LT7CR","bundle":"https://pith.science/pith/JKLZATWVCUXHMY7726QJ7LT7CR/bundle.json","state":"https://pith.science/pith/JKLZATWVCUXHMY7726QJ7LT7CR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKLZATWVCUXHMY7726QJ7LT7CR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JKLZATWVCUXHMY7726QJ7LT7CR","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":"9f7f449bff9695f2e013371287b8b303da8959a244f4d131741f9fb0f680ba91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-06T14:43:01Z","title_canon_sha256":"e0f43752f90f0c01bb3f5e35534c31f5cadfbc8c65c27bee203b4e2d0e5756f0"},"schema_version":"1.0","source":{"id":"1801.02023","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02023","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02023v1","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02023","created_at":"2026-05-18T00:26:35Z"},{"alias_kind":"pith_short_12","alias_value":"JKLZATWVCUXH","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JKLZATWVCUXHMY77","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JKLZATWV","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:54fe31b59a0a56ab2d2d93c040ff91b769848ed8aafb6ea164213c4585e651fa","target":"graph","created_at":"2026-05-18T00:26:35Z","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":"Given a positive integer $p$ and a graph $G$ with degree sequence $d_1,\\dots,d_n$, we define $e_p(G)=\\sum_{i=1}^n d_i^p$. Caro and Yuster introduced a Tur\\'an-type problem for $e_p(G)$: Given a positive integer $p$ and a graph $H$, determine the function $ex_p(n,H)$, which is the maximum value of $e_p(G)$ taken over all graphs $G$ on $n$ vertices that do not contain $H$ as a subgraph. Clearly, $ex_1(n,H)=2ex(n,H)$, where $ex(n,H)$ denotes the classical Tur\\'an number. Caro and Yuster determined the function $ex_p(n, P_\\ell)$ for sufficiently large $n$, where $p\\geq 2$ and $P_\\ell$ denotes the ","authors_text":"Henry Liu, Yongtang Shi, Yongxin Lan, Zhongmei Qin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-06T14:43:01Z","title":"Degree powers in graphs with a forbidden forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02023","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:24084b53010e09ff46efca6b4bbd66400723cf1954923facb205b46b8a010dc7","target":"record","created_at":"2026-05-18T00:26:35Z","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":"9f7f449bff9695f2e013371287b8b303da8959a244f4d131741f9fb0f680ba91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-06T14:43:01Z","title_canon_sha256":"e0f43752f90f0c01bb3f5e35534c31f5cadfbc8c65c27bee203b4e2d0e5756f0"},"schema_version":"1.0","source":{"id":"1801.02023","kind":"arxiv","version":1}},"canonical_sha256":"4a97904ed5152e7663ffd7a09fae7f14568dc75f76adfd2ee5eb948babd5ec7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a97904ed5152e7663ffd7a09fae7f14568dc75f76adfd2ee5eb948babd5ec7a","first_computed_at":"2026-05-18T00:26:35.149994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:35.149994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lRqQb6R9WfuMuc/9aR5YYcR/IXjWbBlVBhowf507Xvew9gli3CagamQy+4QI43IoFiqmnnnu1dyBetTnHSqcDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:35.150641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02023","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24084b53010e09ff46efca6b4bbd66400723cf1954923facb205b46b8a010dc7","sha256:54fe31b59a0a56ab2d2d93c040ff91b769848ed8aafb6ea164213c4585e651fa"],"state_sha256":"24ba83eb11ab6bd71584ea3049a695cc77a4acef659f1997f668a9f3a178f387"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gv/onD35GM/mEwLlSLSOeFlTPp7HqZ6gs4/HoIW/vd2lU6QjSae7gI+T0hZrGDo4swqcMchXepzpzkbJVr+nBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:12:18.938722Z","bundle_sha256":"8aa360b8d0a30304c6bbe6cd909fe6b16d9d3912c87c064e33ef5b97889d5971"}}