{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C2S2RVUJJ7LJDKLC4KTPVFZL7Z","short_pith_number":"pith:C2S2RVUJ","canonical_record":{"source":{"id":"1612.01363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-05T14:17:54Z","cross_cats_sorted":[],"title_canon_sha256":"78e42c76025b133ae22e7443257137c3db1cab19d72abff4eab6732fc0d212ff","abstract_canon_sha256":"ee4919ee616aeea0a89c57f7dc4ce32946ead0137957cc98da0d809160af68f7"},"schema_version":"1.0"},"canonical_sha256":"16a5a8d6894fd691a962e2a6fa972bfe6c608367020eb7fde9bc125a1daedd55","source":{"kind":"arxiv","id":"1612.01363","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01363","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01363v2","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01363","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"C2S2RVUJJ7LJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C2S2RVUJJ7LJDKLC","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C2S2RVUJ","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C2S2RVUJJ7LJDKLC4KTPVFZL7Z","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-05T14:17:54Z","cross_cats_sorted":[],"title_canon_sha256":"78e42c76025b133ae22e7443257137c3db1cab19d72abff4eab6732fc0d212ff","abstract_canon_sha256":"ee4919ee616aeea0a89c57f7dc4ce32946ead0137957cc98da0d809160af68f7"},"schema_version":"1.0"},"canonical_sha256":"16a5a8d6894fd691a962e2a6fa972bfe6c608367020eb7fde9bc125a1daedd55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:41.920422Z","signature_b64":"La+bKphGtjNdu07iOyBjduID9y34ufU7bZXaKa+KzUoBbq8bwZMxBpd9HitnmmvncfWQebAnrvbaFygqm9v4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16a5a8d6894fd691a962e2a6fa972bfe6c608367020eb7fde9bc125a1daedd55","last_reissued_at":"2026-05-18T00:53:41.919986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:41.919986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01363","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-18T00:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MpXtPpdTT3WGtIBCHcvlOd71vwzX/Dp2LZXC+2aVrEkVYRkc1g2L2i6SdorCm4byhTH7P9Lj1nxvA9AbPtsUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T01:39:46.199354Z"},"content_sha256":"e58208daf404cd9ad7352076d96390007c89cf0b8759b661015b2eca2cf68bff","schema_version":"1.0","event_id":"sha256:e58208daf404cd9ad7352076d96390007c89cf0b8759b661015b2eca2cf68bff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C2S2RVUJJ7LJDKLC4KTPVFZL7Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some extremal results on complete degenerate hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Mingwei Zhang, Xiaofan Yuan","submitted_at":"2016-12-05T14:17:54Z","abstract_excerpt":"Let $K^{(r)}_{s_1,s_2,\\cdots,s_r}$ be the complete $r$-partite $r$-uniform hypergraph and $ex(n,K^{(r)}_{s_1,s_2,\\cdots,s_r})$ be the maximum number of edges in any $n$-vertex $K^{(r)}_{s_1,s_2,\\cdots,s_r}$-free $r$-uniform hypergraph. It is well-known in the graph case that $ex(n,K_{s,t})=\\Theta(n^{2-1/s})$ when $t$ is sufficiently larger than $s$. In this note, we generalize the above to hypergraphs by showing that if $s_r$ is sufficiently larger than $s_1,s_2,\\cdots,s_{r-1}$ then $$ex(n, K^{(r)}_{s_1,s_2,\\cdots,s_r})=\\Theta\\left(n^{r-\\frac{1}{s_1s_2\\cdots s_{r-1}}}\\right).$$ This follows fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01363","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-18T00:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0EJIqE9U6xk7wHjx+T/ani8jFQw6Jd8YKeLiToBZU1b01pGqRRWx9DSCoDKJb0EtvqHCe4DR4g1BAg3x8xsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T01:39:46.199705Z"},"content_sha256":"281db8904f4487424fda5a51aa94217af66af748e08a78929920b98b21912a0e","schema_version":"1.0","event_id":"sha256:281db8904f4487424fda5a51aa94217af66af748e08a78929920b98b21912a0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2S2RVUJJ7LJDKLC4KTPVFZL7Z/bundle.json","state_url":"https://pith.science/pith/C2S2RVUJJ7LJDKLC4KTPVFZL7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2S2RVUJJ7LJDKLC4KTPVFZL7Z/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-06-27T01:39:46Z","links":{"resolver":"https://pith.science/pith/C2S2RVUJJ7LJDKLC4KTPVFZL7Z","bundle":"https://pith.science/pith/C2S2RVUJJ7LJDKLC4KTPVFZL7Z/bundle.json","state":"https://pith.science/pith/C2S2RVUJJ7LJDKLC4KTPVFZL7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2S2RVUJJ7LJDKLC4KTPVFZL7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C2S2RVUJJ7LJDKLC4KTPVFZL7Z","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":"ee4919ee616aeea0a89c57f7dc4ce32946ead0137957cc98da0d809160af68f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-05T14:17:54Z","title_canon_sha256":"78e42c76025b133ae22e7443257137c3db1cab19d72abff4eab6732fc0d212ff"},"schema_version":"1.0","source":{"id":"1612.01363","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01363","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01363v2","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01363","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"C2S2RVUJJ7LJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C2S2RVUJJ7LJDKLC","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C2S2RVUJ","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:281db8904f4487424fda5a51aa94217af66af748e08a78929920b98b21912a0e","target":"graph","created_at":"2026-05-18T00:53:41Z","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 $K^{(r)}_{s_1,s_2,\\cdots,s_r}$ be the complete $r$-partite $r$-uniform hypergraph and $ex(n,K^{(r)}_{s_1,s_2,\\cdots,s_r})$ be the maximum number of edges in any $n$-vertex $K^{(r)}_{s_1,s_2,\\cdots,s_r}$-free $r$-uniform hypergraph. It is well-known in the graph case that $ex(n,K_{s,t})=\\Theta(n^{2-1/s})$ when $t$ is sufficiently larger than $s$. In this note, we generalize the above to hypergraphs by showing that if $s_r$ is sufficiently larger than $s_1,s_2,\\cdots,s_{r-1}$ then $$ex(n, K^{(r)}_{s_1,s_2,\\cdots,s_r})=\\Theta\\left(n^{r-\\frac{1}{s_1s_2\\cdots s_{r-1}}}\\right).$$ This follows fr","authors_text":"Jie Ma, Mingwei Zhang, Xiaofan Yuan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-05T14:17:54Z","title":"Some extremal results on complete degenerate hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01363","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:e58208daf404cd9ad7352076d96390007c89cf0b8759b661015b2eca2cf68bff","target":"record","created_at":"2026-05-18T00:53:41Z","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":"ee4919ee616aeea0a89c57f7dc4ce32946ead0137957cc98da0d809160af68f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-05T14:17:54Z","title_canon_sha256":"78e42c76025b133ae22e7443257137c3db1cab19d72abff4eab6732fc0d212ff"},"schema_version":"1.0","source":{"id":"1612.01363","kind":"arxiv","version":2}},"canonical_sha256":"16a5a8d6894fd691a962e2a6fa972bfe6c608367020eb7fde9bc125a1daedd55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16a5a8d6894fd691a962e2a6fa972bfe6c608367020eb7fde9bc125a1daedd55","first_computed_at":"2026-05-18T00:53:41.919986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:41.919986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"La+bKphGtjNdu07iOyBjduID9y34ufU7bZXaKa+KzUoBbq8bwZMxBpd9HitnmmvncfWQebAnrvbaFygqm9v4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:41.920422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01363","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e58208daf404cd9ad7352076d96390007c89cf0b8759b661015b2eca2cf68bff","sha256:281db8904f4487424fda5a51aa94217af66af748e08a78929920b98b21912a0e"],"state_sha256":"dd9028dc37d77b74b9cba9bc26bbf8f62dc3acf6c5846979451a2bde5c72f1be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocl4yzSWikb4weuBYpLKxthuzeuGDENGIY0VAKD29Mcq+y8QVHpXvIEiMy2uI0PH9bvn1/elrhzZ3uVwAiEwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T01:39:46.201523Z","bundle_sha256":"2462947fb3f19576b3fa69c8935a2f7b65966d879f7dca3aff67f4c27104a610"}}