{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IQUSNUTH2SGRXQCHPX3YQKLOSO","short_pith_number":"pith:IQUSNUTH","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"},"canonical_sha256":"442926d267d48d1bc0477df788296e93a0bd1be9889aeac4926b1b6783a2c8bb","source":{"kind":"arxiv","id":"1407.2588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2588","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2588v1","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2588","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"pith_short_12","alias_value":"IQUSNUTH2SGR","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IQUSNUTH2SGRXQCH","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IQUSNUTH","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IQUSNUTH2SGRXQCHPX3YQKLOSO","target":"record","payload":{"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"},"canonical_sha256":"442926d267d48d1bc0477df788296e93a0bd1be9889aeac4926b1b6783a2c8bb","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"},"source_kind":"arxiv","source_id":"1407.2588","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-05-18T02:48:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jdc3V9TEi+DmNB3pgEXcwPmvyNYgdX3S5syZUY4fYpSj/GGh8fH3RFiOWGVGnfirbunnOXMElLsXdyg5C2arDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:15:29.884228Z"},"content_sha256":"db953441210ccfe87076990cf4594a0262a46efb94614384deaa0f5fb71aa8ca","schema_version":"1.0","event_id":"sha256:db953441210ccfe87076990cf4594a0262a46efb94614384deaa0f5fb71aa8ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IQUSNUTH2SGRXQCHPX3YQKLOSO","target":"graph","payload":{"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"},"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-05-18T02:48:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k38TiI57QHl9B9/jYRmOMSXFFDEUyvflyWeYgHHrEaRzMMvzYaiuvu+R42dRTp+bGgcdm4OG0MCIRUkLFC8RCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:15:29.884584Z"},"content_sha256":"9415639cd9cbf9d0f99b70582738cda97852db120cce0ac8bf6519ddb7e4f390","schema_version":"1.0","event_id":"sha256:9415639cd9cbf9d0f99b70582738cda97852db120cce0ac8bf6519ddb7e4f390"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO/bundle.json","state_url":"https://pith.science/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO/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-05-28T12:15:29Z","links":{"resolver":"https://pith.science/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO","bundle":"https://pith.science/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO/bundle.json","state":"https://pith.science/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IQUSNUTH2SGRXQCHPX3YQKLOSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IQUSNUTH2SGRXQCHPX3YQKLOSO","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":"04a84225e7ffd41f87e35a3cfcbee7521105e2a139c792274ce4749b82dc31f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-09T19:09:16Z","title_canon_sha256":"73f16cac66943be249e1be294705f8de595795570ce49a277dc0decbf165d60f"},"schema_version":"1.0","source":{"id":"1407.2588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2588","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2588v1","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2588","created_at":"2026-05-18T02:48:01Z"},{"alias_kind":"pith_short_12","alias_value":"IQUSNUTH2SGR","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IQUSNUTH2SGRXQCH","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IQUSNUTH","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:9415639cd9cbf9d0f99b70582738cda97852db120cce0ac8bf6519ddb7e4f390","target":"graph","created_at":"2026-05-18T02:48:01Z","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"},"paper":{"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 ","authors_text":"Alexandr Kostochka, Dhruv Mubayi, Jacques Verstraete","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-09T19:09:16Z","title":"Turan Problems and Shadows III: expansions of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2588","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:db953441210ccfe87076990cf4594a0262a46efb94614384deaa0f5fb71aa8ca","target":"record","created_at":"2026-05-18T02:48:01Z","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":"04a84225e7ffd41f87e35a3cfcbee7521105e2a139c792274ce4749b82dc31f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-09T19:09:16Z","title_canon_sha256":"73f16cac66943be249e1be294705f8de595795570ce49a277dc0decbf165d60f"},"schema_version":"1.0","source":{"id":"1407.2588","kind":"arxiv","version":1}},"canonical_sha256":"442926d267d48d1bc0477df788296e93a0bd1be9889aeac4926b1b6783a2c8bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"442926d267d48d1bc0477df788296e93a0bd1be9889aeac4926b1b6783a2c8bb","first_computed_at":"2026-05-18T02:48:01.281638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:01.281638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UikUCWk+BCsc3MZYh8Gsl25WlAc/chVI0dPKrfPEUF8MdKw4+3H+r8F2K6d+LnLNHML1sWmn3scUUGmCgdsODg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:01.282062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db953441210ccfe87076990cf4594a0262a46efb94614384deaa0f5fb71aa8ca","sha256:9415639cd9cbf9d0f99b70582738cda97852db120cce0ac8bf6519ddb7e4f390"],"state_sha256":"0e1643f1fcb8bd8552fde6c6bd40358048a0f3c44099c24f7f2e2239044e356d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBlzz5Bch77GHoueOrcgeP3mMwTXMsarWob4PiAUG39na4n3vnl+p9YOWhdj1fwHB9+4SOkcofnmALp4DUGQBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:15:29.886529Z","bundle_sha256":"09e18723e55b8b95e6c7dbb4fe2e5a6ccd11c6c2b26dee377e0952e114c68fe0"}}