{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5TNEHHOEC3W44KGECJTVQF55TK","short_pith_number":"pith:5TNEHHOE","schema_version":"1.0","canonical_sha256":"ecda439dc416edce28c412675817bd9a8b42f48b42cbca3bd254d94c2871d2cf","source":{"kind":"arxiv","id":"2606.20494","version":1},"attestation_state":"computed","paper":{"title":"Strong non-principality of positive codegree Tur\\'an density","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun Gao, Levente Bodn\\'ar, Mingyuan Rong, Oleg Pikhurko, Shumin Sun","submitted_at":"2026-06-18T17:09:42Z","abstract_excerpt":"The \\emph{minimum positive codegree} $\\delta^+_{k-1}(G)$ of a $k$-graph $G$ is the minimum, over all $(k-1)$-sets that lie in at least one edge, of the number of edges containing that set. The \\emph{positive codegree Tur\\'an density} of a $k$-graph family $\\mathcal{F}$ is the asymptotically maximum value of $\\delta^+_{k-1}(G)/n$ over all $\\mathcal{F}$-free $k$-graphs $G$ with $n\\to\\infty$ vertices. In this note, we establish a strong version of non-principality with respect to this density by proving that for every $k\\ge3$ there exist two $k$-graphs $F_1$ and $F_2$ such that\n  $$\n  0<\\gamma^+("},"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.20494","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T17:09:42Z","cross_cats_sorted":[],"title_canon_sha256":"40433330569aae409be314b1dc42aab63b29635a0b5475ee43d6dfba002c0ac4","abstract_canon_sha256":"6146500a93e218cfe67857b615f8ba3f356d2501c0ed470bf43d051e69a5bb01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:13:13.689297Z","signature_b64":"YsaE3TTNR3Zx0XV8h0ro7FSojlGFU2dSBPfko7yhnSlAiT8GcpbFseCHTr3Jn1Jn7spoJNwG640ssnrXQI4xBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecda439dc416edce28c412675817bd9a8b42f48b42cbca3bd254d94c2871d2cf","last_reissued_at":"2026-06-19T16:13:13.688919Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:13:13.688919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong non-principality of positive codegree Tur\\'an density","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun Gao, Levente Bodn\\'ar, Mingyuan Rong, Oleg Pikhurko, Shumin Sun","submitted_at":"2026-06-18T17:09:42Z","abstract_excerpt":"The \\emph{minimum positive codegree} $\\delta^+_{k-1}(G)$ of a $k$-graph $G$ is the minimum, over all $(k-1)$-sets that lie in at least one edge, of the number of edges containing that set. The \\emph{positive codegree Tur\\'an density} of a $k$-graph family $\\mathcal{F}$ is the asymptotically maximum value of $\\delta^+_{k-1}(G)/n$ over all $\\mathcal{F}$-free $k$-graphs $G$ with $n\\to\\infty$ vertices. In this note, we establish a strong version of non-principality with respect to this density by proving that for every $k\\ge3$ there exist two $k$-graphs $F_1$ and $F_2$ such that\n  $$\n  0<\\gamma^+("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20494","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.20494/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.20494","created_at":"2026-06-19T16:13:13.688973+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.20494v1","created_at":"2026-06-19T16:13:13.688973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20494","created_at":"2026-06-19T16:13:13.688973+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TNEHHOEC3W4","created_at":"2026-06-19T16:13:13.688973+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TNEHHOEC3W44KGE","created_at":"2026-06-19T16:13:13.688973+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TNEHHOE","created_at":"2026-06-19T16:13:13.688973+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/5TNEHHOEC3W44KGECJTVQF55TK","json":"https://pith.science/pith/5TNEHHOEC3W44KGECJTVQF55TK.json","graph_json":"https://pith.science/api/pith-number/5TNEHHOEC3W44KGECJTVQF55TK/graph.json","events_json":"https://pith.science/api/pith-number/5TNEHHOEC3W44KGECJTVQF55TK/events.json","paper":"https://pith.science/paper/5TNEHHOE"},"agent_actions":{"view_html":"https://pith.science/pith/5TNEHHOEC3W44KGECJTVQF55TK","download_json":"https://pith.science/pith/5TNEHHOEC3W44KGECJTVQF55TK.json","view_paper":"https://pith.science/paper/5TNEHHOE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.20494&json=true","fetch_graph":"https://pith.science/api/pith-number/5TNEHHOEC3W44KGECJTVQF55TK/graph.json","fetch_events":"https://pith.science/api/pith-number/5TNEHHOEC3W44KGECJTVQF55TK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TNEHHOEC3W44KGECJTVQF55TK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TNEHHOEC3W44KGECJTVQF55TK/action/storage_attestation","attest_author":"https://pith.science/pith/5TNEHHOEC3W44KGECJTVQF55TK/action/author_attestation","sign_citation":"https://pith.science/pith/5TNEHHOEC3W44KGECJTVQF55TK/action/citation_signature","submit_replication":"https://pith.science/pith/5TNEHHOEC3W44KGECJTVQF55TK/action/replication_record"}},"created_at":"2026-06-19T16:13:13.688973+00:00","updated_at":"2026-06-19T16:13:13.688973+00:00"}