{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IQUSNUTH2SGRXQCHPX3YQKLOSO","short_pith_number":"pith:IQUSNUTH","schema_version":"1.0","canonical_sha256":"442926d267d48d1bc0477df788296e93a0bd1be9889aeac4926b1b6783a2c8bb","source":{"kind":"arxiv","id":"1407.2588","version":1},"attestation_state":"computed","paper":{"title":"Turan Problems and Shadows III: expansions of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Dhruv Mubayi, Jacques Verstraete","submitted_at":"2014-07-09T19:09:16Z","abstract_excerpt":"The expansion $G^+$ of a graph $G$ is the $3$-uniform hypergraph obtained from $G$ by enlarging each edge of $G$ with a new vertex disjoint from $V(G)$ such that distinct edges are enlarged by distinct vertices. Let $ex_3(n,F)$ denote the maximum number of edges in a $3$-uniform hypergraph with $n$ vertices not containing any copy of a $3$-uniform hypergraph $F$. The study of $ex_3(n,G^+)$ includes some well-researched problems, including the case that $F$ consists of $k$ disjoint edges, $G$ is a triangle, $G$ is a path or cycle, and $G$ is a tree. In this paper we initiate a broader study of "},"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":"1407.2588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-09T19:09:16Z","cross_cats_sorted":[],"title_canon_sha256":"73f16cac66943be249e1be294705f8de595795570ce49a277dc0decbf165d60f","abstract_canon_sha256":"04a84225e7ffd41f87e35a3cfcbee7521105e2a139c792274ce4749b82dc31f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:01.282062Z","signature_b64":"UikUCWk+BCsc3MZYh8Gsl25WlAc/chVI0dPKrfPEUF8MdKw4+3H+r8F2K6d+LnLNHML1sWmn3scUUGmCgdsODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"442926d267d48d1bc0477df788296e93a0bd1be9889aeac4926b1b6783a2c8bb","last_reissued_at":"2026-05-18T02:48:01.281638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:01.281638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Turan Problems and Shadows III: expansions of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Dhruv Mubayi, Jacques Verstraete","submitted_at":"2014-07-09T19:09:16Z","abstract_excerpt":"The expansion $G^+$ of a graph $G$ is the $3$-uniform hypergraph obtained from $G$ by enlarging each edge of $G$ with a new vertex disjoint from $V(G)$ such that distinct edges are enlarged by distinct vertices. Let $ex_3(n,F)$ denote the maximum number of edges in a $3$-uniform hypergraph with $n$ vertices not containing any copy of a $3$-uniform hypergraph $F$. The study of $ex_3(n,G^+)$ includes some well-researched problems, including the case that $F$ consists of $k$ disjoint edges, $G$ is a triangle, $G$ is a path or cycle, and $G$ is a tree. In this paper we initiate a broader study of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2588","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":"1407.2588","created_at":"2026-05-18T02:48:01.281699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.2588v1","created_at":"2026-05-18T02:48:01.281699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2588","created_at":"2026-05-18T02:48:01.281699+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQUSNUTH2SGR","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQUSNUTH2SGRXQCH","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQUSNUTH","created_at":"2026-05-18T12:28:33.132498+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/IQUSNUTH2SGRXQCHPX3YQKLOSO","json":"https://pith.science/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO.json","graph_json":"https://pith.science/api/pith-number/IQUSNUTH2SGRXQCHPX3YQKLOSO/graph.json","events_json":"https://pith.science/api/pith-number/IQUSNUTH2SGRXQCHPX3YQKLOSO/events.json","paper":"https://pith.science/paper/IQUSNUTH"},"agent_actions":{"view_html":"https://pith.science/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO","download_json":"https://pith.science/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO.json","view_paper":"https://pith.science/paper/IQUSNUTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.2588&json=true","fetch_graph":"https://pith.science/api/pith-number/IQUSNUTH2SGRXQCHPX3YQKLOSO/graph.json","fetch_events":"https://pith.science/api/pith-number/IQUSNUTH2SGRXQCHPX3YQKLOSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO/action/storage_attestation","attest_author":"https://pith.science/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO/action/author_attestation","sign_citation":"https://pith.science/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO/action/citation_signature","submit_replication":"https://pith.science/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO/action/replication_record"}},"created_at":"2026-05-18T02:48:01.281699+00:00","updated_at":"2026-05-18T02:48:01.281699+00:00"}