{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:IM556UDMI3BTID4HV2PUVWGHT7","short_pith_number":"pith:IM556UDM","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"},"canonical_sha256":"433bdf506c46c3340f87ae9f4ad8c79ff3bface9d6d1827b1618bdbf74cbcb4d","source":{"kind":"arxiv","id":"math/0401398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0401398","created_at":"2026-07-04T14:38:11Z"},{"alias_kind":"arxiv_version","alias_value":"math/0401398v1","created_at":"2026-07-04T14:38:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0401398","created_at":"2026-07-04T14:38:11Z"},{"alias_kind":"pith_short_12","alias_value":"IM556UDMI3BT","created_at":"2026-07-04T14:38:11Z"},{"alias_kind":"pith_short_16","alias_value":"IM556UDMI3BTID4H","created_at":"2026-07-04T14:38:11Z"},{"alias_kind":"pith_short_8","alias_value":"IM556UDM","created_at":"2026-07-04T14:38:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:IM556UDMI3BTID4HV2PUVWGHT7","target":"record","payload":{"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"},"canonical_sha256":"433bdf506c46c3340f87ae9f4ad8c79ff3bface9d6d1827b1618bdbf74cbcb4d","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"},"source_kind":"arxiv","source_id":"math/0401398","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-07-04T14:38:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VCf2MsTSHzE6l+5dr1hXUFIQp1SJSAgw7fweZdMP8sMzrIKt0RBCvZpGGIsFOenmMdevJeSOWixzTOiRUKUUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:34:24.078100Z"},"content_sha256":"0fa565946ebf72810468b8a431222f68aac4ff65017986664c2e4e66080d55a3","schema_version":"1.0","event_id":"sha256:0fa565946ebf72810468b8a431222f68aac4ff65017986664c2e4e66080d55a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:IM556UDMI3BTID4HV2PUVWGHT7","target":"graph","payload":{"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"},"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-07-04T14:38:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RbxQhnV50szD7lrhLN0HW4etkBNpLW1LgtpN7UZJ8IvenZaBUL/ReWv9nnyHrr4B0VPEIYwcX+kg6g1JwaiMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:34:24.078596Z"},"content_sha256":"5fe92df35d9d2da923e9ced4a1573bfa9124247d2c5b7b63dfbc885ed36da14f","schema_version":"1.0","event_id":"sha256:5fe92df35d9d2da923e9ced4a1573bfa9124247d2c5b7b63dfbc885ed36da14f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IM556UDMI3BTID4HV2PUVWGHT7/bundle.json","state_url":"https://pith.science/pith/IM556UDMI3BTID4HV2PUVWGHT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IM556UDMI3BTID4HV2PUVWGHT7/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-08-14T08:34:24Z","links":{"resolver":"https://pith.science/pith/IM556UDMI3BTID4HV2PUVWGHT7","bundle":"https://pith.science/pith/IM556UDMI3BTID4HV2PUVWGHT7/bundle.json","state":"https://pith.science/pith/IM556UDMI3BTID4HV2PUVWGHT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IM556UDMI3BTID4HV2PUVWGHT7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:IM556UDMI3BTID4HV2PUVWGHT7","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":"b0512ed93a61df8b9808c62f0506bd0caa630cdedb607ed744ad6c68b3b0e949","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2004-01-28T16:15:25Z","title_canon_sha256":"b0d4446d7c3d9a74cd12032a87fc589000de5e839cc57b9c490a6c569e4e6f60"},"schema_version":"1.0","source":{"id":"math/0401398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0401398","created_at":"2026-07-04T14:38:11Z"},{"alias_kind":"arxiv_version","alias_value":"math/0401398v1","created_at":"2026-07-04T14:38:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0401398","created_at":"2026-07-04T14:38:11Z"},{"alias_kind":"pith_short_12","alias_value":"IM556UDMI3BT","created_at":"2026-07-04T14:38:11Z"},{"alias_kind":"pith_short_16","alias_value":"IM556UDMI3BTID4H","created_at":"2026-07-04T14:38:11Z"},{"alias_kind":"pith_short_8","alias_value":"IM556UDM","created_at":"2026-07-04T14:38:11Z"}],"graph_snapshots":[{"event_id":"sha256:5fe92df35d9d2da923e9ced4a1573bfa9124247d2c5b7b63dfbc885ed36da14f","target":"graph","created_at":"2026-07-04T14:38:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0401398/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"R. Yuster, Y. Caro","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2004-01-28T16:15:25Z","title":"A Tur\\'{a}n Type Problem Concerning the Powers of the Degrees of a Graph (revised)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0401398","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:0fa565946ebf72810468b8a431222f68aac4ff65017986664c2e4e66080d55a3","target":"record","created_at":"2026-07-04T14:38:11Z","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":"b0512ed93a61df8b9808c62f0506bd0caa630cdedb607ed744ad6c68b3b0e949","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2004-01-28T16:15:25Z","title_canon_sha256":"b0d4446d7c3d9a74cd12032a87fc589000de5e839cc57b9c490a6c569e4e6f60"},"schema_version":"1.0","source":{"id":"math/0401398","kind":"arxiv","version":1}},"canonical_sha256":"433bdf506c46c3340f87ae9f4ad8c79ff3bface9d6d1827b1618bdbf74cbcb4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"433bdf506c46c3340f87ae9f4ad8c79ff3bface9d6d1827b1618bdbf74cbcb4d","first_computed_at":"2026-07-04T14:38:11.801415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:38:11.801415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4/v3kBIc/7AxuHKkKN1urwQJbuSy6//Ef6AVNu4RgyUaGJhlUhuqH8GMe6XbZuo55BFIlfdCPRNLCaenH9dECg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:38:11.801827Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0401398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fa565946ebf72810468b8a431222f68aac4ff65017986664c2e4e66080d55a3","sha256:5fe92df35d9d2da923e9ced4a1573bfa9124247d2c5b7b63dfbc885ed36da14f"],"state_sha256":"2ba7b8635771c8413528ccedd91ff9bc2a0bfd439b8a3d032d1bcd466183bc73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vbgO8pwby7XX/EDZsNREbS58eq34s5sEYi75/BM3v533eZo5tx6fTaj8hWT6yKqaer300BV7/1qmZ1sgL19xDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T08:34:24.084177Z","bundle_sha256":"0141f2d6700fe0d53dafe50fb967a7996a9b802061934095e893c2fd6ce4ab58"}}