{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:F7CXBOW7H57NB244PIDYICMLFA","short_pith_number":"pith:F7CXBOW7","canonical_record":{"source":{"id":"1402.0544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-03T23:15:54Z","cross_cats_sorted":[],"title_canon_sha256":"d4835396c0a5f6e013023d41b82bc94cbe517d3365a0e62eab5f8a37daa82d1b","abstract_canon_sha256":"185a2be499372956d4a000e992279e932ad3dab4ec191746e3821a171e8cbab3"},"schema_version":"1.0"},"canonical_sha256":"2fc570badf3f7ed0eb9c7a0784098b28238e73c17b205975fa3d1d4e59a3d829","source":{"kind":"arxiv","id":"1402.0544","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0544","created_at":"2026-05-18T03:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0544v1","created_at":"2026-05-18T03:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0544","created_at":"2026-05-18T03:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"F7CXBOW7H57N","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"F7CXBOW7H57NB244","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"F7CXBOW7","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:F7CXBOW7H57NB244PIDYICMLFA","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-03T23:15:54Z","cross_cats_sorted":[],"title_canon_sha256":"d4835396c0a5f6e013023d41b82bc94cbe517d3365a0e62eab5f8a37daa82d1b","abstract_canon_sha256":"185a2be499372956d4a000e992279e932ad3dab4ec191746e3821a171e8cbab3"},"schema_version":"1.0"},"canonical_sha256":"2fc570badf3f7ed0eb9c7a0784098b28238e73c17b205975fa3d1d4e59a3d829","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:14.039901Z","signature_b64":"/DELVj5bI/wXeKs6jxUtOv3DuEwcL+s60cdu3cBiYPAfFlv4br3wzsG3yX6EUd7j/1eNtTj8SABJHNarPln+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fc570badf3f7ed0eb9c7a0784098b28238e73c17b205975fa3d1d4e59a3d829","last_reissued_at":"2026-05-18T03:00:14.039138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:14.039138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0544","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-18T03:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OsKFbB598QhuDBMy0JHA7oIhTjUcqNvM7zKrEE+IkqOHfndHFu6LKe1ViRXUCOCX6+pfV4qeYozmVyr+bW4zBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:11:46.871570Z"},"content_sha256":"fad23193ed387563e726d9aa6bdcbc12d275e24455b0f0ea0d92a86670a2c9af","schema_version":"1.0","event_id":"sha256:fad23193ed387563e726d9aa6bdcbc12d275e24455b0f0ea0d92a86670a2c9af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:F7CXBOW7H57NB244PIDYICMLFA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Turan Problems and Shadows II: Trees","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-02-03T23:15:54Z","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 vertex disjoint from $V(G)$ such that distinct edges are enlarged by distinct vertices. Let ex$_r(n,F)$ denote the maximum number of edges in an $r$-uniform hypergraph with $n$ vertices not containing any copy of $F$. The authors \\cite{KMV} recently determined ex$_3(n,G^+)$ more generally, namely when $G$ is a path or cycle, thus settling conjectures of F\\\"uredi-Jiang \\cite{FJ} (for cycles) and F\\\"uredi-Jiang-Seiver \\cite{FJS} (for paths). Here we continue this project by deter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0544","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-18T03:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FcB8t656vs6ItDqYAG2wYbo5Bx/Y5VbYs1euzLD+AyvTEAlF8v/pJblZTFNZrlEThCPo6a1qSvw79P8DJNpODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:11:46.871923Z"},"content_sha256":"4a16269d4fc1d5e733b14e91fd8d5cd06632a14d711b3a959d8d321b958da64b","schema_version":"1.0","event_id":"sha256:4a16269d4fc1d5e733b14e91fd8d5cd06632a14d711b3a959d8d321b958da64b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7CXBOW7H57NB244PIDYICMLFA/bundle.json","state_url":"https://pith.science/pith/F7CXBOW7H57NB244PIDYICMLFA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7CXBOW7H57NB244PIDYICMLFA/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-28T13:11:46Z","links":{"resolver":"https://pith.science/pith/F7CXBOW7H57NB244PIDYICMLFA","bundle":"https://pith.science/pith/F7CXBOW7H57NB244PIDYICMLFA/bundle.json","state":"https://pith.science/pith/F7CXBOW7H57NB244PIDYICMLFA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7CXBOW7H57NB244PIDYICMLFA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:F7CXBOW7H57NB244PIDYICMLFA","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":"185a2be499372956d4a000e992279e932ad3dab4ec191746e3821a171e8cbab3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-03T23:15:54Z","title_canon_sha256":"d4835396c0a5f6e013023d41b82bc94cbe517d3365a0e62eab5f8a37daa82d1b"},"schema_version":"1.0","source":{"id":"1402.0544","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0544","created_at":"2026-05-18T03:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0544v1","created_at":"2026-05-18T03:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0544","created_at":"2026-05-18T03:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"F7CXBOW7H57N","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"F7CXBOW7H57NB244","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"F7CXBOW7","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:4a16269d4fc1d5e733b14e91fd8d5cd06632a14d711b3a959d8d321b958da64b","target":"graph","created_at":"2026-05-18T03:00:14Z","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 vertex disjoint from $V(G)$ such that distinct edges are enlarged by distinct vertices. Let ex$_r(n,F)$ denote the maximum number of edges in an $r$-uniform hypergraph with $n$ vertices not containing any copy of $F$. The authors \\cite{KMV} recently determined ex$_3(n,G^+)$ more generally, namely when $G$ is a path or cycle, thus settling conjectures of F\\\"uredi-Jiang \\cite{FJ} (for cycles) and F\\\"uredi-Jiang-Seiver \\cite{FJS} (for paths). Here we continue this project by deter","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-02-03T23:15:54Z","title":"Turan Problems and Shadows II: Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0544","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:fad23193ed387563e726d9aa6bdcbc12d275e24455b0f0ea0d92a86670a2c9af","target":"record","created_at":"2026-05-18T03:00:14Z","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":"185a2be499372956d4a000e992279e932ad3dab4ec191746e3821a171e8cbab3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-03T23:15:54Z","title_canon_sha256":"d4835396c0a5f6e013023d41b82bc94cbe517d3365a0e62eab5f8a37daa82d1b"},"schema_version":"1.0","source":{"id":"1402.0544","kind":"arxiv","version":1}},"canonical_sha256":"2fc570badf3f7ed0eb9c7a0784098b28238e73c17b205975fa3d1d4e59a3d829","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fc570badf3f7ed0eb9c7a0784098b28238e73c17b205975fa3d1d4e59a3d829","first_computed_at":"2026-05-18T03:00:14.039138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:14.039138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/DELVj5bI/wXeKs6jxUtOv3DuEwcL+s60cdu3cBiYPAfFlv4br3wzsG3yX6EUd7j/1eNtTj8SABJHNarPln+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:14.039901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0544","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fad23193ed387563e726d9aa6bdcbc12d275e24455b0f0ea0d92a86670a2c9af","sha256:4a16269d4fc1d5e733b14e91fd8d5cd06632a14d711b3a959d8d321b958da64b"],"state_sha256":"29201065498dcfa178abaa82bdf5275e007e034434bba61faa96fc0082559e18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HSJu+ApQJTB4XIMHAKG5/QE0Esf1OKYaM1wzxGnmv2+xw3/GDCWai3YOmvv7CCZJ/MpLS4hVs1+67kt3Ip7UBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:11:46.873862Z","bundle_sha256":"14804625a166528cc34f6f7ee7377b9d3ef3e98d606c19abe4192f4ba808556d"}}