{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FSLLOYIG7Y2IYVL33KRWFUXKQ2","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":"d0c17bf05fee17e08e42860fdd0b5f5682e05818ae61200ff60ec1c086b59ab2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-09T11:46:53Z","title_canon_sha256":"c0c49a00e9b082f1a4aa26353295d1dd7c52b625cde5b815b6d0a12e58f1f21d"},"schema_version":"1.0","source":{"id":"1711.03335","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03335","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03335v4","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03335","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"FSLLOYIG7Y2I","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FSLLOYIG7Y2IYVL3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FSLLOYIG","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:dfa16e84a7d64208debf74531f2091d5301077589ddb7846b8d4cea4ff2977b9","target":"graph","created_at":"2026-05-17T23:58:14Z","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":"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))$.","authors_text":"Arjun Pitchanathan, Saswata Shannigrahi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-09T11:46:53Z","title":"Improved Encoding and Counting of Uniform Hypertrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03335","kind":"arxiv","version":4},"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:4323adade035e4d0d2f883ef14002bf90dd289454fca6145f7019b1e21924b2d","target":"record","created_at":"2026-05-17T23:58:14Z","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":"d0c17bf05fee17e08e42860fdd0b5f5682e05818ae61200ff60ec1c086b59ab2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-09T11:46:53Z","title_canon_sha256":"c0c49a00e9b082f1a4aa26353295d1dd7c52b625cde5b815b6d0a12e58f1f21d"},"schema_version":"1.0","source":{"id":"1711.03335","kind":"arxiv","version":4}},"canonical_sha256":"2c96b76106fe348c557bdaa362d2ea86a491ff5cc21cad3d14ab926a0bc3aae2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c96b76106fe348c557bdaa362d2ea86a491ff5cc21cad3d14ab926a0bc3aae2","first_computed_at":"2026-05-17T23:58:14.807668Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:14.807668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kV1WFq6hKcfPNKHtFmn3SWbCpO/2q6Iay2c0qjj8b8cWIUd52LMHK9CgHDIQ57vpTjQrwCfxZlUwM1fGQICXBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:14.808133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03335","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4323adade035e4d0d2f883ef14002bf90dd289454fca6145f7019b1e21924b2d","sha256:dfa16e84a7d64208debf74531f2091d5301077589ddb7846b8d4cea4ff2977b9"],"state_sha256":"1e1b119baff99bfcf9b540000b900152dcab7269dcb82f40bf81a7e4723223ef"}