{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:A4R7FF6YKLQDKIOG4MSNYCYMIT","short_pith_number":"pith:A4R7FF6Y","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"},"canonical_sha256":"0723f297d852e03521c6e324dc0b0c44d8ffc35408e5012ca9925dd285b9beaa","source":{"kind":"arxiv","id":"1302.1687","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1687","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1687v1","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1687","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"A4R7FF6YKLQD","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A4R7FF6YKLQDKIOG","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A4R7FF6Y","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:A4R7FF6YKLQDKIOG4MSNYCYMIT","target":"record","payload":{"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"},"canonical_sha256":"0723f297d852e03521c6e324dc0b0c44d8ffc35408e5012ca9925dd285b9beaa","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"},"source_kind":"arxiv","source_id":"1302.1687","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-18T03:34:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NVc7jh5RIQ8BEZwhAbwN1g+fUx27zFqVN/mnc2rUQkHoaAcswoTnDgatM65T8oJGI13bTDzMpFxTIJTqm1TXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:05:49.191525Z"},"content_sha256":"5aeb3d02cfe5bfe9ef732bd8830b5fab03eb0f653f2455d21c5f72c110dd1c3c","schema_version":"1.0","event_id":"sha256:5aeb3d02cfe5bfe9ef732bd8830b5fab03eb0f653f2455d21c5f72c110dd1c3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:A4R7FF6YKLQDKIOG4MSNYCYMIT","target":"graph","payload":{"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"},"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-18T03:34:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H7t82XZ3WjqyXxPHbAv6Xzava+2GVzo/y3zplmlgqKWHKgNBAYmPur3OO2nHPVE2hNzdSN7/rBFJrB99PFCADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:05:49.192202Z"},"content_sha256":"c1fe5a9e1a113d66a236f5e9979b4679535da83f3ee243718373c354a650a33e","schema_version":"1.0","event_id":"sha256:c1fe5a9e1a113d66a236f5e9979b4679535da83f3ee243718373c354a650a33e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT/bundle.json","state_url":"https://pith.science/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT/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-05-25T10:05:49Z","links":{"resolver":"https://pith.science/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT","bundle":"https://pith.science/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT/bundle.json","state":"https://pith.science/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A4R7FF6YKLQDKIOG4MSNYCYMIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:A4R7FF6YKLQDKIOG4MSNYCYMIT","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":"cc526d38834bafd56658afdc84db7afd822fbbaf2f19de37ab892897bde42ced","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-07T10:07:06Z","title_canon_sha256":"13418243b270f7dc3620ad25c10fc6c0426d65356501f1bc8a3b89b1847c3274"},"schema_version":"1.0","source":{"id":"1302.1687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1687","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1687v1","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1687","created_at":"2026-05-18T03:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"A4R7FF6YKLQD","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A4R7FF6YKLQDKIOG","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A4R7FF6Y","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:c1fe5a9e1a113d66a236f5e9979b4679535da83f3ee243718373c354a650a33e","target":"graph","created_at":"2026-05-18T03:34:15Z","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 $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","authors_text":"Xueliang Li, Yongtang Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-07T10:07:06Z","title":"A Tur\\'an-type problem on degree sequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1687","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:5aeb3d02cfe5bfe9ef732bd8830b5fab03eb0f653f2455d21c5f72c110dd1c3c","target":"record","created_at":"2026-05-18T03:34:15Z","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":"cc526d38834bafd56658afdc84db7afd822fbbaf2f19de37ab892897bde42ced","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-07T10:07:06Z","title_canon_sha256":"13418243b270f7dc3620ad25c10fc6c0426d65356501f1bc8a3b89b1847c3274"},"schema_version":"1.0","source":{"id":"1302.1687","kind":"arxiv","version":1}},"canonical_sha256":"0723f297d852e03521c6e324dc0b0c44d8ffc35408e5012ca9925dd285b9beaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0723f297d852e03521c6e324dc0b0c44d8ffc35408e5012ca9925dd285b9beaa","first_computed_at":"2026-05-18T03:34:15.003115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:15.003115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QyZ1eO2ngaHRSH6akn1rVodH2HdREcC1i6ypKhRj1Y/gOkC3if+5/LJIov86QP5OWah4RacvEPs/0n2ITX5DAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:15.003915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5aeb3d02cfe5bfe9ef732bd8830b5fab03eb0f653f2455d21c5f72c110dd1c3c","sha256:c1fe5a9e1a113d66a236f5e9979b4679535da83f3ee243718373c354a650a33e"],"state_sha256":"54611c9e7639371e5d9898fc6cc313b03c75ce5a8e208aced3cfced9459c8a57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tdC5AsaxdYq2Ur5Ps0WNkqjWniH+NNcxyhyn7MnokYT7/JDkSON5VbPlbPTyGa/l/a2eAr3n9dFvXNW45SWyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:05:49.195071Z","bundle_sha256":"dec3b15d9d6d464077391b675bc11e441ffa9ba95cd0a96dbf93f9f4de864c75"}}