{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:IWVCAKJGNAXVXFVOXMUNPBH7SC","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":"27da43ae338aab8ec848e34a24ea6cc0c028f430300ca293e1c41a11426de549","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-02-18T03:37:08Z","title_canon_sha256":"8e4f5cfb91131b1bd03917b39a5b50e7cde137bf4c027545e5714ee7c5d1ba6f"},"schema_version":"1.0","source":{"id":"2002.07350","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.07350","created_at":"2026-07-05T00:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"2002.07350v1","created_at":"2026-07-05T00:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.07350","created_at":"2026-07-05T00:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"IWVCAKJGNAXV","created_at":"2026-07-05T00:41:16Z"},{"alias_kind":"pith_short_16","alias_value":"IWVCAKJGNAXVXFVO","created_at":"2026-07-05T00:41:16Z"},{"alias_kind":"pith_short_8","alias_value":"IWVCAKJG","created_at":"2026-07-05T00:41:16Z"}],"graph_snapshots":[{"event_id":"sha256:2e01e71ea8fbe5725f34bae93fd5367521456181014e7d69117e05101f8c81c3","target":"graph","created_at":"2026-07-05T00:41:16Z","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/2002.07350/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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\\'","authors_text":"Ruth Luo, Zoltan Furedi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-02-18T03:37:08Z","title":"Induced Tur\\'an problems and traces of hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.07350","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:28cfd18fb68e147069b88e18a0d241030cc86f5967257825b1f6c7e4855b5c1d","target":"record","created_at":"2026-07-05T00:41:16Z","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":"27da43ae338aab8ec848e34a24ea6cc0c028f430300ca293e1c41a11426de549","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-02-18T03:37:08Z","title_canon_sha256":"8e4f5cfb91131b1bd03917b39a5b50e7cde137bf4c027545e5714ee7c5d1ba6f"},"schema_version":"1.0","source":{"id":"2002.07350","kind":"arxiv","version":1}},"canonical_sha256":"45aa202926682f5b96aebb28d784ff9096536b43439a448b1f43d6bdb7ca5df3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45aa202926682f5b96aebb28d784ff9096536b43439a448b1f43d6bdb7ca5df3","first_computed_at":"2026-07-05T00:41:16.110414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:41:16.110414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"11PvudNzsm8w2bycB/wrPzdbNR6xzIcpohrpYDFSFw7kISH8HahJZ4GpwkJ9roX9iL89dcIyXBDe1Un4U9V8BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:41:16.110876Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.07350","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28cfd18fb68e147069b88e18a0d241030cc86f5967257825b1f6c7e4855b5c1d","sha256:2e01e71ea8fbe5725f34bae93fd5367521456181014e7d69117e05101f8c81c3"],"state_sha256":"562d7169c43663ce546dd895d305bf6dd5d6c24785755d13ffc0c4c0f1e6c1dc"}