{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CMTG6AELTKICGLCUWCLE7SIWQE","short_pith_number":"pith:CMTG6AEL","schema_version":"1.0","canonical_sha256":"13266f008b9a90232c54b0964fc9168107f104806de0c86373053fe1ad2c0ae6","source":{"kind":"arxiv","id":"1807.07057","version":2},"attestation_state":"computed","paper":{"title":"Hypergraphs not containing a tight tree with a bounded trunk ~II: 3-trees with a trunk of size 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Dhruv Mubayi, Jacques Verstra\\\"ete, Tao Jiang, Zolt\\'an F\\\"uredi","submitted_at":"2018-07-18T17:48:00Z","abstract_excerpt":"A tight $r$-tree $T$ is an $r$-uniform hypergraph that has an edge-ordering $e_1, e_2, \\dots, e_t$ such that for each $i\\geq 2$, $e_i$ has a vertex $v_i$ that does not belong to any previous edge and $e_i-v_i$ is contained in $e_j$ for some $j<i$. Kalai conjectured in 1984 that every $n$-vertex $r$-uniform hypergraph with more than $\\frac{t-1}{r}\\binom{n}{r-1}$ edges contains every tight $r$-tree $T$ with $t$ edges.\n  A trunk $T'$ of a tight $r$-tree $T$ is a tight subtree $T'$ of $T$ such that vertices in $V(T)\\setminus V(T')$ are leaves in $T$. Kalai's Conjecture was proved in 1987 for tight"},"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":"1807.07057","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-18T17:48:00Z","cross_cats_sorted":[],"title_canon_sha256":"629b5c0ff1da04881ebd63998cf30cfe2a5ad6554daa134bf24d24c7de19428a","abstract_canon_sha256":"dcb62a40cdf5ff485b0390ee7bdfcb7923b06211d0b8f508cd89f3d60c40c414"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:59.033995Z","signature_b64":"MFa7nUHD4j0VELQgYwn/wrmAWG+ZEEt9Iq1qq0v8CIBWpGRBcTrbhXzPytagouO62j0d+5i7fzCuUPji7QvwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13266f008b9a90232c54b0964fc9168107f104806de0c86373053fe1ad2c0ae6","last_reissued_at":"2026-05-17T23:54:59.033517Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:59.033517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraphs not containing a tight tree with a bounded trunk ~II: 3-trees with a trunk of size 2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Dhruv Mubayi, Jacques Verstra\\\"ete, Tao Jiang, Zolt\\'an F\\\"uredi","submitted_at":"2018-07-18T17:48:00Z","abstract_excerpt":"A tight $r$-tree $T$ is an $r$-uniform hypergraph that has an edge-ordering $e_1, e_2, \\dots, e_t$ such that for each $i\\geq 2$, $e_i$ has a vertex $v_i$ that does not belong to any previous edge and $e_i-v_i$ is contained in $e_j$ for some $j<i$. Kalai conjectured in 1984 that every $n$-vertex $r$-uniform hypergraph with more than $\\frac{t-1}{r}\\binom{n}{r-1}$ edges contains every tight $r$-tree $T$ with $t$ edges.\n  A trunk $T'$ of a tight $r$-tree $T$ is a tight subtree $T'$ of $T$ such that vertices in $V(T)\\setminus V(T')$ are leaves in $T$. Kalai's Conjecture was proved in 1987 for tight"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07057","kind":"arxiv","version":2},"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":"1807.07057","created_at":"2026-05-17T23:54:59.033592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07057v2","created_at":"2026-05-17T23:54:59.033592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07057","created_at":"2026-05-17T23:54:59.033592+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMTG6AELTKIC","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMTG6AELTKICGLCU","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMTG6AEL","created_at":"2026-05-18T12:32:16.446611+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/CMTG6AELTKICGLCUWCLE7SIWQE","json":"https://pith.science/pith/CMTG6AELTKICGLCUWCLE7SIWQE.json","graph_json":"https://pith.science/api/pith-number/CMTG6AELTKICGLCUWCLE7SIWQE/graph.json","events_json":"https://pith.science/api/pith-number/CMTG6AELTKICGLCUWCLE7SIWQE/events.json","paper":"https://pith.science/paper/CMTG6AEL"},"agent_actions":{"view_html":"https://pith.science/pith/CMTG6AELTKICGLCUWCLE7SIWQE","download_json":"https://pith.science/pith/CMTG6AELTKICGLCUWCLE7SIWQE.json","view_paper":"https://pith.science/paper/CMTG6AEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07057&json=true","fetch_graph":"https://pith.science/api/pith-number/CMTG6AELTKICGLCUWCLE7SIWQE/graph.json","fetch_events":"https://pith.science/api/pith-number/CMTG6AELTKICGLCUWCLE7SIWQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMTG6AELTKICGLCUWCLE7SIWQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMTG6AELTKICGLCUWCLE7SIWQE/action/storage_attestation","attest_author":"https://pith.science/pith/CMTG6AELTKICGLCUWCLE7SIWQE/action/author_attestation","sign_citation":"https://pith.science/pith/CMTG6AELTKICGLCUWCLE7SIWQE/action/citation_signature","submit_replication":"https://pith.science/pith/CMTG6AELTKICGLCUWCLE7SIWQE/action/replication_record"}},"created_at":"2026-05-17T23:54:59.033592+00:00","updated_at":"2026-05-17T23:54:59.033592+00:00"}