{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FDQ6HRNQALYWMTVCYX6YWNMPTM","short_pith_number":"pith:FDQ6HRNQ","canonical_record":{"source":{"id":"1406.2714","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-10T20:42:37Z","cross_cats_sorted":[],"title_canon_sha256":"294a164ab6811cb268416c09d037f50dbb5273197f014b01aa10b3aff2310448","abstract_canon_sha256":"9bc3cfcf9532d1f7bf0812d48450f1513c35d03faf1e0460adb7cabf02200e83"},"schema_version":"1.0"},"canonical_sha256":"28e1e3c5b002f1664ea2c5fd8b358f9b2b8c9e7549387e86e8b59e007473c010","source":{"kind":"arxiv","id":"1406.2714","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2714","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2714v5","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2714","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"FDQ6HRNQALYW","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FDQ6HRNQALYWMTVC","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FDQ6HRNQ","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FDQ6HRNQALYWMTVCYX6YWNMPTM","target":"record","payload":{"canonical_record":{"source":{"id":"1406.2714","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-10T20:42:37Z","cross_cats_sorted":[],"title_canon_sha256":"294a164ab6811cb268416c09d037f50dbb5273197f014b01aa10b3aff2310448","abstract_canon_sha256":"9bc3cfcf9532d1f7bf0812d48450f1513c35d03faf1e0460adb7cabf02200e83"},"schema_version":"1.0"},"canonical_sha256":"28e1e3c5b002f1664ea2c5fd8b358f9b2b8c9e7549387e86e8b59e007473c010","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:08.582693Z","signature_b64":"4XV2GYUz2r2yY+uHrnX9JhOAVY8AOUtGGLhGPMbjYOf8IGwdParu5LmFUfdlcfrEy77ZUQNkskwEs6mEf+3WDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28e1e3c5b002f1664ea2c5fd8b358f9b2b8c9e7549387e86e8b59e007473c010","last_reissued_at":"2026-05-18T00:41:08.582190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:08.582190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.2714","source_version":5,"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:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i6wl+nJ9XYh4Q+XY4FaI9jHYxdnKPLALJeUcPRennTHXyEk/oDkjJ8/Pyu8e+tVFNVjIKRzpWmXGzH6E40JuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:32:01.534116Z"},"content_sha256":"e088f665182a9c46cedd98eaa81187c3d62c86ad75cfd61bbf433b2524553336","schema_version":"1.0","event_id":"sha256:e088f665182a9c46cedd98eaa81187c3d62c86ad75cfd61bbf433b2524553336"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FDQ6HRNQALYWMTVCYX6YWNMPTM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the Number of Edges of Edge-minimal, Edge-maximal and $l$-hypertrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"P\\'eter G. N. Szab\\'o","submitted_at":"2014-06-10T20:42:37Z","abstract_excerpt":"In their paper, Bounds on the Number of Edges in Hypertrees, G.Y. Katona and P.G.N. Szab\\'o introduced a new, natural definition of hypertrees in $k$-uniform hypergraphs and gave lower and upper bounds on the number of edges. They also defined edge-minimal, edge-maximal and $l$-hypertrees and proved an upper bound on the edge number of $l$-hypertrees.\n  In the present paper, we verify the asymptotic sharpness of the $\\binom{n}{k-1}$ upper bound on the number of edges of $k$-uniform hypertrees given in the above mentioned paper. We also make an improvement on the upper bound of the edge number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2714","kind":"arxiv","version":5},"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:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MznoFXJiUnoQaKv6ycT13nX0OeHUZy34GimeMZAcJN5isXyPsb0aKhgCt2pIXXJ4H5fwPl/4HdoxbOQ6XZqTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:32:01.534861Z"},"content_sha256":"31dad85d167c41c4a9d2286c1236a07fcccb468832223f073bdad68faf4f5697","schema_version":"1.0","event_id":"sha256:31dad85d167c41c4a9d2286c1236a07fcccb468832223f073bdad68faf4f5697"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM/bundle.json","state_url":"https://pith.science/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM/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-10T02:32:01Z","links":{"resolver":"https://pith.science/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM","bundle":"https://pith.science/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM/bundle.json","state":"https://pith.science/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FDQ6HRNQALYWMTVCYX6YWNMPTM","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":"9bc3cfcf9532d1f7bf0812d48450f1513c35d03faf1e0460adb7cabf02200e83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-10T20:42:37Z","title_canon_sha256":"294a164ab6811cb268416c09d037f50dbb5273197f014b01aa10b3aff2310448"},"schema_version":"1.0","source":{"id":"1406.2714","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2714","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2714v5","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2714","created_at":"2026-05-18T00:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"FDQ6HRNQALYW","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FDQ6HRNQALYWMTVC","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FDQ6HRNQ","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:31dad85d167c41c4a9d2286c1236a07fcccb468832223f073bdad68faf4f5697","target":"graph","created_at":"2026-05-18T00:41:08Z","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":"In their paper, Bounds on the Number of Edges in Hypertrees, G.Y. Katona and P.G.N. Szab\\'o introduced a new, natural definition of hypertrees in $k$-uniform hypergraphs and gave lower and upper bounds on the number of edges. They also defined edge-minimal, edge-maximal and $l$-hypertrees and proved an upper bound on the edge number of $l$-hypertrees.\n  In the present paper, we verify the asymptotic sharpness of the $\\binom{n}{k-1}$ upper bound on the number of edges of $k$-uniform hypertrees given in the above mentioned paper. We also make an improvement on the upper bound of the edge number ","authors_text":"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-06-10T20:42:37Z","title":"Bounds on the Number of Edges of Edge-minimal, Edge-maximal and $l$-hypertrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2714","kind":"arxiv","version":5},"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:e088f665182a9c46cedd98eaa81187c3d62c86ad75cfd61bbf433b2524553336","target":"record","created_at":"2026-05-18T00:41:08Z","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":"9bc3cfcf9532d1f7bf0812d48450f1513c35d03faf1e0460adb7cabf02200e83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-10T20:42:37Z","title_canon_sha256":"294a164ab6811cb268416c09d037f50dbb5273197f014b01aa10b3aff2310448"},"schema_version":"1.0","source":{"id":"1406.2714","kind":"arxiv","version":5}},"canonical_sha256":"28e1e3c5b002f1664ea2c5fd8b358f9b2b8c9e7549387e86e8b59e007473c010","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28e1e3c5b002f1664ea2c5fd8b358f9b2b8c9e7549387e86e8b59e007473c010","first_computed_at":"2026-05-18T00:41:08.582190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:08.582190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4XV2GYUz2r2yY+uHrnX9JhOAVY8AOUtGGLhGPMbjYOf8IGwdParu5LmFUfdlcfrEy77ZUQNkskwEs6mEf+3WDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:08.582693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.2714","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e088f665182a9c46cedd98eaa81187c3d62c86ad75cfd61bbf433b2524553336","sha256:31dad85d167c41c4a9d2286c1236a07fcccb468832223f073bdad68faf4f5697"],"state_sha256":"dd9114f647fa8471a105bfbd6b8d9f0690da229d07cb62489dc97c3de1f2172b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1nJwmGxUXvBUt5ltkbdUeDcmvd0Lz/z0H25X8teAHMTC5ltDwp3m8XpZra2ZPGEv2arcNJl7bNTPJ+hvN0vHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T02:32:01.539360Z","bundle_sha256":"d40be529d5f5538dfdf413268001aff1c9b4fc173d8bbcdc22dc96948bbd3614"}}