{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KLV7WS6V5I6UJJHZ5ZEI4V6R5L","short_pith_number":"pith:KLV7WS6V","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"},"canonical_sha256":"52ebfb4bd5ea3d44a4f9ee488e57d1eacbfd56f79d2d05d7a51fe171bbdd2001","source":{"kind":"arxiv","id":"2606.02110","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02110","created_at":"2026-06-02T02:05:06Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02110v1","created_at":"2026-06-02T02:05:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02110","created_at":"2026-06-02T02:05:06Z"},{"alias_kind":"pith_short_12","alias_value":"KLV7WS6V5I6U","created_at":"2026-06-02T02:05:06Z"},{"alias_kind":"pith_short_16","alias_value":"KLV7WS6V5I6UJJHZ","created_at":"2026-06-02T02:05:06Z"},{"alias_kind":"pith_short_8","alias_value":"KLV7WS6V","created_at":"2026-06-02T02:05:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KLV7WS6V5I6UJJHZ5ZEI4V6R5L","target":"record","payload":{"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"},"canonical_sha256":"52ebfb4bd5ea3d44a4f9ee488e57d1eacbfd56f79d2d05d7a51fe171bbdd2001","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"},"source_kind":"arxiv","source_id":"2606.02110","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-06-02T02:05:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MSp5c+d83gBagHPwmWsnN96V/XbLNdTkVnM1It28DFmG+ccUXfNHRMDp0cjQO57iuudzry93824irxiBLAMOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:59:05.768591Z"},"content_sha256":"3b3c05144fd78b0477514a3694677ac0aa9e535e09e78cf99d24a49ee27e8b7e","schema_version":"1.0","event_id":"sha256:3b3c05144fd78b0477514a3694677ac0aa9e535e09e78cf99d24a49ee27e8b7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KLV7WS6V5I6UJJHZ5ZEI4V6R5L","target":"graph","payload":{"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"},"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-06-02T02:05:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s449dNHYukKeI8dk6LnbcXM8kjpb3ZDzNB72aNxSOHNxZPFx+z1K8RdrRVAgUrfTDFLa0wp+8o17JJtlCileCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:59:05.768962Z"},"content_sha256":"8af30db1a19a81187810430c8bf3791be5c9ba60188222448b6e7a409738e658","schema_version":"1.0","event_id":"sha256:8af30db1a19a81187810430c8bf3791be5c9ba60188222448b6e7a409738e658"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/bundle.json","state_url":"https://pith.science/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/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-28T17:59:05Z","links":{"resolver":"https://pith.science/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L","bundle":"https://pith.science/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/bundle.json","state":"https://pith.science/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLV7WS6V5I6UJJHZ5ZEI4V6R5L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KLV7WS6V5I6UJJHZ5ZEI4V6R5L","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":"89e8f5372f14fe2ad38d1a3da2d498c1ebded9b4c23da02ab7925c04511376ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T11:43:09Z","title_canon_sha256":"80602812a4ec78677f9525756310fabcd7ece88ab40898aa23b857567723cde0"},"schema_version":"1.0","source":{"id":"2606.02110","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02110","created_at":"2026-06-02T02:05:06Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02110v1","created_at":"2026-06-02T02:05:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02110","created_at":"2026-06-02T02:05:06Z"},{"alias_kind":"pith_short_12","alias_value":"KLV7WS6V5I6U","created_at":"2026-06-02T02:05:06Z"},{"alias_kind":"pith_short_16","alias_value":"KLV7WS6V5I6UJJHZ","created_at":"2026-06-02T02:05:06Z"},{"alias_kind":"pith_short_8","alias_value":"KLV7WS6V","created_at":"2026-06-02T02:05:06Z"}],"graph_snapshots":[{"event_id":"sha256:8af30db1a19a81187810430c8bf3791be5c9ba60188222448b6e7a409738e658","target":"graph","created_at":"2026-06-02T02:05:06Z","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/2606.02110/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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. ","authors_text":"Hongbin Zhao, Jianfeng Hou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T11:43:09Z","title":"On cliques in hypergraphs under bounded $(j,p)$-norm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02110","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:3b3c05144fd78b0477514a3694677ac0aa9e535e09e78cf99d24a49ee27e8b7e","target":"record","created_at":"2026-06-02T02:05:06Z","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":"89e8f5372f14fe2ad38d1a3da2d498c1ebded9b4c23da02ab7925c04511376ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T11:43:09Z","title_canon_sha256":"80602812a4ec78677f9525756310fabcd7ece88ab40898aa23b857567723cde0"},"schema_version":"1.0","source":{"id":"2606.02110","kind":"arxiv","version":1}},"canonical_sha256":"52ebfb4bd5ea3d44a4f9ee488e57d1eacbfd56f79d2d05d7a51fe171bbdd2001","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52ebfb4bd5ea3d44a4f9ee488e57d1eacbfd56f79d2d05d7a51fe171bbdd2001","first_computed_at":"2026-06-02T02:05:06.726214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:05:06.726214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oA5oSgKhvMSCsn4XWPj2WyVzTSNrYE9b+wpffti9lydFV8exMEFqgCxSyoFZe+tbfsdh/d5oRVfy9RUO+ruWCg==","signature_status":"signed_v1","signed_at":"2026-06-02T02:05:06.726577Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02110","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b3c05144fd78b0477514a3694677ac0aa9e535e09e78cf99d24a49ee27e8b7e","sha256:8af30db1a19a81187810430c8bf3791be5c9ba60188222448b6e7a409738e658"],"state_sha256":"839b9868fcea80a914f84df2cbdf72c7202960bb179683d0088386f821439dc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e5AXIFQRFHP50L3spD/E+QAKx2Oq2VZEpmajDfqMMqXpxK2E9NyxHFWep3KQclGI0qCmc5AqKcUhKWDs1m4UAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:59:05.770893Z","bundle_sha256":"fbf66dff8af4491afb509c7b51adb822401d5533f35b2797816137dee7caf8d4"}}