{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RW7G5QDWPE4CUPU7A2VHBOZ3GC","short_pith_number":"pith:RW7G5QDW","canonical_record":{"source":{"id":"2606.04400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T03:28:06Z","cross_cats_sorted":[],"title_canon_sha256":"fb97de923ffa3668230911d0c2a17a46fd00c06836a7fa9c6fcb280f0c95cc9a","abstract_canon_sha256":"302d19a18452b63763dad6ea8d3c2fe2f2a66507fde0311b19b9f7d3c73a1b95"},"schema_version":"1.0"},"canonical_sha256":"8dbe6ec07679382a3e9f06aa70bb3b309d326cad7ec390629bb0e64e2b515a56","source":{"kind":"arxiv","id":"2606.04400","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.04400","created_at":"2026-06-04T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"2606.04400v1","created_at":"2026-06-04T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04400","created_at":"2026-06-04T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"RW7G5QDWPE4C","created_at":"2026-06-04T01:09:06Z"},{"alias_kind":"pith_short_16","alias_value":"RW7G5QDWPE4CUPU7","created_at":"2026-06-04T01:09:06Z"},{"alias_kind":"pith_short_8","alias_value":"RW7G5QDW","created_at":"2026-06-04T01:09:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RW7G5QDWPE4CUPU7A2VHBOZ3GC","target":"record","payload":{"canonical_record":{"source":{"id":"2606.04400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T03:28:06Z","cross_cats_sorted":[],"title_canon_sha256":"fb97de923ffa3668230911d0c2a17a46fd00c06836a7fa9c6fcb280f0c95cc9a","abstract_canon_sha256":"302d19a18452b63763dad6ea8d3c2fe2f2a66507fde0311b19b9f7d3c73a1b95"},"schema_version":"1.0"},"canonical_sha256":"8dbe6ec07679382a3e9f06aa70bb3b309d326cad7ec390629bb0e64e2b515a56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:06.636986Z","signature_b64":"3ByCiCmkg5vhs0QW7UPNmpv/F2vUgqOq2ZwQYKU9sW4tmGE2stBoq/+/S2M2ws04hyy8wEFmLxW76MSdlm8UAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dbe6ec07679382a3e9f06aa70bb3b309d326cad7ec390629bb0e64e2b515a56","last_reissued_at":"2026-06-04T01:09:06.636547Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:06.636547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.04400","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-04T01:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5HSC4maJGbVzXbn5Ta44TmZmhAzqTh/TDFOrpKCE51ULpiosADcl5G1v2hRC+rWNpBqUTHYy7e+dYAhrbL+ADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:54:07.532692Z"},"content_sha256":"9c5221086367d5a2e56abd5c503af18e37c4a9f18db9d5330ea0ad9bbbab96ae","schema_version":"1.0","event_id":"sha256:9c5221086367d5a2e56abd5c503af18e37c4a9f18db9d5330ea0ad9bbbab96ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RW7G5QDWPE4CUPU7A2VHBOZ3GC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On linear $k$-graphs with codegree Tur\\'an density arbitrarily close to zero","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaona Fang, Yaojun Chen","submitted_at":"2026-06-03T03:28:06Z","abstract_excerpt":"Let $F$ be a $k$-uniform hypergraph, abbreviated as $k$-graph. The codegree Tur\\'an density $\\pi_{\\mathrm{co}}(F)$ is the supremum over all $\\gamma \\in [0,1]$ such that, for arbitrarily large $n$, there exists an $n$-vertex $F$-free $k$-graph $H$ whose every $(k-1)$-subset of vertices lies in at least $\\gamma n$ edges. In this paper, we prove that there is a linear $k$-graph $F$ with $0<\\pi_{co}(F) < \\varepsilon$ for any $\\varepsilon>0$. The special case $k=3$ solve a question proposed by Ding, Lamaison, Liu, Wang and Yang (JLMS, 2025)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04400","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.04400/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-04T01:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tN60IHKyKGotyrGD6hkD/V9LmF6xdQBwIh5qBqEx4dtYOpp3Ax7Y/fmm59VauGRKNTOUZrzQgz9y5jqFlxgkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:54:07.533517Z"},"content_sha256":"3993f1629d580b7d5d4f5597e67be2a1817e7919cd54fea69d3c15d1cf69d922","schema_version":"1.0","event_id":"sha256:3993f1629d580b7d5d4f5597e67be2a1817e7919cd54fea69d3c15d1cf69d922"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RW7G5QDWPE4CUPU7A2VHBOZ3GC/bundle.json","state_url":"https://pith.science/pith/RW7G5QDWPE4CUPU7A2VHBOZ3GC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RW7G5QDWPE4CUPU7A2VHBOZ3GC/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-11T22:54:07Z","links":{"resolver":"https://pith.science/pith/RW7G5QDWPE4CUPU7A2VHBOZ3GC","bundle":"https://pith.science/pith/RW7G5QDWPE4CUPU7A2VHBOZ3GC/bundle.json","state":"https://pith.science/pith/RW7G5QDWPE4CUPU7A2VHBOZ3GC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RW7G5QDWPE4CUPU7A2VHBOZ3GC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RW7G5QDWPE4CUPU7A2VHBOZ3GC","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":"302d19a18452b63763dad6ea8d3c2fe2f2a66507fde0311b19b9f7d3c73a1b95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T03:28:06Z","title_canon_sha256":"fb97de923ffa3668230911d0c2a17a46fd00c06836a7fa9c6fcb280f0c95cc9a"},"schema_version":"1.0","source":{"id":"2606.04400","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.04400","created_at":"2026-06-04T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"2606.04400v1","created_at":"2026-06-04T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04400","created_at":"2026-06-04T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"RW7G5QDWPE4C","created_at":"2026-06-04T01:09:06Z"},{"alias_kind":"pith_short_16","alias_value":"RW7G5QDWPE4CUPU7","created_at":"2026-06-04T01:09:06Z"},{"alias_kind":"pith_short_8","alias_value":"RW7G5QDW","created_at":"2026-06-04T01:09:06Z"}],"graph_snapshots":[{"event_id":"sha256:3993f1629d580b7d5d4f5597e67be2a1817e7919cd54fea69d3c15d1cf69d922","target":"graph","created_at":"2026-06-04T01:09: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.04400/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $F$ be a $k$-uniform hypergraph, abbreviated as $k$-graph. The codegree Tur\\'an density $\\pi_{\\mathrm{co}}(F)$ is the supremum over all $\\gamma \\in [0,1]$ such that, for arbitrarily large $n$, there exists an $n$-vertex $F$-free $k$-graph $H$ whose every $(k-1)$-subset of vertices lies in at least $\\gamma n$ edges. In this paper, we prove that there is a linear $k$-graph $F$ with $0<\\pi_{co}(F) < \\varepsilon$ for any $\\varepsilon>0$. The special case $k=3$ solve a question proposed by Ding, Lamaison, Liu, Wang and Yang (JLMS, 2025).","authors_text":"Xiaona Fang, Yaojun Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T03:28:06Z","title":"On linear $k$-graphs with codegree Tur\\'an density arbitrarily close to zero"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04400","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:9c5221086367d5a2e56abd5c503af18e37c4a9f18db9d5330ea0ad9bbbab96ae","target":"record","created_at":"2026-06-04T01:09: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":"302d19a18452b63763dad6ea8d3c2fe2f2a66507fde0311b19b9f7d3c73a1b95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T03:28:06Z","title_canon_sha256":"fb97de923ffa3668230911d0c2a17a46fd00c06836a7fa9c6fcb280f0c95cc9a"},"schema_version":"1.0","source":{"id":"2606.04400","kind":"arxiv","version":1}},"canonical_sha256":"8dbe6ec07679382a3e9f06aa70bb3b309d326cad7ec390629bb0e64e2b515a56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dbe6ec07679382a3e9f06aa70bb3b309d326cad7ec390629bb0e64e2b515a56","first_computed_at":"2026-06-04T01:09:06.636547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:09:06.636547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3ByCiCmkg5vhs0QW7UPNmpv/F2vUgqOq2ZwQYKU9sW4tmGE2stBoq/+/S2M2ws04hyy8wEFmLxW76MSdlm8UAg==","signature_status":"signed_v1","signed_at":"2026-06-04T01:09:06.636986Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.04400","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c5221086367d5a2e56abd5c503af18e37c4a9f18db9d5330ea0ad9bbbab96ae","sha256:3993f1629d580b7d5d4f5597e67be2a1817e7919cd54fea69d3c15d1cf69d922"],"state_sha256":"68fe1b53d5b4883737a8ae3df24a548a6e326c2c4412d267e8845a881fe776a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fEVdtHgPtQ88C4i4HCrejkJBVmlbaAmWIzc0vgPqQP2/4g8snPYbDy6V78ANuXynTsueg/M2CKHne3wxVJqiAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:54:07.538028Z","bundle_sha256":"ef63e0875e1a088ee689dec0116a9e77d701930236bf2ea30ad90a30d189984f"}}