{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JKLZATWVCUXHMY7726QJ7LT7CR","short_pith_number":"pith:JKLZATWV","schema_version":"1.0","canonical_sha256":"4a97904ed5152e7663ffd7a09fae7f14568dc75f76adfd2ee5eb948babd5ec7a","source":{"kind":"arxiv","id":"1801.02023","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.02023","created_at":"2026-05-18T00:26:35.150080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02023v1","created_at":"2026-05-18T00:26:35.150080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02023","created_at":"2026-05-18T00:26:35.150080+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKLZATWVCUXH","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKLZATWVCUXHMY77","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKLZATWV","created_at":"2026-05-18T12:32:31.084164+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/JKLZATWVCUXHMY7726QJ7LT7CR","json":"https://pith.science/pith/JKLZATWVCUXHMY7726QJ7LT7CR.json","graph_json":"https://pith.science/api/pith-number/JKLZATWVCUXHMY7726QJ7LT7CR/graph.json","events_json":"https://pith.science/api/pith-number/JKLZATWVCUXHMY7726QJ7LT7CR/events.json","paper":"https://pith.science/paper/JKLZATWV"},"agent_actions":{"view_html":"https://pith.science/pith/JKLZATWVCUXHMY7726QJ7LT7CR","download_json":"https://pith.science/pith/JKLZATWVCUXHMY7726QJ7LT7CR.json","view_paper":"https://pith.science/paper/JKLZATWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02023&json=true","fetch_graph":"https://pith.science/api/pith-number/JKLZATWVCUXHMY7726QJ7LT7CR/graph.json","fetch_events":"https://pith.science/api/pith-number/JKLZATWVCUXHMY7726QJ7LT7CR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKLZATWVCUXHMY7726QJ7LT7CR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKLZATWVCUXHMY7726QJ7LT7CR/action/storage_attestation","attest_author":"https://pith.science/pith/JKLZATWVCUXHMY7726QJ7LT7CR/action/author_attestation","sign_citation":"https://pith.science/pith/JKLZATWVCUXHMY7726QJ7LT7CR/action/citation_signature","submit_replication":"https://pith.science/pith/JKLZATWVCUXHMY7726QJ7LT7CR/action/replication_record"}},"created_at":"2026-05-18T00:26:35.150080+00:00","updated_at":"2026-05-18T00:26:35.150080+00:00"}