{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PRLPNICIPIRAT6JERQULNKCAKR","short_pith_number":"pith:PRLPNICI","schema_version":"1.0","canonical_sha256":"7c56f6a0487a2209f9248c28b6a840544d62cad06a1faa0dab174e595552e3ce","source":{"kind":"arxiv","id":"1801.02423","version":1},"attestation_state":"computed","paper":{"title":"Enumeration and randomized constructions of hypertrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Nati Linial, Yuval Peled","submitted_at":"2018-01-08T14:01:13Z","abstract_excerpt":"Over thirty years ago, Kalai proved a beautiful $d$-dimensional analog of Cayley's formula for the number of $n$-vertex trees. He enumerated $d$-dimensional hypertrees weighted by the squared size of their $(d-1)$-dimensional homology group. This, however, does not answer the more basic problem of unweighted enumeration of $d$-hypertrees, which is our concern here. Our main result, Theorem 1.4, significantly improves the lower bound for the number of $d$-hypertrees. In addition, we study a random $1$-out model of $d$-complexes where every $(d-1)$-dimensional face selects a random $d$-face cont"},"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":"1801.02423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-08T14:01:13Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ecc8dd1dae3b45e5b62fb63deb18864be9ed567d7865940e5087637a309a5145","abstract_canon_sha256":"124b75382850b8a56e74cddcc70dd120a7e69b21117d882545bec496a20f9942"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:31.674976Z","signature_b64":"bVwA42R2QoFDQczDGzZviHcb9VyxktVSH/Py/aLPv7ZMCtqkKX55W6VkkdHR75APXkNpHLI/QZJI+cp3djaeDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c56f6a0487a2209f9248c28b6a840544d62cad06a1faa0dab174e595552e3ce","last_reissued_at":"2026-05-18T00:26:31.674288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:31.674288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration and randomized constructions of hypertrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Nati Linial, Yuval Peled","submitted_at":"2018-01-08T14:01:13Z","abstract_excerpt":"Over thirty years ago, Kalai proved a beautiful $d$-dimensional analog of Cayley's formula for the number of $n$-vertex trees. He enumerated $d$-dimensional hypertrees weighted by the squared size of their $(d-1)$-dimensional homology group. This, however, does not answer the more basic problem of unweighted enumeration of $d$-hypertrees, which is our concern here. Our main result, Theorem 1.4, significantly improves the lower bound for the number of $d$-hypertrees. In addition, we study a random $1$-out model of $d$-complexes where every $(d-1)$-dimensional face selects a random $d$-face cont"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02423","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.02423","created_at":"2026-05-18T00:26:31.674413+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02423v1","created_at":"2026-05-18T00:26:31.674413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02423","created_at":"2026-05-18T00:26:31.674413+00:00"},{"alias_kind":"pith_short_12","alias_value":"PRLPNICIPIRA","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PRLPNICIPIRAT6JE","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PRLPNICI","created_at":"2026-05-18T12:32:46.962924+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/PRLPNICIPIRAT6JERQULNKCAKR","json":"https://pith.science/pith/PRLPNICIPIRAT6JERQULNKCAKR.json","graph_json":"https://pith.science/api/pith-number/PRLPNICIPIRAT6JERQULNKCAKR/graph.json","events_json":"https://pith.science/api/pith-number/PRLPNICIPIRAT6JERQULNKCAKR/events.json","paper":"https://pith.science/paper/PRLPNICI"},"agent_actions":{"view_html":"https://pith.science/pith/PRLPNICIPIRAT6JERQULNKCAKR","download_json":"https://pith.science/pith/PRLPNICIPIRAT6JERQULNKCAKR.json","view_paper":"https://pith.science/paper/PRLPNICI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02423&json=true","fetch_graph":"https://pith.science/api/pith-number/PRLPNICIPIRAT6JERQULNKCAKR/graph.json","fetch_events":"https://pith.science/api/pith-number/PRLPNICIPIRAT6JERQULNKCAKR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PRLPNICIPIRAT6JERQULNKCAKR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PRLPNICIPIRAT6JERQULNKCAKR/action/storage_attestation","attest_author":"https://pith.science/pith/PRLPNICIPIRAT6JERQULNKCAKR/action/author_attestation","sign_citation":"https://pith.science/pith/PRLPNICIPIRAT6JERQULNKCAKR/action/citation_signature","submit_replication":"https://pith.science/pith/PRLPNICIPIRAT6JERQULNKCAKR/action/replication_record"}},"created_at":"2026-05-18T00:26:31.674413+00:00","updated_at":"2026-05-18T00:26:31.674413+00:00"}