{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MDLTJFAV5PRNWVJRAS4TLGFT3V","short_pith_number":"pith:MDLTJFAV","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"},"canonical_sha256":"60d7349415ebe2db553104b93598b3dd7c302f296882497d0dd3446c501364de","source":{"kind":"arxiv","id":"1304.1680","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1680","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1680v2","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1680","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"pith_short_12","alias_value":"MDLTJFAV5PRN","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MDLTJFAV5PRNWVJR","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MDLTJFAV","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MDLTJFAV5PRNWVJRAS4TLGFT3V","target":"record","payload":{"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"},"canonical_sha256":"60d7349415ebe2db553104b93598b3dd7c302f296882497d0dd3446c501364de","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"},"source_kind":"arxiv","source_id":"1304.1680","source_version":2,"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:25:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l6FnA4ZjGQEo7T0pH4r3Yj9fDPdHMFQB173tp+lalu9xS/yia2nK4ijjykB09H4zHNSj3kLg3xQxX4CWI3qXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:00:16.775785Z"},"content_sha256":"6cc06fe8e85cb9c634a55ee876d66bcb72710f9740569079372dd1ac9ee0b7ee","schema_version":"1.0","event_id":"sha256:6cc06fe8e85cb9c634a55ee876d66bcb72710f9740569079372dd1ac9ee0b7ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MDLTJFAV5PRNWVJRAS4TLGFT3V","target":"graph","payload":{"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"},"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:25:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y9QLMgnkAQJh2xySzjMBT8rzsPckG5xfNHbAc/wOLJR8Px4Wq2KIKUtH2Z0LGH3WWYMh3Qw9DdIQcQ4F+Kv1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:00:16.776178Z"},"content_sha256":"2d69d03b2ca3b4f1e4b8c799fc74f7223fd52e4385cd044dec03e725f7c3a144","schema_version":"1.0","event_id":"sha256:2d69d03b2ca3b4f1e4b8c799fc74f7223fd52e4385cd044dec03e725f7c3a144"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V/bundle.json","state_url":"https://pith.science/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V/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-25T12:00:16Z","links":{"resolver":"https://pith.science/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V","bundle":"https://pith.science/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V/bundle.json","state":"https://pith.science/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDLTJFAV5PRNWVJRAS4TLGFT3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MDLTJFAV5PRNWVJRAS4TLGFT3V","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":"47cd30e9fb82482ec234520376b88362abbf4c29f1055a428bd38423e6bd79cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-05T11:12:14Z","title_canon_sha256":"8cb19375ae904c8a73dc1325b7952f6e4e6f14271d0f561f7d75f2e3feb42e29"},"schema_version":"1.0","source":{"id":"1304.1680","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1680","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1680v2","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1680","created_at":"2026-05-18T03:25:45Z"},{"alias_kind":"pith_short_12","alias_value":"MDLTJFAV5PRN","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MDLTJFAV5PRNWVJR","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MDLTJFAV","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:2d69d03b2ca3b4f1e4b8c799fc74f7223fd52e4385cd044dec03e725f7c3a144","target":"graph","created_at":"2026-05-18T03:25:45Z","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":"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","authors_text":"Ran Gu, Xueliang Li, Yongtang Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-05T11:12:14Z","title":"Degree powers in $C_5$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1680","kind":"arxiv","version":2},"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:6cc06fe8e85cb9c634a55ee876d66bcb72710f9740569079372dd1ac9ee0b7ee","target":"record","created_at":"2026-05-18T03:25:45Z","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":"47cd30e9fb82482ec234520376b88362abbf4c29f1055a428bd38423e6bd79cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-05T11:12:14Z","title_canon_sha256":"8cb19375ae904c8a73dc1325b7952f6e4e6f14271d0f561f7d75f2e3feb42e29"},"schema_version":"1.0","source":{"id":"1304.1680","kind":"arxiv","version":2}},"canonical_sha256":"60d7349415ebe2db553104b93598b3dd7c302f296882497d0dd3446c501364de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60d7349415ebe2db553104b93598b3dd7c302f296882497d0dd3446c501364de","first_computed_at":"2026-05-18T03:25:45.624657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:45.624657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ax9Hgv02p6ReyRNN/+puTVHGKEGKHONlQoYbIcFIxUbYgZpeZ5Jg2jF5PtiuK9MY3S6MC5nUCEuKndX6Gz+kBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:45.625596Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1680","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cc06fe8e85cb9c634a55ee876d66bcb72710f9740569079372dd1ac9ee0b7ee","sha256:2d69d03b2ca3b4f1e4b8c799fc74f7223fd52e4385cd044dec03e725f7c3a144"],"state_sha256":"bf9084cc717a105b893b72db8d349985acb90627bc61f75a3f1a7ab92aecf78c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hmw0B/Nnq9sC0Tv7BCTGLEEtvdn5KzB8GXG8FdkyBZhr5nggJZclys31mERE3k0PEZPyVTlXgiCIZLYENHVRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:00:16.779028Z","bundle_sha256":"7e34fec962d9ec4722f0ff59ae32bd95742e7bd1f5b902050308cb03c91efac3"}}