{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Q3HCPTB57CUXVASW26ZBPUUXTI","short_pith_number":"pith:Q3HCPTB5","schema_version":"1.0","canonical_sha256":"86ce27cc3df8a97a8256d7b217d2979a1d4b2d202d21e57d1e2387e3b7ac0967","source":{"kind":"arxiv","id":"1505.08078","version":1},"attestation_state":"computed","paper":{"title":"A survey of Tur\\'an problems for expansions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, Jacques Verstraete","submitted_at":"2015-05-29T15:00:52Z","abstract_excerpt":"The $r$-expansion $G^+$ of a graph $G$ is the $r$-uniform hypergraph obtained from $G$ by enlarging each edge of $G$ with a vertex subset of size $r-2$ disjoint from $V(G)$ such that distinct edges are enlarged by disjoint subsets. Let $ex_r(n,F)$ denote the maximum number of edges in an $r$-uniform hypergraph with $n$ vertices not containing any copy of the $r$-uniform hypergraph $F$. Many problems in extremal set theory ask for the determination of $ex_r(n,G^+)$ for various graphs $G$. We survey these Tur\\'an-type problems, focusing on recent developments."},"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":"1505.08078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T15:00:52Z","cross_cats_sorted":[],"title_canon_sha256":"27269f1c1e883c2111d2b5645c9a7b29721563154c9170266ed8b391d4cd53fe","abstract_canon_sha256":"89bf8f751985b12a10db04737af73d96cefc94ee951640d9bdeddf6f9d3bf46b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:59.778824Z","signature_b64":"BKhIzmTvSsHlEmTleCARO9K8neN4X/Fc7PA/Hhtt50a/DzB0zRqFdfGBTxLqjNoUEB2PAejdHEPl4IxNyO33AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86ce27cc3df8a97a8256d7b217d2979a1d4b2d202d21e57d1e2387e3b7ac0967","last_reissued_at":"2026-05-18T01:59:59.778228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:59.778228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A survey of Tur\\'an problems for expansions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, Jacques Verstraete","submitted_at":"2015-05-29T15:00:52Z","abstract_excerpt":"The $r$-expansion $G^+$ of a graph $G$ is the $r$-uniform hypergraph obtained from $G$ by enlarging each edge of $G$ with a vertex subset of size $r-2$ disjoint from $V(G)$ such that distinct edges are enlarged by disjoint subsets. Let $ex_r(n,F)$ denote the maximum number of edges in an $r$-uniform hypergraph with $n$ vertices not containing any copy of the $r$-uniform hypergraph $F$. Many problems in extremal set theory ask for the determination of $ex_r(n,G^+)$ for various graphs $G$. We survey these Tur\\'an-type problems, focusing on recent developments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08078","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":""},"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":"1505.08078","created_at":"2026-05-18T01:59:59.778328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.08078v1","created_at":"2026-05-18T01:59:59.778328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08078","created_at":"2026-05-18T01:59:59.778328+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3HCPTB57CUX","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3HCPTB57CUXVASW","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3HCPTB5","created_at":"2026-05-18T12:29:37.295048+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/Q3HCPTB57CUXVASW26ZBPUUXTI","json":"https://pith.science/pith/Q3HCPTB57CUXVASW26ZBPUUXTI.json","graph_json":"https://pith.science/api/pith-number/Q3HCPTB57CUXVASW26ZBPUUXTI/graph.json","events_json":"https://pith.science/api/pith-number/Q3HCPTB57CUXVASW26ZBPUUXTI/events.json","paper":"https://pith.science/paper/Q3HCPTB5"},"agent_actions":{"view_html":"https://pith.science/pith/Q3HCPTB57CUXVASW26ZBPUUXTI","download_json":"https://pith.science/pith/Q3HCPTB57CUXVASW26ZBPUUXTI.json","view_paper":"https://pith.science/paper/Q3HCPTB5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.08078&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3HCPTB57CUXVASW26ZBPUUXTI/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3HCPTB57CUXVASW26ZBPUUXTI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3HCPTB57CUXVASW26ZBPUUXTI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3HCPTB57CUXVASW26ZBPUUXTI/action/storage_attestation","attest_author":"https://pith.science/pith/Q3HCPTB57CUXVASW26ZBPUUXTI/action/author_attestation","sign_citation":"https://pith.science/pith/Q3HCPTB57CUXVASW26ZBPUUXTI/action/citation_signature","submit_replication":"https://pith.science/pith/Q3HCPTB57CUXVASW26ZBPUUXTI/action/replication_record"}},"created_at":"2026-05-18T01:59:59.778328+00:00","updated_at":"2026-05-18T01:59:59.778328+00:00"}