{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:A4R7FF6YKLQDKIOG4MSNYCYMIT","short_pith_number":"pith:A4R7FF6Y","schema_version":"1.0","canonical_sha256":"0723f297d852e03521c6e324dc0b0c44d8ffc35408e5012ca9925dd285b9beaa","source":{"kind":"arxiv","id":"1302.1687","version":1},"attestation_state":"computed","paper":{"title":"A Tur\\'an-type problem on degree sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yongtang Shi","submitted_at":"2013-02-07T10:07:06Z","abstract_excerpt":"Given $p\\geq 0$ and a graph $G$ whose degree sequence is $d_1,d_2,\\ldots,d_n$, let $e_p(G)=\\sum_{i=1}^n d_i^p$. Caro and Yuster introduced a Tur\\'an-type problem for $e_p(G)$: given $p\\geq 0$, how large can $e_p(G)$ be if $G$ has no subgraph of a particular type. 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)$ denotes the classical Tur\\'an number, i.e., the maximum number of edges among all $H$-free graphs with $n$ vertices. Pikhurko and Taraz generalize this Tur\\'a"},"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":"1302.1687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-07T10:07:06Z","cross_cats_sorted":[],"title_canon_sha256":"13418243b270f7dc3620ad25c10fc6c0426d65356501f1bc8a3b89b1847c3274","abstract_canon_sha256":"cc526d38834bafd56658afdc84db7afd822fbbaf2f19de37ab892897bde42ced"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:15.003915Z","signature_b64":"QyZ1eO2ngaHRSH6akn1rVodH2HdREcC1i6ypKhRj1Y/gOkC3if+5/LJIov86QP5OWah4RacvEPs/0n2ITX5DAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0723f297d852e03521c6e324dc0b0c44d8ffc35408e5012ca9925dd285b9beaa","last_reissued_at":"2026-05-18T03:34:15.003115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:15.003115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tur\\'an-type problem on degree sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yongtang Shi","submitted_at":"2013-02-07T10:07:06Z","abstract_excerpt":"Given $p\\geq 0$ and a graph $G$ whose degree sequence is $d_1,d_2,\\ldots,d_n$, let $e_p(G)=\\sum_{i=1}^n d_i^p$. Caro and Yuster introduced a Tur\\'an-type problem for $e_p(G)$: given $p\\geq 0$, how large can $e_p(G)$ be if $G$ has no subgraph of a particular type. 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)$ denotes the classical Tur\\'an number, i.e., the maximum number of edges among all $H$-free graphs with $n$ vertices. Pikhurko and Taraz generalize this Tur\\'a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1687","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":"1302.1687","created_at":"2026-05-18T03:34:15.003246+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.1687v1","created_at":"2026-05-18T03:34:15.003246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1687","created_at":"2026-05-18T03:34:15.003246+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4R7FF6YKLQD","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4R7FF6YKLQDKIOG","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4R7FF6Y","created_at":"2026-05-18T12:27:38.830355+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/A4R7FF6YKLQDKIOG4MSNYCYMIT","json":"https://pith.science/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT.json","graph_json":"https://pith.science/api/pith-number/A4R7FF6YKLQDKIOG4MSNYCYMIT/graph.json","events_json":"https://pith.science/api/pith-number/A4R7FF6YKLQDKIOG4MSNYCYMIT/events.json","paper":"https://pith.science/paper/A4R7FF6Y"},"agent_actions":{"view_html":"https://pith.science/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT","download_json":"https://pith.science/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT.json","view_paper":"https://pith.science/paper/A4R7FF6Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.1687&json=true","fetch_graph":"https://pith.science/api/pith-number/A4R7FF6YKLQDKIOG4MSNYCYMIT/graph.json","fetch_events":"https://pith.science/api/pith-number/A4R7FF6YKLQDKIOG4MSNYCYMIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT/action/storage_attestation","attest_author":"https://pith.science/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT/action/author_attestation","sign_citation":"https://pith.science/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT/action/citation_signature","submit_replication":"https://pith.science/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT/action/replication_record"}},"created_at":"2026-05-18T03:34:15.003246+00:00","updated_at":"2026-05-18T03:34:15.003246+00:00"}