{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5TNEHHOEC3W44KGECJTVQF55TK","short_pith_number":"pith:5TNEHHOE","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"},"canonical_sha256":"ecda439dc416edce28c412675817bd9a8b42f48b42cbca3bd254d94c2871d2cf","source":{"kind":"arxiv","id":"2606.20494","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20494","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20494v1","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20494","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"5TNEHHOEC3W4","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"5TNEHHOEC3W44KGE","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"5TNEHHOE","created_at":"2026-06-19T16:13:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5TNEHHOEC3W44KGECJTVQF55TK","target":"record","payload":{"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"},"canonical_sha256":"ecda439dc416edce28c412675817bd9a8b42f48b42cbca3bd254d94c2871d2cf","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"},"source_kind":"arxiv","source_id":"2606.20494","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-19T16:13:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vqw7tJQj5mdX9CcJ7KD1wectoY5XU9Wzx/WN32HaCa3xXYZsCZgr0odBA0cM3ck+DVa6JGa8NNIaJ7+vkLfgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:42:32.340355Z"},"content_sha256":"16fd2036f3758767e8fac8edd89cd5f20877848e21a1481be2a41bee43e6c0a9","schema_version":"1.0","event_id":"sha256:16fd2036f3758767e8fac8edd89cd5f20877848e21a1481be2a41bee43e6c0a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5TNEHHOEC3W44KGECJTVQF55TK","target":"graph","payload":{"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"},"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-19T16:13:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/NXqtLGoPjYnD91DU3/FGAwoZMhseXGNAevyy6d7RAuj0HIYFXPsl5NV/XOYrFYvKcyXW+CiA66+gRyR6rHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T11:42:32.340737Z"},"content_sha256":"0754c1b870beee6117536c3d50386ff474e820fcd6e8111fc06685d125e9ada0","schema_version":"1.0","event_id":"sha256:0754c1b870beee6117536c3d50386ff474e820fcd6e8111fc06685d125e9ada0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TNEHHOEC3W44KGECJTVQF55TK/bundle.json","state_url":"https://pith.science/pith/5TNEHHOEC3W44KGECJTVQF55TK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TNEHHOEC3W44KGECJTVQF55TK/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-07-04T11:42:32Z","links":{"resolver":"https://pith.science/pith/5TNEHHOEC3W44KGECJTVQF55TK","bundle":"https://pith.science/pith/5TNEHHOEC3W44KGECJTVQF55TK/bundle.json","state":"https://pith.science/pith/5TNEHHOEC3W44KGECJTVQF55TK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TNEHHOEC3W44KGECJTVQF55TK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5TNEHHOEC3W44KGECJTVQF55TK","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":"6146500a93e218cfe67857b615f8ba3f356d2501c0ed470bf43d051e69a5bb01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T17:09:42Z","title_canon_sha256":"40433330569aae409be314b1dc42aab63b29635a0b5475ee43d6dfba002c0ac4"},"schema_version":"1.0","source":{"id":"2606.20494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.20494","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"2606.20494v1","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.20494","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"5TNEHHOEC3W4","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"5TNEHHOEC3W44KGE","created_at":"2026-06-19T16:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"5TNEHHOE","created_at":"2026-06-19T16:13:13Z"}],"graph_snapshots":[{"event_id":"sha256:0754c1b870beee6117536c3d50386ff474e820fcd6e8111fc06685d125e9ada0","target":"graph","created_at":"2026-06-19T16:13:13Z","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.20494/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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^+(","authors_text":"Jun Gao, Levente Bodn\\'ar, Mingyuan Rong, Oleg Pikhurko, Shumin Sun","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T17:09:42Z","title":"Strong non-principality of positive codegree Tur\\'an density"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.20494","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:16fd2036f3758767e8fac8edd89cd5f20877848e21a1481be2a41bee43e6c0a9","target":"record","created_at":"2026-06-19T16:13:13Z","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":"6146500a93e218cfe67857b615f8ba3f356d2501c0ed470bf43d051e69a5bb01","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-18T17:09:42Z","title_canon_sha256":"40433330569aae409be314b1dc42aab63b29635a0b5475ee43d6dfba002c0ac4"},"schema_version":"1.0","source":{"id":"2606.20494","kind":"arxiv","version":1}},"canonical_sha256":"ecda439dc416edce28c412675817bd9a8b42f48b42cbca3bd254d94c2871d2cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecda439dc416edce28c412675817bd9a8b42f48b42cbca3bd254d94c2871d2cf","first_computed_at":"2026-06-19T16:13:13.688919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:13:13.688919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YsaE3TTNR3Zx0XV8h0ro7FSojlGFU2dSBPfko7yhnSlAiT8GcpbFseCHTr3Jn1Jn7spoJNwG640ssnrXQI4xBA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:13:13.689297Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.20494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16fd2036f3758767e8fac8edd89cd5f20877848e21a1481be2a41bee43e6c0a9","sha256:0754c1b870beee6117536c3d50386ff474e820fcd6e8111fc06685d125e9ada0"],"state_sha256":"1cdece90d3b22237057b91d4da88ef2398e0a3fd4ce48212a82814a01dff8544"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLLbahJTybVUEfFv0Q3wDdwG/JJFpzmKSpCtKWuk8OAXRLW+pe0dyORKcIAO2DUoV/bjzkhk3GkjDDykkUv9DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T11:42:32.342647Z","bundle_sha256":"3f5be3248e40490358a3b22c0e4305e2c94c279b90ce511b602f102bb4a50bff"}}