{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LE36WUE4WLBCST2FA7I43RFLE7","short_pith_number":"pith:LE36WUE4","schema_version":"1.0","canonical_sha256":"5937eb509cb2c2294f4507d1cdc4ab27c4db1e33ba362f3b86c54940c1ac015f","source":{"kind":"arxiv","id":"2108.10406","version":3},"attestation_state":"computed","paper":{"title":"Hypergraph Tur\\'an Problems in $\\ell_2$-Norm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, Felix Christian Clemen, J\\'ozsef Balogh","submitted_at":"2021-08-23T20:57:23Z","abstract_excerpt":"There are various different notions measuring extremality of hypergraphs. In this survey we compare the recently introduced notion of the codegree squared extremal function with the Tur\\'an function, the minimum codegree threshold and the uniform Tur\\'an density.\n  The codegree squared sum $\\textrm{co}_2(G)$ of a $3$-uniform hypergraph $G$ is defined to be the sum of codegrees squared $d(x,y)^2$ over all pairs of vertices $x,y$. In other words, this is the square of the $\\ell_2$-norm of the codegree vector. We are interested in how large $\\textrm{co}_2(G)$ can be if we require $G$ to be $H$-fr"},"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":"2108.10406","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-08-23T20:57:23Z","cross_cats_sorted":[],"title_canon_sha256":"d249b4dc99a39057cc00768bb150a9b78414b5fe9ac24a340f8ab9c8ede5e7ac","abstract_canon_sha256":"ea4f9d3a8e21e44b8ab80c8d97cc5c0c07eecc6868f4aacc1f9988a1d3dee5d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:01:58.862947Z","signature_b64":"5uFUDh4PYHh4NMak4gS5w/pKJak31uI9FNJ6cYEd1bP1vqHRWjeDSF4siiOd1Z2E5LgiK32K/9g0YSAOalhXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5937eb509cb2c2294f4507d1cdc4ab27c4db1e33ba362f3b86c54940c1ac015f","last_reissued_at":"2026-07-05T10:01:58.862511Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:01:58.862511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph Tur\\'an Problems in $\\ell_2$-Norm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, Felix Christian Clemen, J\\'ozsef Balogh","submitted_at":"2021-08-23T20:57:23Z","abstract_excerpt":"There are various different notions measuring extremality of hypergraphs. In this survey we compare the recently introduced notion of the codegree squared extremal function with the Tur\\'an function, the minimum codegree threshold and the uniform Tur\\'an density.\n  The codegree squared sum $\\textrm{co}_2(G)$ of a $3$-uniform hypergraph $G$ is defined to be the sum of codegrees squared $d(x,y)^2$ over all pairs of vertices $x,y$. In other words, this is the square of the $\\ell_2$-norm of the codegree vector. We are interested in how large $\\textrm{co}_2(G)$ can be if we require $G$ to be $H$-fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.10406","kind":"arxiv","version":3},"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/2108.10406/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":"2108.10406","created_at":"2026-07-05T10:01:58.862565+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.10406v3","created_at":"2026-07-05T10:01:58.862565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.10406","created_at":"2026-07-05T10:01:58.862565+00:00"},{"alias_kind":"pith_short_12","alias_value":"LE36WUE4WLBC","created_at":"2026-07-05T10:01:58.862565+00:00"},{"alias_kind":"pith_short_16","alias_value":"LE36WUE4WLBCST2F","created_at":"2026-07-05T10:01:58.862565+00:00"},{"alias_kind":"pith_short_8","alias_value":"LE36WUE4","created_at":"2026-07-05T10:01:58.862565+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.04615","citing_title":"The $(t,p)$-Norm in Classical Extremal Problems","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LE36WUE4WLBCST2FA7I43RFLE7","json":"https://pith.science/pith/LE36WUE4WLBCST2FA7I43RFLE7.json","graph_json":"https://pith.science/api/pith-number/LE36WUE4WLBCST2FA7I43RFLE7/graph.json","events_json":"https://pith.science/api/pith-number/LE36WUE4WLBCST2FA7I43RFLE7/events.json","paper":"https://pith.science/paper/LE36WUE4"},"agent_actions":{"view_html":"https://pith.science/pith/LE36WUE4WLBCST2FA7I43RFLE7","download_json":"https://pith.science/pith/LE36WUE4WLBCST2FA7I43RFLE7.json","view_paper":"https://pith.science/paper/LE36WUE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.10406&json=true","fetch_graph":"https://pith.science/api/pith-number/LE36WUE4WLBCST2FA7I43RFLE7/graph.json","fetch_events":"https://pith.science/api/pith-number/LE36WUE4WLBCST2FA7I43RFLE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LE36WUE4WLBCST2FA7I43RFLE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LE36WUE4WLBCST2FA7I43RFLE7/action/storage_attestation","attest_author":"https://pith.science/pith/LE36WUE4WLBCST2FA7I43RFLE7/action/author_attestation","sign_citation":"https://pith.science/pith/LE36WUE4WLBCST2FA7I43RFLE7/action/citation_signature","submit_replication":"https://pith.science/pith/LE36WUE4WLBCST2FA7I43RFLE7/action/replication_record"}},"created_at":"2026-07-05T10:01:58.862565+00:00","updated_at":"2026-07-05T10:01:58.862565+00:00"}