{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MDLTJFAV5PRNWVJRAS4TLGFT3V","short_pith_number":"pith:MDLTJFAV","schema_version":"1.0","canonical_sha256":"60d7349415ebe2db553104b93598b3dd7c302f296882497d0dd3446c501364de","source":{"kind":"arxiv","id":"1304.1680","version":2},"attestation_state":"computed","paper":{"title":"Degree powers in $C_5$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ran Gu, Xueliang Li, Yongtang Shi","submitted_at":"2013-04-05T11:12:14Z","abstract_excerpt":"Let $G$ be a graph with degree sequence $d_1,d_2,\\ldots,d_n$. Given a positive integer $p$, denote by $e_p(G)=\\sum_{i=1}^n d_i^p$. Caro and Yuster introduced a Tur\\'an-type problem for $e_p(G)$: given an integer $p$, how large can $e_p(G)$ be if $G$ has no subgraph of a particular type. They got some results for the subgraph of particular type to be a clique of order $r+1$ and a cycle of even length, respectively. Denote by $ex_p(n,H)$ the maximum value of $e_p(G)$ taken over all graphs with $n$ vertices that do not contain $H$ as a subgraph. Clearly, $ex_1(n,H)=2ex(n,H)$, where $ex(n,H)$ deno"},"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":"1304.1680","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-05T11:12:14Z","cross_cats_sorted":[],"title_canon_sha256":"8cb19375ae904c8a73dc1325b7952f6e4e6f14271d0f561f7d75f2e3feb42e29","abstract_canon_sha256":"47cd30e9fb82482ec234520376b88362abbf4c29f1055a428bd38423e6bd79cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:45.625596Z","signature_b64":"Ax9Hgv02p6ReyRNN/+puTVHGKEGKHONlQoYbIcFIxUbYgZpeZ5Jg2jF5PtiuK9MY3S6MC5nUCEuKndX6Gz+kBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60d7349415ebe2db553104b93598b3dd7c302f296882497d0dd3446c501364de","last_reissued_at":"2026-05-18T03:25:45.624657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:45.624657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degree powers in $C_5$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ran Gu, Xueliang Li, Yongtang Shi","submitted_at":"2013-04-05T11:12:14Z","abstract_excerpt":"Let $G$ be a graph with degree sequence $d_1,d_2,\\ldots,d_n$. Given a positive integer $p$, denote by $e_p(G)=\\sum_{i=1}^n d_i^p$. Caro and Yuster introduced a Tur\\'an-type problem for $e_p(G)$: given an integer $p$, how large can $e_p(G)$ be if $G$ has no subgraph of a particular type. They got some results for the subgraph of particular type to be a clique of order $r+1$ and a cycle of even length, respectively. Denote by $ex_p(n,H)$ the maximum value of $e_p(G)$ taken over all graphs with $n$ vertices that do not contain $H$ as a subgraph. Clearly, $ex_1(n,H)=2ex(n,H)$, where $ex(n,H)$ deno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1680","kind":"arxiv","version":2},"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":"1304.1680","created_at":"2026-05-18T03:25:45.624827+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1680v2","created_at":"2026-05-18T03:25:45.624827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1680","created_at":"2026-05-18T03:25:45.624827+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDLTJFAV5PRN","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDLTJFAV5PRNWVJR","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDLTJFAV","created_at":"2026-05-18T12:27:52.871228+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/MDLTJFAV5PRNWVJRAS4TLGFT3V","json":"https://pith.science/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V.json","graph_json":"https://pith.science/api/pith-number/MDLTJFAV5PRNWVJRAS4TLGFT3V/graph.json","events_json":"https://pith.science/api/pith-number/MDLTJFAV5PRNWVJRAS4TLGFT3V/events.json","paper":"https://pith.science/paper/MDLTJFAV"},"agent_actions":{"view_html":"https://pith.science/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V","download_json":"https://pith.science/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V.json","view_paper":"https://pith.science/paper/MDLTJFAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1680&json=true","fetch_graph":"https://pith.science/api/pith-number/MDLTJFAV5PRNWVJRAS4TLGFT3V/graph.json","fetch_events":"https://pith.science/api/pith-number/MDLTJFAV5PRNWVJRAS4TLGFT3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V/action/storage_attestation","attest_author":"https://pith.science/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V/action/author_attestation","sign_citation":"https://pith.science/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V/action/citation_signature","submit_replication":"https://pith.science/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V/action/replication_record"}},"created_at":"2026-05-18T03:25:45.624827+00:00","updated_at":"2026-05-18T03:25:45.624827+00:00"}