{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IWVCAKJGNAXVXFVOXMUNPBH7SC","short_pith_number":"pith:IWVCAKJG","schema_version":"1.0","canonical_sha256":"45aa202926682f5b96aebb28d784ff9096536b43439a448b1f43d6bdb7ca5df3","source":{"kind":"arxiv","id":"2002.07350","version":1},"attestation_state":"computed","paper":{"title":"Induced Tur\\'an problems and traces of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ruth Luo, Zoltan Furedi","submitted_at":"2020-02-18T03:37:08Z","abstract_excerpt":"Let $F$ be a graph. We say that a hypergraph $H$ contains an induced Berge $F$ if the vertices of $F$ can be embedded to $H$ (e.g., $V(F)\\subseteq V(H)$) and there exists an injective mapping $f$ from the edges of $F$ to the hyperedges of $H$ such that $f(xy) \\cap V(F) = \\{x,y\\}$ holds for each edge $xy$ of $F$. In other words, $H$ contains $F$ as a trace.\n  Let $ex_{r}(n,B_{ind} F)$ denote the maximum number of edges in an $r$-uniform hypergraph with no induced Berge $F$. Let $ex(n,K_r, F)$ denote the maximum number of $K_r$'s in an $F$-free graph on $n$ vertices. We show that these two Tur\\'"},"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":"2002.07350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-02-18T03:37:08Z","cross_cats_sorted":[],"title_canon_sha256":"8e4f5cfb91131b1bd03917b39a5b50e7cde137bf4c027545e5714ee7c5d1ba6f","abstract_canon_sha256":"27da43ae338aab8ec848e34a24ea6cc0c028f430300ca293e1c41a11426de549"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:41:16.110876Z","signature_b64":"11PvudNzsm8w2bycB/wrPzdbNR6xzIcpohrpYDFSFw7kISH8HahJZ4GpwkJ9roX9iL89dcIyXBDe1Un4U9V8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45aa202926682f5b96aebb28d784ff9096536b43439a448b1f43d6bdb7ca5df3","last_reissued_at":"2026-07-05T00:41:16.110414Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:41:16.110414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced Tur\\'an problems and traces of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ruth Luo, Zoltan Furedi","submitted_at":"2020-02-18T03:37:08Z","abstract_excerpt":"Let $F$ be a graph. We say that a hypergraph $H$ contains an induced Berge $F$ if the vertices of $F$ can be embedded to $H$ (e.g., $V(F)\\subseteq V(H)$) and there exists an injective mapping $f$ from the edges of $F$ to the hyperedges of $H$ such that $f(xy) \\cap V(F) = \\{x,y\\}$ holds for each edge $xy$ of $F$. In other words, $H$ contains $F$ as a trace.\n  Let $ex_{r}(n,B_{ind} F)$ denote the maximum number of edges in an $r$-uniform hypergraph with no induced Berge $F$. Let $ex(n,K_r, F)$ denote the maximum number of $K_r$'s in an $F$-free graph on $n$ vertices. We show that these two Tur\\'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.07350","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/2002.07350/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":"2002.07350","created_at":"2026-07-05T00:41:16.110484+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.07350v1","created_at":"2026-07-05T00:41:16.110484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.07350","created_at":"2026-07-05T00:41:16.110484+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWVCAKJGNAXV","created_at":"2026-07-05T00:41:16.110484+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWVCAKJGNAXVXFVO","created_at":"2026-07-05T00:41:16.110484+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWVCAKJG","created_at":"2026-07-05T00:41:16.110484+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/IWVCAKJGNAXVXFVOXMUNPBH7SC","json":"https://pith.science/pith/IWVCAKJGNAXVXFVOXMUNPBH7SC.json","graph_json":"https://pith.science/api/pith-number/IWVCAKJGNAXVXFVOXMUNPBH7SC/graph.json","events_json":"https://pith.science/api/pith-number/IWVCAKJGNAXVXFVOXMUNPBH7SC/events.json","paper":"https://pith.science/paper/IWVCAKJG"},"agent_actions":{"view_html":"https://pith.science/pith/IWVCAKJGNAXVXFVOXMUNPBH7SC","download_json":"https://pith.science/pith/IWVCAKJGNAXVXFVOXMUNPBH7SC.json","view_paper":"https://pith.science/paper/IWVCAKJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.07350&json=true","fetch_graph":"https://pith.science/api/pith-number/IWVCAKJGNAXVXFVOXMUNPBH7SC/graph.json","fetch_events":"https://pith.science/api/pith-number/IWVCAKJGNAXVXFVOXMUNPBH7SC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWVCAKJGNAXVXFVOXMUNPBH7SC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWVCAKJGNAXVXFVOXMUNPBH7SC/action/storage_attestation","attest_author":"https://pith.science/pith/IWVCAKJGNAXVXFVOXMUNPBH7SC/action/author_attestation","sign_citation":"https://pith.science/pith/IWVCAKJGNAXVXFVOXMUNPBH7SC/action/citation_signature","submit_replication":"https://pith.science/pith/IWVCAKJGNAXVXFVOXMUNPBH7SC/action/replication_record"}},"created_at":"2026-07-05T00:41:16.110484+00:00","updated_at":"2026-07-05T00:41:16.110484+00:00"}