{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KLV7WS6V5I6UJJHZ5ZEI4V6R5L","short_pith_number":"pith:KLV7WS6V","schema_version":"1.0","canonical_sha256":"52ebfb4bd5ea3d44a4f9ee488e57d1eacbfd56f79d2d05d7a51fe171bbdd2001","source":{"kind":"arxiv","id":"2606.02110","version":1},"attestation_state":"computed","paper":{"title":"On cliques in hypergraphs under bounded $(j,p)$-norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongbin Zhao, Jianfeng Hou","submitted_at":"2026-06-01T11:43:09Z","abstract_excerpt":"Let $\\mathcal{H}$ be an $r$-uniform hypergraph. For $S\\in \\binom{V(\\mathcal{H})}{j}$, let $\\mathrm{deg}(S)$ be the number of edges of $\\mathcal{H}$ containing $S$, and define the $(j,p)$-norm of $\\mathcal{H}$ by $\\|\\mathcal{H}\\|_{j,p}=\\left(\\sum_{S\\in \\binom{V(\\mathcal{H})}{j}}\\mathrm{deg}(S)^p\\right)^{1/p}$. Motivated by a problem of Chao, Dong, Shen and Yang, we determine the maximum number of $t$-cliques in an $n$-vertex $r$-graph with bounded $(j,p)$-norm in the range $p>(t-j)/(r-j)$. The proof uses an entropy argument adapted to hypergraphs, together with a continuous interpolation step. "},"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":"2606.02110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T11:43:09Z","cross_cats_sorted":[],"title_canon_sha256":"80602812a4ec78677f9525756310fabcd7ece88ab40898aa23b857567723cde0","abstract_canon_sha256":"89e8f5372f14fe2ad38d1a3da2d498c1ebded9b4c23da02ab7925c04511376ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:05:06.726577Z","signature_b64":"oA5oSgKhvMSCsn4XWPj2WyVzTSNrYE9b+wpffti9lydFV8exMEFqgCxSyoFZe+tbfsdh/d5oRVfy9RUO+ruWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52ebfb4bd5ea3d44a4f9ee488e57d1eacbfd56f79d2d05d7a51fe171bbdd2001","last_reissued_at":"2026-06-02T02:05:06.726214Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:05:06.726214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On cliques in hypergraphs under bounded $(j,p)$-norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongbin Zhao, Jianfeng Hou","submitted_at":"2026-06-01T11:43:09Z","abstract_excerpt":"Let $\\mathcal{H}$ be an $r$-uniform hypergraph. For $S\\in \\binom{V(\\mathcal{H})}{j}$, let $\\mathrm{deg}(S)$ be the number of edges of $\\mathcal{H}$ containing $S$, and define the $(j,p)$-norm of $\\mathcal{H}$ by $\\|\\mathcal{H}\\|_{j,p}=\\left(\\sum_{S\\in \\binom{V(\\mathcal{H})}{j}}\\mathrm{deg}(S)^p\\right)^{1/p}$. Motivated by a problem of Chao, Dong, Shen and Yang, we determine the maximum number of $t$-cliques in an $n$-vertex $r$-graph with bounded $(j,p)$-norm in the range $p>(t-j)/(r-j)$. The proof uses an entropy argument adapted to hypergraphs, together with a continuous interpolation step. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02110","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/2606.02110/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.02110","created_at":"2026-06-02T02:05:06.726274+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02110v1","created_at":"2026-06-02T02:05:06.726274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02110","created_at":"2026-06-02T02:05:06.726274+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLV7WS6V5I6U","created_at":"2026-06-02T02:05:06.726274+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLV7WS6V5I6UJJHZ","created_at":"2026-06-02T02:05:06.726274+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLV7WS6V","created_at":"2026-06-02T02:05:06.726274+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/KLV7WS6V5I6UJJHZ5ZEI4V6R5L","json":"https://pith.science/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L.json","graph_json":"https://pith.science/api/pith-number/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/graph.json","events_json":"https://pith.science/api/pith-number/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/events.json","paper":"https://pith.science/paper/KLV7WS6V"},"agent_actions":{"view_html":"https://pith.science/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L","download_json":"https://pith.science/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L.json","view_paper":"https://pith.science/paper/KLV7WS6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02110&json=true","fetch_graph":"https://pith.science/api/pith-number/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/graph.json","fetch_events":"https://pith.science/api/pith-number/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/action/storage_attestation","attest_author":"https://pith.science/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/action/author_attestation","sign_citation":"https://pith.science/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/action/citation_signature","submit_replication":"https://pith.science/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/action/replication_record"}},"created_at":"2026-06-02T02:05:06.726274+00:00","updated_at":"2026-06-02T02:05:06.726274+00:00"}