{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PRLPNICIPIRAT6JERQULNKCAKR","short_pith_number":"pith:PRLPNICI","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"},"canonical_sha256":"7c56f6a0487a2209f9248c28b6a840544d62cad06a1faa0dab174e595552e3ce","source":{"kind":"arxiv","id":"1801.02423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02423","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02423v1","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02423","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"PRLPNICIPIRA","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PRLPNICIPIRAT6JE","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PRLPNICI","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PRLPNICIPIRAT6JERQULNKCAKR","target":"record","payload":{"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"},"canonical_sha256":"7c56f6a0487a2209f9248c28b6a840544d62cad06a1faa0dab174e595552e3ce","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"},"source_kind":"arxiv","source_id":"1801.02423","source_version":1,"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:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzQLCCKbbmUmwMZ820jKORNEJk/w8pM2JulSQGYvqzvtFLChiO/2Tv/7mjmKBZIAcTpl2U+MHm999HBlp3/nCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:12:41.489882Z"},"content_sha256":"57b84debe33b400a411f0864dfc977238fb4257482e7603d873056032edc3edc","schema_version":"1.0","event_id":"sha256:57b84debe33b400a411f0864dfc977238fb4257482e7603d873056032edc3edc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PRLPNICIPIRAT6JERQULNKCAKR","target":"graph","payload":{"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"},"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:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZVWsOKdrTPE2Kza+rjuHUXLJoK96UJAE+BBA5GgDdrD40r4b7o/0Ljj6Hzi1n2rn/JyIHCaZL4sOKXNakvVaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:12:41.490550Z"},"content_sha256":"50052fb1fd3d4acce0fa2e9a3d202a5c5c9487055d48075ac66c23fa1ecae4e8","schema_version":"1.0","event_id":"sha256:50052fb1fd3d4acce0fa2e9a3d202a5c5c9487055d48075ac66c23fa1ecae4e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PRLPNICIPIRAT6JERQULNKCAKR/bundle.json","state_url":"https://pith.science/pith/PRLPNICIPIRAT6JERQULNKCAKR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PRLPNICIPIRAT6JERQULNKCAKR/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-05-27T22:12:41Z","links":{"resolver":"https://pith.science/pith/PRLPNICIPIRAT6JERQULNKCAKR","bundle":"https://pith.science/pith/PRLPNICIPIRAT6JERQULNKCAKR/bundle.json","state":"https://pith.science/pith/PRLPNICIPIRAT6JERQULNKCAKR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PRLPNICIPIRAT6JERQULNKCAKR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PRLPNICIPIRAT6JERQULNKCAKR","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":"124b75382850b8a56e74cddcc70dd120a7e69b21117d882545bec496a20f9942","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-08T14:01:13Z","title_canon_sha256":"ecc8dd1dae3b45e5b62fb63deb18864be9ed567d7865940e5087637a309a5145"},"schema_version":"1.0","source":{"id":"1801.02423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02423","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02423v1","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02423","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"PRLPNICIPIRA","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PRLPNICIPIRAT6JE","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PRLPNICI","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:50052fb1fd3d4acce0fa2e9a3d202a5c5c9487055d48075ac66c23fa1ecae4e8","target":"graph","created_at":"2026-05-18T00:26:31Z","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":"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","authors_text":"Nati Linial, Yuval Peled","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-08T14:01:13Z","title":"Enumeration and randomized constructions of hypertrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02423","kind":"arxiv","version":1},"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:57b84debe33b400a411f0864dfc977238fb4257482e7603d873056032edc3edc","target":"record","created_at":"2026-05-18T00:26:31Z","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":"124b75382850b8a56e74cddcc70dd120a7e69b21117d882545bec496a20f9942","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-08T14:01:13Z","title_canon_sha256":"ecc8dd1dae3b45e5b62fb63deb18864be9ed567d7865940e5087637a309a5145"},"schema_version":"1.0","source":{"id":"1801.02423","kind":"arxiv","version":1}},"canonical_sha256":"7c56f6a0487a2209f9248c28b6a840544d62cad06a1faa0dab174e595552e3ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c56f6a0487a2209f9248c28b6a840544d62cad06a1faa0dab174e595552e3ce","first_computed_at":"2026-05-18T00:26:31.674288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:31.674288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bVwA42R2QoFDQczDGzZviHcb9VyxktVSH/Py/aLPv7ZMCtqkKX55W6VkkdHR75APXkNpHLI/QZJI+cp3djaeDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:31.674976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57b84debe33b400a411f0864dfc977238fb4257482e7603d873056032edc3edc","sha256:50052fb1fd3d4acce0fa2e9a3d202a5c5c9487055d48075ac66c23fa1ecae4e8"],"state_sha256":"d4556dd1a73ce6200c78c98a3e65e5ff956aac4b5e4d847f020ab2e9c183ff07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P303ZOt5sDyBEULqGX6uK7U7+sy/YZIeNaxCLPNTzv+kAYMI1pTTYvlIEJnpzFsXwTF/81nIpjmPKmms6FykCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:12:41.493282Z","bundle_sha256":"edeacbcf63ea76d42feb9b917d9b996f83f85080d1cf2fb2dab65cb9c36f104d"}}