{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:7TKRWX3B3QKTW7I5U2BPDLCVEV","short_pith_number":"pith:7TKRWX3B","canonical_record":{"source":{"id":"2312.02879","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-05T16:49:11Z","cross_cats_sorted":[],"title_canon_sha256":"aab4c47135925ad916b0936830704242a161ad0dd334000fa98f7938e4a608fa","abstract_canon_sha256":"bf03f85cfd8333ae5066db4cfa70bd87c242fca728957349e3fe7000c649f6e4"},"schema_version":"1.0"},"canonical_sha256":"fcd51b5f61dc153b7d1da682f1ac55257f879e1475285168f73bbdaf014cedcd","source":{"kind":"arxiv","id":"2312.02879","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.02879","created_at":"2026-07-05T07:20:44Z"},{"alias_kind":"arxiv_version","alias_value":"2312.02879v1","created_at":"2026-07-05T07:20:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02879","created_at":"2026-07-05T07:20:44Z"},{"alias_kind":"pith_short_12","alias_value":"7TKRWX3B3QKT","created_at":"2026-07-05T07:20:44Z"},{"alias_kind":"pith_short_16","alias_value":"7TKRWX3B3QKTW7I5","created_at":"2026-07-05T07:20:44Z"},{"alias_kind":"pith_short_8","alias_value":"7TKRWX3B","created_at":"2026-07-05T07:20:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:7TKRWX3B3QKTW7I5U2BPDLCVEV","target":"record","payload":{"canonical_record":{"source":{"id":"2312.02879","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-05T16:49:11Z","cross_cats_sorted":[],"title_canon_sha256":"aab4c47135925ad916b0936830704242a161ad0dd334000fa98f7938e4a608fa","abstract_canon_sha256":"bf03f85cfd8333ae5066db4cfa70bd87c242fca728957349e3fe7000c649f6e4"},"schema_version":"1.0"},"canonical_sha256":"fcd51b5f61dc153b7d1da682f1ac55257f879e1475285168f73bbdaf014cedcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:20:44.070980Z","signature_b64":"B5lcD/RA94M5N4opAeY9RTEm+0/S0/l2RkZ6oo+ZClD6pRRHSt5TGYtu5URef9mwN+Avn3vsNEr60fXQArtQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcd51b5f61dc153b7d1da682f1ac55257f879e1475285168f73bbdaf014cedcd","last_reissued_at":"2026-07-05T07:20:44.070586Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:20:44.070586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.02879","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-07-05T07:20:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2Bi8h3eob0c3CPnOYuNrfpOtzZ7H4nsCDY7MdSEbac7r/n2lZL5ZcyxLUXnNxBnt6V0NhfGq5Gz1NHJi6OoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T07:40:06.287465Z"},"content_sha256":"9317ac7fbf3c24ba3d08bbac8cb7507c9ed3fe3585c650b3e473e061a9740e88","schema_version":"1.0","event_id":"sha256:9317ac7fbf3c24ba3d08bbac8cb7507c9ed3fe3585c650b3e473e061a9740e88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:7TKRWX3B3QKTW7I5U2BPDLCVEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vanishing codegree Tur\\'{a}n density implies vanishing uniform Tur\\'{a}n density","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haotian Yang, Hong Liu, Laihao Ding, Shuaichao Wang","submitted_at":"2023-12-05T16:49:11Z","abstract_excerpt":"For a $k$-uniform hypergraph (or simply $k$-graph) $F$, the codegree Tur\\'{a}n density $\\pi_{\\mathrm{co}}(F)$ is the infimum over all $\\alpha$ such that any $n$-vertex $k$-graph $H$ with every $(k-1)$-subset of $V(H)$ contained in at least $\\alpha n$ edges has a copy of $F$. The uniform Tur\\'{a}n density $\\pi_{\\therefore}(F)$ is the supremum over all $d$ such that there are infinitely many $F$-free $k$-graphs $H$ satisfying that any linear-size subhypergraph of $H$ has edge density at least $d$. Falgas-Ravry, Pikhurko, Vaughan and Volec [J. London Math. Soc., 2023] asked whether for every $3$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02879","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/2312.02879/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-07-05T07:20:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Nm14/nBCPTCqeyUqeAWGJ3KLIX8JNB4UvrsUbpjcvpUNqu/lgLf5s88ULf96nYdCvX05LIK+zQWHayv1l4FAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T07:40:06.287843Z"},"content_sha256":"ae410407cada3dae0bfd771def1f325b62fea83a88d5e05c4f9cff087ef8c315","schema_version":"1.0","event_id":"sha256:ae410407cada3dae0bfd771def1f325b62fea83a88d5e05c4f9cff087ef8c315"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7TKRWX3B3QKTW7I5U2BPDLCVEV/bundle.json","state_url":"https://pith.science/pith/7TKRWX3B3QKTW7I5U2BPDLCVEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7TKRWX3B3QKTW7I5U2BPDLCVEV/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-06T07:40:06Z","links":{"resolver":"https://pith.science/pith/7TKRWX3B3QKTW7I5U2BPDLCVEV","bundle":"https://pith.science/pith/7TKRWX3B3QKTW7I5U2BPDLCVEV/bundle.json","state":"https://pith.science/pith/7TKRWX3B3QKTW7I5U2BPDLCVEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7TKRWX3B3QKTW7I5U2BPDLCVEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:7TKRWX3B3QKTW7I5U2BPDLCVEV","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":"bf03f85cfd8333ae5066db4cfa70bd87c242fca728957349e3fe7000c649f6e4","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-05T16:49:11Z","title_canon_sha256":"aab4c47135925ad916b0936830704242a161ad0dd334000fa98f7938e4a608fa"},"schema_version":"1.0","source":{"id":"2312.02879","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.02879","created_at":"2026-07-05T07:20:44Z"},{"alias_kind":"arxiv_version","alias_value":"2312.02879v1","created_at":"2026-07-05T07:20:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.02879","created_at":"2026-07-05T07:20:44Z"},{"alias_kind":"pith_short_12","alias_value":"7TKRWX3B3QKT","created_at":"2026-07-05T07:20:44Z"},{"alias_kind":"pith_short_16","alias_value":"7TKRWX3B3QKTW7I5","created_at":"2026-07-05T07:20:44Z"},{"alias_kind":"pith_short_8","alias_value":"7TKRWX3B","created_at":"2026-07-05T07:20:44Z"}],"graph_snapshots":[{"event_id":"sha256:ae410407cada3dae0bfd771def1f325b62fea83a88d5e05c4f9cff087ef8c315","target":"graph","created_at":"2026-07-05T07:20:44Z","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/2312.02879/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a $k$-uniform hypergraph (or simply $k$-graph) $F$, the codegree Tur\\'{a}n density $\\pi_{\\mathrm{co}}(F)$ is the infimum over all $\\alpha$ such that any $n$-vertex $k$-graph $H$ with every $(k-1)$-subset of $V(H)$ contained in at least $\\alpha n$ edges has a copy of $F$. The uniform Tur\\'{a}n density $\\pi_{\\therefore}(F)$ is the supremum over all $d$ such that there are infinitely many $F$-free $k$-graphs $H$ satisfying that any linear-size subhypergraph of $H$ has edge density at least $d$. Falgas-Ravry, Pikhurko, Vaughan and Volec [J. London Math. Soc., 2023] asked whether for every $3$-","authors_text":"Haotian Yang, Hong Liu, Laihao Ding, Shuaichao Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-05T16:49:11Z","title":"Vanishing codegree Tur\\'{a}n density implies vanishing uniform Tur\\'{a}n density"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.02879","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:9317ac7fbf3c24ba3d08bbac8cb7507c9ed3fe3585c650b3e473e061a9740e88","target":"record","created_at":"2026-07-05T07:20:44Z","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":"bf03f85cfd8333ae5066db4cfa70bd87c242fca728957349e3fe7000c649f6e4","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2023-12-05T16:49:11Z","title_canon_sha256":"aab4c47135925ad916b0936830704242a161ad0dd334000fa98f7938e4a608fa"},"schema_version":"1.0","source":{"id":"2312.02879","kind":"arxiv","version":1}},"canonical_sha256":"fcd51b5f61dc153b7d1da682f1ac55257f879e1475285168f73bbdaf014cedcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcd51b5f61dc153b7d1da682f1ac55257f879e1475285168f73bbdaf014cedcd","first_computed_at":"2026-07-05T07:20:44.070586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:20:44.070586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B5lcD/RA94M5N4opAeY9RTEm+0/S0/l2RkZ6oo+ZClD6pRRHSt5TGYtu5URef9mwN+Avn3vsNEr60fXQArtQCA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:20:44.070980Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.02879","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9317ac7fbf3c24ba3d08bbac8cb7507c9ed3fe3585c650b3e473e061a9740e88","sha256:ae410407cada3dae0bfd771def1f325b62fea83a88d5e05c4f9cff087ef8c315"],"state_sha256":"b83900de9c5200b2de01aef7b726a1d1d4db9095038a8c70e47c15feebeba836"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NCT0dGKBpksXHQeHEozLEFKwcEo7FyaaV0k6CCxdqPeoHEcVKhN2SWXMmgFG5k1d3IvJm8Eer+HkpJW4E9/JBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T07:40:06.290072Z","bundle_sha256":"5710b0fc3ca04e9556bb5369a7009cd6add21aae31c13885e71260e309d8326c"}}