{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YBKKQH6IMQKE2EQOLO4NRZGY2D","short_pith_number":"pith:YBKKQH6I","canonical_record":{"source":{"id":"1404.6430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-25T14:25:47Z","cross_cats_sorted":[],"title_canon_sha256":"0cc008d7ffc0d8b06444036bc620694f8024c0cb6d76baef23a2f114559ed7c0","abstract_canon_sha256":"e9e5862daa9778a6610acdc5ef3ba4687abecd209d8f51fcb35a26c715bbb66c"},"schema_version":"1.0"},"canonical_sha256":"c054a81fc864144d120e5bb8d8e4d8d0d014b2a9bbc38699806a1ec6d2cd426e","source":{"kind":"arxiv","id":"1404.6430","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6430","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6430v1","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6430","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"pith_short_12","alias_value":"YBKKQH6IMQKE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YBKKQH6IMQKE2EQO","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YBKKQH6I","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YBKKQH6IMQKE2EQOLO4NRZGY2D","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6430","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-25T14:25:47Z","cross_cats_sorted":[],"title_canon_sha256":"0cc008d7ffc0d8b06444036bc620694f8024c0cb6d76baef23a2f114559ed7c0","abstract_canon_sha256":"e9e5862daa9778a6610acdc5ef3ba4687abecd209d8f51fcb35a26c715bbb66c"},"schema_version":"1.0"},"canonical_sha256":"c054a81fc864144d120e5bb8d8e4d8d0d014b2a9bbc38699806a1ec6d2cd426e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:41.782310Z","signature_b64":"vrue3NLjEuxuQ8dTWpuMHgbvk/6jIX0ruOp370FOYnkCSfoi5QjNn51EEuu+za9eUSmBBxAVBtRWp6kgT309BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c054a81fc864144d120e5bb8d8e4d8d0d014b2a9bbc38699806a1ec6d2cd426e","last_reissued_at":"2026-05-18T00:36:41.781659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:41.781659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6430","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-18T00:36:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"toMEJsALNqHU7YzQTP95cQgVuBLcs67hPHNX0fk+iHsZs+LuWfwRSQCSjBzmF0NQrr8VLgqQoYLlakjmdEvyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:52:38.841834Z"},"content_sha256":"dd265d6a811502baf4ed79c8b120c3d1687217f8112590b935338fd195a1c202","schema_version":"1.0","event_id":"sha256:dd265d6a811502baf4ed79c8b120c3d1687217f8112590b935338fd195a1c202"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YBKKQH6IMQKE2EQOLO4NRZGY2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the Number of Edges in Hypertrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gyula Y. Katona, P\\'eter G. N. Szab\\'o","submitted_at":"2014-04-25T14:25:47Z","abstract_excerpt":"Let $\\mathcal{H}$ be a $k$-uniform hypergraph. A chain in $\\mathcal{H}$ is a sequence of its vertices such that every $k$ consecutive vertices form an edge. In 1999 Katona and Kierstead suggested to use chains in hypergraphs as the generalisation of paths. Although a number of results have been published on hamiltonian chains in recent years, the generalization of trees with chains has still remained an open area. We generalize the concept of trees for uniform hypergraphs. We say that a $k$-uniform hypergraph $\\mathcal{F}$ is a hypertree if every two vertices of $\\mathcal{F}$ are connected by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6430","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-18T00:36:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLp6bfffLjPNNN0rRoe7i7MxLPq0Nk1+myJw6SzHSOIqrxAmsozyE57OlWugwTDVl+1R4t2KUb8gr+tCb71VAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:52:38.842587Z"},"content_sha256":"09659e713f6024bb221ed69ba6e0947f8c3f2a302bb84aff6058627a4d5dcda5","schema_version":"1.0","event_id":"sha256:09659e713f6024bb221ed69ba6e0947f8c3f2a302bb84aff6058627a4d5dcda5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YBKKQH6IMQKE2EQOLO4NRZGY2D/bundle.json","state_url":"https://pith.science/pith/YBKKQH6IMQKE2EQOLO4NRZGY2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YBKKQH6IMQKE2EQOLO4NRZGY2D/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-06-10T11:52:38Z","links":{"resolver":"https://pith.science/pith/YBKKQH6IMQKE2EQOLO4NRZGY2D","bundle":"https://pith.science/pith/YBKKQH6IMQKE2EQOLO4NRZGY2D/bundle.json","state":"https://pith.science/pith/YBKKQH6IMQKE2EQOLO4NRZGY2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YBKKQH6IMQKE2EQOLO4NRZGY2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YBKKQH6IMQKE2EQOLO4NRZGY2D","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":"e9e5862daa9778a6610acdc5ef3ba4687abecd209d8f51fcb35a26c715bbb66c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-25T14:25:47Z","title_canon_sha256":"0cc008d7ffc0d8b06444036bc620694f8024c0cb6d76baef23a2f114559ed7c0"},"schema_version":"1.0","source":{"id":"1404.6430","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6430","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6430v1","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6430","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"pith_short_12","alias_value":"YBKKQH6IMQKE","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YBKKQH6IMQKE2EQO","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YBKKQH6I","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:09659e713f6024bb221ed69ba6e0947f8c3f2a302bb84aff6058627a4d5dcda5","target":"graph","created_at":"2026-05-18T00:36:41Z","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":"Let $\\mathcal{H}$ be a $k$-uniform hypergraph. A chain in $\\mathcal{H}$ is a sequence of its vertices such that every $k$ consecutive vertices form an edge. In 1999 Katona and Kierstead suggested to use chains in hypergraphs as the generalisation of paths. Although a number of results have been published on hamiltonian chains in recent years, the generalization of trees with chains has still remained an open area. We generalize the concept of trees for uniform hypergraphs. We say that a $k$-uniform hypergraph $\\mathcal{F}$ is a hypertree if every two vertices of $\\mathcal{F}$ are connected by ","authors_text":"Gyula Y. Katona, P\\'eter G. N. Szab\\'o","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-25T14:25:47Z","title":"Bounds on the Number of Edges in Hypertrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6430","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:dd265d6a811502baf4ed79c8b120c3d1687217f8112590b935338fd195a1c202","target":"record","created_at":"2026-05-18T00:36:41Z","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":"e9e5862daa9778a6610acdc5ef3ba4687abecd209d8f51fcb35a26c715bbb66c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-25T14:25:47Z","title_canon_sha256":"0cc008d7ffc0d8b06444036bc620694f8024c0cb6d76baef23a2f114559ed7c0"},"schema_version":"1.0","source":{"id":"1404.6430","kind":"arxiv","version":1}},"canonical_sha256":"c054a81fc864144d120e5bb8d8e4d8d0d014b2a9bbc38699806a1ec6d2cd426e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c054a81fc864144d120e5bb8d8e4d8d0d014b2a9bbc38699806a1ec6d2cd426e","first_computed_at":"2026-05-18T00:36:41.781659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:41.781659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vrue3NLjEuxuQ8dTWpuMHgbvk/6jIX0ruOp370FOYnkCSfoi5QjNn51EEuu+za9eUSmBBxAVBtRWp6kgT309BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:41.782310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6430","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd265d6a811502baf4ed79c8b120c3d1687217f8112590b935338fd195a1c202","sha256:09659e713f6024bb221ed69ba6e0947f8c3f2a302bb84aff6058627a4d5dcda5"],"state_sha256":"2acf381a34940b21fb2dddead44e15f22faabc7f4d6c65583c4252cd2a265e6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jmSm1F1JxXlJKoAUNFsb83tVExJpUKRhsZ5TQyXKTB3hlFpqsm7Tvc7z8ca5ExCWYwu6dwxhrAFKTni+rhYAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:52:38.847300Z","bundle_sha256":"a0c7a407ca54b2bfa5a4abe2ffdbeb613722aef763dd43e62d535d1859461914"}}