{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CMTG6AELTKICGLCUWCLE7SIWQE","short_pith_number":"pith:CMTG6AEL","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"},"canonical_sha256":"13266f008b9a90232c54b0964fc9168107f104806de0c86373053fe1ad2c0ae6","source":{"kind":"arxiv","id":"1807.07057","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07057","created_at":"2026-05-17T23:54:59Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07057v2","created_at":"2026-05-17T23:54:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07057","created_at":"2026-05-17T23:54:59Z"},{"alias_kind":"pith_short_12","alias_value":"CMTG6AELTKIC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CMTG6AELTKICGLCU","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CMTG6AEL","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CMTG6AELTKICGLCUWCLE7SIWQE","target":"record","payload":{"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"},"canonical_sha256":"13266f008b9a90232c54b0964fc9168107f104806de0c86373053fe1ad2c0ae6","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"},"source_kind":"arxiv","source_id":"1807.07057","source_version":2,"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-17T23:54:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ppkxAxs4iZT+TS4qsDoOG7c7lFSJ34lyJGpi+FvAFlWiIiJptzP/Rktm5yr+6gk1KcokFqQAH9gJxhl+SERqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:29:30.865473Z"},"content_sha256":"9285129fd6463dbdf3420b54eaf6491364e6795658049ebf4f6efed9bae6bf1d","schema_version":"1.0","event_id":"sha256:9285129fd6463dbdf3420b54eaf6491364e6795658049ebf4f6efed9bae6bf1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CMTG6AELTKICGLCUWCLE7SIWQE","target":"graph","payload":{"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"},"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-17T23:54:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWCmN5ljVJ2XeenvDiY5Hg8NCas9D2pUWu2xOBo3fRoluQ5Drwh3mtYlAqwvoBN0kyA6nR2RiPrny/LnH0AZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:29:30.866274Z"},"content_sha256":"4b3e239183906138f11689b1f4d7e1e065d53fd9742aeab122ea6a9d7125d1c1","schema_version":"1.0","event_id":"sha256:4b3e239183906138f11689b1f4d7e1e065d53fd9742aeab122ea6a9d7125d1c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMTG6AELTKICGLCUWCLE7SIWQE/bundle.json","state_url":"https://pith.science/pith/CMTG6AELTKICGLCUWCLE7SIWQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMTG6AELTKICGLCUWCLE7SIWQE/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-31T23:29:30Z","links":{"resolver":"https://pith.science/pith/CMTG6AELTKICGLCUWCLE7SIWQE","bundle":"https://pith.science/pith/CMTG6AELTKICGLCUWCLE7SIWQE/bundle.json","state":"https://pith.science/pith/CMTG6AELTKICGLCUWCLE7SIWQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMTG6AELTKICGLCUWCLE7SIWQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CMTG6AELTKICGLCUWCLE7SIWQE","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":"dcb62a40cdf5ff485b0390ee7bdfcb7923b06211d0b8f508cd89f3d60c40c414","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-18T17:48:00Z","title_canon_sha256":"629b5c0ff1da04881ebd63998cf30cfe2a5ad6554daa134bf24d24c7de19428a"},"schema_version":"1.0","source":{"id":"1807.07057","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07057","created_at":"2026-05-17T23:54:59Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07057v2","created_at":"2026-05-17T23:54:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07057","created_at":"2026-05-17T23:54:59Z"},{"alias_kind":"pith_short_12","alias_value":"CMTG6AELTKIC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CMTG6AELTKICGLCU","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CMTG6AEL","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:4b3e239183906138f11689b1f4d7e1e065d53fd9742aeab122ea6a9d7125d1c1","target":"graph","created_at":"2026-05-17T23:54: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":"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","authors_text":"Alexandr Kostochka, Dhruv Mubayi, Jacques Verstra\\\"ete, Tao Jiang, Zolt\\'an F\\\"uredi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-18T17:48:00Z","title":"Hypergraphs not containing a tight tree with a bounded trunk ~II: 3-trees with a trunk of size 2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07057","kind":"arxiv","version":2},"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:9285129fd6463dbdf3420b54eaf6491364e6795658049ebf4f6efed9bae6bf1d","target":"record","created_at":"2026-05-17T23:54: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":"dcb62a40cdf5ff485b0390ee7bdfcb7923b06211d0b8f508cd89f3d60c40c414","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-18T17:48:00Z","title_canon_sha256":"629b5c0ff1da04881ebd63998cf30cfe2a5ad6554daa134bf24d24c7de19428a"},"schema_version":"1.0","source":{"id":"1807.07057","kind":"arxiv","version":2}},"canonical_sha256":"13266f008b9a90232c54b0964fc9168107f104806de0c86373053fe1ad2c0ae6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13266f008b9a90232c54b0964fc9168107f104806de0c86373053fe1ad2c0ae6","first_computed_at":"2026-05-17T23:54:59.033517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:59.033517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MFa7nUHD4j0VELQgYwn/wrmAWG+ZEEt9Iq1qq0v8CIBWpGRBcTrbhXzPytagouO62j0d+5i7fzCuUPji7QvwBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:59.033995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07057","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9285129fd6463dbdf3420b54eaf6491364e6795658049ebf4f6efed9bae6bf1d","sha256:4b3e239183906138f11689b1f4d7e1e065d53fd9742aeab122ea6a9d7125d1c1"],"state_sha256":"d2df5769d291e6ad97e234e67d0b66bf6d0a6015c93103b91a7e93f859c9d8e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UkRfpMexWLRhZSdefHIwD0ju/0CpthN82Eyc93hMDbJqN9p7SVJ2nlJ5odxhDQ83XPoDyHnEYs/JIRrUkP25BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:29:30.870960Z","bundle_sha256":"0c97188370bef31b000433e297c280c9f81db129760de6d06e592ebe4d994c8f"}}