{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:OATZWW5B6GFMWE2NKJ63DO3KWW","short_pith_number":"pith:OATZWW5B","canonical_record":{"source":{"id":"2206.05884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-13T02:34:02Z","cross_cats_sorted":[],"title_canon_sha256":"85bd7f404186c019d943bc6c07f002b2ded218738692c7e1a0778f4126b2fc49","abstract_canon_sha256":"9c7e12d4d2980fb342eae37feb816d36528326b7242980cc424e79c51b4215e8"},"schema_version":"1.0"},"canonical_sha256":"70279b5ba1f18acb134d527db1bb6ab5ad7c27a208d8ca50cc985001b8e7cda6","source":{"kind":"arxiv","id":"2206.05884","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.05884","created_at":"2026-07-05T04:31:03Z"},{"alias_kind":"arxiv_version","alias_value":"2206.05884v1","created_at":"2026-07-05T04:31:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.05884","created_at":"2026-07-05T04:31:03Z"},{"alias_kind":"pith_short_12","alias_value":"OATZWW5B6GFM","created_at":"2026-07-05T04:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"OATZWW5B6GFMWE2N","created_at":"2026-07-05T04:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"OATZWW5B","created_at":"2026-07-05T04:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:OATZWW5B6GFMWE2NKJ63DO3KWW","target":"record","payload":{"canonical_record":{"source":{"id":"2206.05884","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-13T02:34:02Z","cross_cats_sorted":[],"title_canon_sha256":"85bd7f404186c019d943bc6c07f002b2ded218738692c7e1a0778f4126b2fc49","abstract_canon_sha256":"9c7e12d4d2980fb342eae37feb816d36528326b7242980cc424e79c51b4215e8"},"schema_version":"1.0"},"canonical_sha256":"70279b5ba1f18acb134d527db1bb6ab5ad7c27a208d8ca50cc985001b8e7cda6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:03.877437Z","signature_b64":"79N+MfRZQX4gDA6y0qlxJ2CR3UBHz42/30XMBwcjacxytzxW0mFas/qUnDEy18r6p1XxviXUdGmVy6+3TrSJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70279b5ba1f18acb134d527db1bb6ab5ad7c27a208d8ca50cc985001b8e7cda6","last_reissued_at":"2026-07-05T04:31:03.876949Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:03.876949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.05884","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-05T04:31:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z3WmQgT13F0k/pYzG+5VsVMwnA0Yf8zhbBnHwGf8i7HRMf6dzlZPIj9nhs4ya8FKjbs7M4jtXb5IqXlhT6sMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:54:58.360246Z"},"content_sha256":"8a2b34adac1af47244b6fb8c5b9639c1f82fde8b026d78c2967e0849f312274a","schema_version":"1.0","event_id":"sha256:8a2b34adac1af47244b6fb8c5b9639c1f82fde8b026d78c2967e0849f312274a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:OATZWW5B6GFMWE2NKJ63DO3KWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on the Tur\\'an number for the traces of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bingchen Qian, Gennian Ge","submitted_at":"2022-06-13T02:34:02Z","abstract_excerpt":"Let $\\mathcal{H}$ be an $r$-uniform hypergraph and $F$ be a graph. We say $\\mathcal{H}$ contains $F$ as a trace if there exists some set $S\\subseteq V(\\mathcal{H})$ such that $\\mathcal{H}|_{S}:=\\{E\\cap S: E\\in E(\\mathcal{H})\\}$ contains a subgraph isomorphic to $F.$ Let $ex_r(n,Tr(F))$ denote the maximum number of edges of an $n$-vertex $r$-uniform hypergraph $\\mathcal{H}$ which does not contain $F$ as a trace. In this paper, we improve the lower bounds of $ex_r(n,Tr(F))$ when $F$ is a star, and give some optimal cases. We also improve the upper bound for the case when $\\mathcal{H}$ is $3$-uni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.05884","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/2206.05884/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-05T04:31:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KdDhGub5EOQddxq4MNT7aA6ny4rgzwwcbt0PZD9xL6ERKCAr8OS6W7LpWByQxli5thoawG4myDdVrw4qpDKcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T22:54:58.360775Z"},"content_sha256":"759a8a5f83259a6cd8330eb77394b4e9d78c8bc465969f2582eb30e3be4fc414","schema_version":"1.0","event_id":"sha256:759a8a5f83259a6cd8330eb77394b4e9d78c8bc465969f2582eb30e3be4fc414"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OATZWW5B6GFMWE2NKJ63DO3KWW/bundle.json","state_url":"https://pith.science/pith/OATZWW5B6GFMWE2NKJ63DO3KWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OATZWW5B6GFMWE2NKJ63DO3KWW/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-08-03T22:54:58Z","links":{"resolver":"https://pith.science/pith/OATZWW5B6GFMWE2NKJ63DO3KWW","bundle":"https://pith.science/pith/OATZWW5B6GFMWE2NKJ63DO3KWW/bundle.json","state":"https://pith.science/pith/OATZWW5B6GFMWE2NKJ63DO3KWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OATZWW5B6GFMWE2NKJ63DO3KWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:OATZWW5B6GFMWE2NKJ63DO3KWW","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":"9c7e12d4d2980fb342eae37feb816d36528326b7242980cc424e79c51b4215e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-13T02:34:02Z","title_canon_sha256":"85bd7f404186c019d943bc6c07f002b2ded218738692c7e1a0778f4126b2fc49"},"schema_version":"1.0","source":{"id":"2206.05884","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.05884","created_at":"2026-07-05T04:31:03Z"},{"alias_kind":"arxiv_version","alias_value":"2206.05884v1","created_at":"2026-07-05T04:31:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.05884","created_at":"2026-07-05T04:31:03Z"},{"alias_kind":"pith_short_12","alias_value":"OATZWW5B6GFM","created_at":"2026-07-05T04:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"OATZWW5B6GFMWE2N","created_at":"2026-07-05T04:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"OATZWW5B","created_at":"2026-07-05T04:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:759a8a5f83259a6cd8330eb77394b4e9d78c8bc465969f2582eb30e3be4fc414","target":"graph","created_at":"2026-07-05T04:31:03Z","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/2206.05884/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\mathcal{H}$ be an $r$-uniform hypergraph and $F$ be a graph. We say $\\mathcal{H}$ contains $F$ as a trace if there exists some set $S\\subseteq V(\\mathcal{H})$ such that $\\mathcal{H}|_{S}:=\\{E\\cap S: E\\in E(\\mathcal{H})\\}$ contains a subgraph isomorphic to $F.$ Let $ex_r(n,Tr(F))$ denote the maximum number of edges of an $n$-vertex $r$-uniform hypergraph $\\mathcal{H}$ which does not contain $F$ as a trace. In this paper, we improve the lower bounds of $ex_r(n,Tr(F))$ when $F$ is a star, and give some optimal cases. We also improve the upper bound for the case when $\\mathcal{H}$ is $3$-uni","authors_text":"Bingchen Qian, Gennian Ge","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-13T02:34:02Z","title":"A note on the Tur\\'an number for the traces of hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.05884","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:8a2b34adac1af47244b6fb8c5b9639c1f82fde8b026d78c2967e0849f312274a","target":"record","created_at":"2026-07-05T04:31:03Z","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":"9c7e12d4d2980fb342eae37feb816d36528326b7242980cc424e79c51b4215e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-13T02:34:02Z","title_canon_sha256":"85bd7f404186c019d943bc6c07f002b2ded218738692c7e1a0778f4126b2fc49"},"schema_version":"1.0","source":{"id":"2206.05884","kind":"arxiv","version":1}},"canonical_sha256":"70279b5ba1f18acb134d527db1bb6ab5ad7c27a208d8ca50cc985001b8e7cda6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70279b5ba1f18acb134d527db1bb6ab5ad7c27a208d8ca50cc985001b8e7cda6","first_computed_at":"2026-07-05T04:31:03.876949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:31:03.876949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"79N+MfRZQX4gDA6y0qlxJ2CR3UBHz42/30XMBwcjacxytzxW0mFas/qUnDEy18r6p1XxviXUdGmVy6+3TrSJCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:31:03.877437Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.05884","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a2b34adac1af47244b6fb8c5b9639c1f82fde8b026d78c2967e0849f312274a","sha256:759a8a5f83259a6cd8330eb77394b4e9d78c8bc465969f2582eb30e3be4fc414"],"state_sha256":"273ad4a37eb5d262d213923e136ef5929882fd78bb0fb04d49ac88f24c7df7f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kh2MFUMNfXQMhZJiEnKFEMv/3fMH94+g+YIoj7XxmeWCSlfaiaQRG8tP5bSkPCJy/yIP6lG5sM5s1Fo3TYR1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T22:54:58.366156Z","bundle_sha256":"2775abaa050eee84ba5c9468d506054795521632cc2415b19dd82f4e92c05450"}}