{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Q3HCPTB57CUXVASW26ZBPUUXTI","short_pith_number":"pith:Q3HCPTB5","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"},"canonical_sha256":"86ce27cc3df8a97a8256d7b217d2979a1d4b2d202d21e57d1e2387e3b7ac0967","source":{"kind":"arxiv","id":"1505.08078","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.08078","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1505.08078v1","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08078","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"Q3HCPTB57CUX","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q3HCPTB57CUXVASW","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q3HCPTB5","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Q3HCPTB57CUXVASW26ZBPUUXTI","target":"record","payload":{"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"},"canonical_sha256":"86ce27cc3df8a97a8256d7b217d2979a1d4b2d202d21e57d1e2387e3b7ac0967","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"},"source_kind":"arxiv","source_id":"1505.08078","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-18T01:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Um3Yu7//XMh+SQmUpqhrPt3/poJ+jPZvAtdfIbG4OCD/e6rjGSmAzcTd5oGN6eb7Wx2MM2FqCf4wLzx+WkPBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:35:58.652264Z"},"content_sha256":"13b19f69a1555038fa7724eff9d77dc1721f81b7d677fc06fde24a98daade72b","schema_version":"1.0","event_id":"sha256:13b19f69a1555038fa7724eff9d77dc1721f81b7d677fc06fde24a98daade72b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Q3HCPTB57CUXVASW26ZBPUUXTI","target":"graph","payload":{"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"},"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-18T01:59:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MP9D5BkyqOq2Lu8GOBq7TRgWYPJGHu64fTx037rH9M6yOhdCvVRGQDDV6KzUQmdwFNp/1Phj8DQGjlCTNOadAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:35:58.652617Z"},"content_sha256":"26ed875195a5975f0d30a152ef3679c6851cc6f39da876d6d600e93421ecfdb9","schema_version":"1.0","event_id":"sha256:26ed875195a5975f0d30a152ef3679c6851cc6f39da876d6d600e93421ecfdb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q3HCPTB57CUXVASW26ZBPUUXTI/bundle.json","state_url":"https://pith.science/pith/Q3HCPTB57CUXVASW26ZBPUUXTI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q3HCPTB57CUXVASW26ZBPUUXTI/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-28T08:35:58Z","links":{"resolver":"https://pith.science/pith/Q3HCPTB57CUXVASW26ZBPUUXTI","bundle":"https://pith.science/pith/Q3HCPTB57CUXVASW26ZBPUUXTI/bundle.json","state":"https://pith.science/pith/Q3HCPTB57CUXVASW26ZBPUUXTI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q3HCPTB57CUXVASW26ZBPUUXTI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Q3HCPTB57CUXVASW26ZBPUUXTI","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":"89bf8f751985b12a10db04737af73d96cefc94ee951640d9bdeddf6f9d3bf46b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T15:00:52Z","title_canon_sha256":"27269f1c1e883c2111d2b5645c9a7b29721563154c9170266ed8b391d4cd53fe"},"schema_version":"1.0","source":{"id":"1505.08078","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.08078","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"arxiv_version","alias_value":"1505.08078v1","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.08078","created_at":"2026-05-18T01:59:59Z"},{"alias_kind":"pith_short_12","alias_value":"Q3HCPTB57CUX","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q3HCPTB57CUXVASW","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q3HCPTB5","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:26ed875195a5975f0d30a152ef3679c6851cc6f39da876d6d600e93421ecfdb9","target":"graph","created_at":"2026-05-18T01:59:59Z","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 $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.","authors_text":"Dhruv Mubayi, Jacques Verstraete","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T15:00:52Z","title":"A survey of Tur\\'an problems for expansions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.08078","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:13b19f69a1555038fa7724eff9d77dc1721f81b7d677fc06fde24a98daade72b","target":"record","created_at":"2026-05-18T01:59:59Z","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":"89bf8f751985b12a10db04737af73d96cefc94ee951640d9bdeddf6f9d3bf46b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-29T15:00:52Z","title_canon_sha256":"27269f1c1e883c2111d2b5645c9a7b29721563154c9170266ed8b391d4cd53fe"},"schema_version":"1.0","source":{"id":"1505.08078","kind":"arxiv","version":1}},"canonical_sha256":"86ce27cc3df8a97a8256d7b217d2979a1d4b2d202d21e57d1e2387e3b7ac0967","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86ce27cc3df8a97a8256d7b217d2979a1d4b2d202d21e57d1e2387e3b7ac0967","first_computed_at":"2026-05-18T01:59:59.778228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:59.778228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BKhIzmTvSsHlEmTleCARO9K8neN4X/Fc7PA/Hhtt50a/DzB0zRqFdfGBTxLqjNoUEB2PAejdHEPl4IxNyO33AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:59.778824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.08078","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13b19f69a1555038fa7724eff9d77dc1721f81b7d677fc06fde24a98daade72b","sha256:26ed875195a5975f0d30a152ef3679c6851cc6f39da876d6d600e93421ecfdb9"],"state_sha256":"7c8ac6a0cfdc2377649b1f5a50f41c032d273d17f6fca406e19c6ecb80bc58c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LFxrzfF1gU7VarkKKAYeFuvCyKSfsTuBdMc2qTu4KfPsR/EtUlVUrj1FDQ9HqhR/oBNTiE+Ag4rRHbY5AoKDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:35:58.654609Z","bundle_sha256":"b0ebd5715d77920cc0c140b24d2481aaa9ccc88714b2fde250a1f7fce66705bc"}}