{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FDQ6HRNQALYWMTVCYX6YWNMPTM","short_pith_number":"pith:FDQ6HRNQ","schema_version":"1.0","canonical_sha256":"28e1e3c5b002f1664ea2c5fd8b358f9b2b8c9e7549387e86e8b59e007473c010","source":{"kind":"arxiv","id":"1406.2714","version":5},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.2714","created_at":"2026-05-18T00:41:08.582260+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2714v5","created_at":"2026-05-18T00:41:08.582260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2714","created_at":"2026-05-18T00:41:08.582260+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDQ6HRNQALYW","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDQ6HRNQALYWMTVC","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDQ6HRNQ","created_at":"2026-05-18T12:28:28.263976+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/FDQ6HRNQALYWMTVCYX6YWNMPTM","json":"https://pith.science/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM.json","graph_json":"https://pith.science/api/pith-number/FDQ6HRNQALYWMTVCYX6YWNMPTM/graph.json","events_json":"https://pith.science/api/pith-number/FDQ6HRNQALYWMTVCYX6YWNMPTM/events.json","paper":"https://pith.science/paper/FDQ6HRNQ"},"agent_actions":{"view_html":"https://pith.science/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM","download_json":"https://pith.science/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM.json","view_paper":"https://pith.science/paper/FDQ6HRNQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2714&json=true","fetch_graph":"https://pith.science/api/pith-number/FDQ6HRNQALYWMTVCYX6YWNMPTM/graph.json","fetch_events":"https://pith.science/api/pith-number/FDQ6HRNQALYWMTVCYX6YWNMPTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM/action/storage_attestation","attest_author":"https://pith.science/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM/action/author_attestation","sign_citation":"https://pith.science/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM/action/citation_signature","submit_replication":"https://pith.science/pith/FDQ6HRNQALYWMTVCYX6YWNMPTM/action/replication_record"}},"created_at":"2026-05-18T00:41:08.582260+00:00","updated_at":"2026-05-18T00:41:08.582260+00:00"}