{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FSLLOYIG7Y2IYVL33KRWFUXKQ2","short_pith_number":"pith:FSLLOYIG","schema_version":"1.0","canonical_sha256":"2c96b76106fe348c557bdaa362d2ea86a491ff5cc21cad3d14ab926a0bc3aae2","source":{"kind":"arxiv","id":"1711.03335","version":4},"attestation_state":"computed","paper":{"title":"Improved Encoding and Counting of Uniform Hypertrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arjun Pitchanathan, Saswata Shannigrahi","submitted_at":"2017-11-09T11:46:53Z","abstract_excerpt":"We consider labeled $r$-uniform hypertrees having $n \\ge r \\ge 2$ vertices. The number of hyperedges in such a hypertree is $m = (n - 1)/(r - 1)$. We show that there are exactly $f(n, r) = \\frac{(n-1)! n^{m-1}}{(r-1)!^m m!}$ $r$-uniform hypertrees with $n$ vertices labeled with distinct integers. We also give an encoding scheme that encodes such hypertrees using, on an average, at most $1 + \\log_2 e$ bits more than $\\log_2(f(n, r))$."},"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":"1711.03335","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-09T11:46:53Z","cross_cats_sorted":[],"title_canon_sha256":"c0c49a00e9b082f1a4aa26353295d1dd7c52b625cde5b815b6d0a12e58f1f21d","abstract_canon_sha256":"d0c17bf05fee17e08e42860fdd0b5f5682e05818ae61200ff60ec1c086b59ab2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:14.808133Z","signature_b64":"kV1WFq6hKcfPNKHtFmn3SWbCpO/2q6Iay2c0qjj8b8cWIUd52LMHK9CgHDIQ57vpTjQrwCfxZlUwM1fGQICXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c96b76106fe348c557bdaa362d2ea86a491ff5cc21cad3d14ab926a0bc3aae2","last_reissued_at":"2026-05-17T23:58:14.807668Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:14.807668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Encoding and Counting of Uniform Hypertrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arjun Pitchanathan, Saswata Shannigrahi","submitted_at":"2017-11-09T11:46:53Z","abstract_excerpt":"We consider labeled $r$-uniform hypertrees having $n \\ge r \\ge 2$ vertices. The number of hyperedges in such a hypertree is $m = (n - 1)/(r - 1)$. We show that there are exactly $f(n, r) = \\frac{(n-1)! n^{m-1}}{(r-1)!^m m!}$ $r$-uniform hypertrees with $n$ vertices labeled with distinct integers. We also give an encoding scheme that encodes such hypertrees using, on an average, at most $1 + \\log_2 e$ bits more than $\\log_2(f(n, r))$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03335","kind":"arxiv","version":4},"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":"1711.03335","created_at":"2026-05-17T23:58:14.807737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03335v4","created_at":"2026-05-17T23:58:14.807737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03335","created_at":"2026-05-17T23:58:14.807737+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSLLOYIG7Y2I","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSLLOYIG7Y2IYVL3","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSLLOYIG","created_at":"2026-05-18T12:31:15.632608+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/FSLLOYIG7Y2IYVL33KRWFUXKQ2","json":"https://pith.science/pith/FSLLOYIG7Y2IYVL33KRWFUXKQ2.json","graph_json":"https://pith.science/api/pith-number/FSLLOYIG7Y2IYVL33KRWFUXKQ2/graph.json","events_json":"https://pith.science/api/pith-number/FSLLOYIG7Y2IYVL33KRWFUXKQ2/events.json","paper":"https://pith.science/paper/FSLLOYIG"},"agent_actions":{"view_html":"https://pith.science/pith/FSLLOYIG7Y2IYVL33KRWFUXKQ2","download_json":"https://pith.science/pith/FSLLOYIG7Y2IYVL33KRWFUXKQ2.json","view_paper":"https://pith.science/paper/FSLLOYIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03335&json=true","fetch_graph":"https://pith.science/api/pith-number/FSLLOYIG7Y2IYVL33KRWFUXKQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/FSLLOYIG7Y2IYVL33KRWFUXKQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSLLOYIG7Y2IYVL33KRWFUXKQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSLLOYIG7Y2IYVL33KRWFUXKQ2/action/storage_attestation","attest_author":"https://pith.science/pith/FSLLOYIG7Y2IYVL33KRWFUXKQ2/action/author_attestation","sign_citation":"https://pith.science/pith/FSLLOYIG7Y2IYVL33KRWFUXKQ2/action/citation_signature","submit_replication":"https://pith.science/pith/FSLLOYIG7Y2IYVL33KRWFUXKQ2/action/replication_record"}},"created_at":"2026-05-17T23:58:14.807737+00:00","updated_at":"2026-05-17T23:58:14.807737+00:00"}