{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:IM556UDMI3BTID4HV2PUVWGHT7","short_pith_number":"pith:IM556UDM","schema_version":"1.0","canonical_sha256":"433bdf506c46c3340f87ae9f4ad8c79ff3bface9d6d1827b1618bdbf74cbcb4d","source":{"kind":"arxiv","id":"math/0401398","version":1},"attestation_state":"computed","paper":{"title":"A Tur\\'{a}n Type Problem Concerning the Powers of the Degrees of a Graph (revised)","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"R. Yuster, Y. Caro","submitted_at":"2004-01-28T16:15:25Z","abstract_excerpt":"For a graph $G$ whose degree sequence is $d_{1},..., d_{n}$, and for a positive integer $p$, let $e_{p}(G)=\\sum_{i=1}^{n}d_{i}^{p}$. For a fixed graph $H$, let $t_{p}(n,H)$ denote the maximum value of $e_{p}(G)$ taken over all graphs with $n$ vertices that do not contain $H$ as a subgraph. Clearly, $t_{1}(n,H)$ is twice the Tur\\'{a}n number of $H$. In this paper we consider the case $p>1$. For some graphs $H$ we obtain exact results, for some others we can obtain asymptotically tight upper and lower bounds, and many interesting cases remain open."},"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":"math/0401398","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2004-01-28T16:15:25Z","cross_cats_sorted":[],"title_canon_sha256":"b0d4446d7c3d9a74cd12032a87fc589000de5e839cc57b9c490a6c569e4e6f60","abstract_canon_sha256":"b0512ed93a61df8b9808c62f0506bd0caa630cdedb607ed744ad6c68b3b0e949"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:38:11.801827Z","signature_b64":"4/v3kBIc/7AxuHKkKN1urwQJbuSy6//Ef6AVNu4RgyUaGJhlUhuqH8GMe6XbZuo55BFIlfdCPRNLCaenH9dECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"433bdf506c46c3340f87ae9f4ad8c79ff3bface9d6d1827b1618bdbf74cbcb4d","last_reissued_at":"2026-07-04T14:38:11.801415Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:38:11.801415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tur\\'{a}n Type Problem Concerning the Powers of the Degrees of a Graph (revised)","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"R. Yuster, Y. Caro","submitted_at":"2004-01-28T16:15:25Z","abstract_excerpt":"For a graph $G$ whose degree sequence is $d_{1},..., d_{n}$, and for a positive integer $p$, let $e_{p}(G)=\\sum_{i=1}^{n}d_{i}^{p}$. For a fixed graph $H$, let $t_{p}(n,H)$ denote the maximum value of $e_{p}(G)$ taken over all graphs with $n$ vertices that do not contain $H$ as a subgraph. Clearly, $t_{1}(n,H)$ is twice the Tur\\'{a}n number of $H$. In this paper we consider the case $p>1$. For some graphs $H$ we obtain exact results, for some others we can obtain asymptotically tight upper and lower bounds, and many interesting cases remain open."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0401398","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/math/0401398/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0401398","created_at":"2026-07-04T14:38:11.801479+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0401398v1","created_at":"2026-07-04T14:38:11.801479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0401398","created_at":"2026-07-04T14:38:11.801479+00:00"},{"alias_kind":"pith_short_12","alias_value":"IM556UDMI3BT","created_at":"2026-07-04T14:38:11.801479+00:00"},{"alias_kind":"pith_short_16","alias_value":"IM556UDMI3BTID4H","created_at":"2026-07-04T14:38:11.801479+00:00"},{"alias_kind":"pith_short_8","alias_value":"IM556UDM","created_at":"2026-07-04T14:38:11.801479+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.02110","citing_title":"On cliques in hypergraphs under bounded $(j,p)$-norm","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IM556UDMI3BTID4HV2PUVWGHT7","json":"https://pith.science/pith/IM556UDMI3BTID4HV2PUVWGHT7.json","graph_json":"https://pith.science/api/pith-number/IM556UDMI3BTID4HV2PUVWGHT7/graph.json","events_json":"https://pith.science/api/pith-number/IM556UDMI3BTID4HV2PUVWGHT7/events.json","paper":"https://pith.science/paper/IM556UDM"},"agent_actions":{"view_html":"https://pith.science/pith/IM556UDMI3BTID4HV2PUVWGHT7","download_json":"https://pith.science/pith/IM556UDMI3BTID4HV2PUVWGHT7.json","view_paper":"https://pith.science/paper/IM556UDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0401398&json=true","fetch_graph":"https://pith.science/api/pith-number/IM556UDMI3BTID4HV2PUVWGHT7/graph.json","fetch_events":"https://pith.science/api/pith-number/IM556UDMI3BTID4HV2PUVWGHT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IM556UDMI3BTID4HV2PUVWGHT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IM556UDMI3BTID4HV2PUVWGHT7/action/storage_attestation","attest_author":"https://pith.science/pith/IM556UDMI3BTID4HV2PUVWGHT7/action/author_attestation","sign_citation":"https://pith.science/pith/IM556UDMI3BTID4HV2PUVWGHT7/action/citation_signature","submit_replication":"https://pith.science/pith/IM556UDMI3BTID4HV2PUVWGHT7/action/replication_record"}},"created_at":"2026-07-04T14:38:11.801479+00:00","updated_at":"2026-07-04T14:38:11.801479+00:00"}