{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4GB6FYWRLZUT25FHISNLOKDQG2","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":"598897c83506a9a860d101061b2132aed40f15e94cd534e2ac8d36fb8afc51d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-20T20:00:41Z","title_canon_sha256":"2a78e55f8845a3b5bd6b133d32d33e544345bf9293d4110eddb8eb669b3e0f87"},"schema_version":"1.0","source":{"id":"1302.5090","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.5090","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"arxiv_version","alias_value":"1302.5090v5","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.5090","created_at":"2026-05-18T00:40:24Z"},{"alias_kind":"pith_short_12","alias_value":"4GB6FYWRLZUT","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4GB6FYWRLZUT25FH","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4GB6FYWR","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:7b54c4873e8bc512166b96aad37b3b343a9a927b74db117a8f4348495033be1b","target":"graph","created_at":"2026-05-18T00:40:24Z","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 give lower bounds on the maximum possible girth of an $r$-uniform, $d$-regular hypergraph with at most $n$ vertices, using the definition of a hypergraph cycle due to Berge. These differ from the trivial upper bound by an absolute constant factor (viz., by a factor of between $3/2+o(1)$ and $2 +o(1)$). We also define a random $r$-uniform `Cayley' hypergraph on $S_n$ which has girth $\\Omega (n^{1/3})$ with high probability, in contrast to random regular $r$-uniform hypergraphs, which have constant girth with positive probability.","authors_text":"David Ellis, Nathan Linial","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-20T20:00:41Z","title":"On regular hypergraphs of high girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.5090","kind":"arxiv","version":5},"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:757f69028f61b1a68235bb9fede1fa0069266510b26fa62f650a3f73132a0999","target":"record","created_at":"2026-05-18T00:40:24Z","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":"598897c83506a9a860d101061b2132aed40f15e94cd534e2ac8d36fb8afc51d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-20T20:00:41Z","title_canon_sha256":"2a78e55f8845a3b5bd6b133d32d33e544345bf9293d4110eddb8eb669b3e0f87"},"schema_version":"1.0","source":{"id":"1302.5090","kind":"arxiv","version":5}},"canonical_sha256":"e183e2e2d15e693d74a7449ab7287036875d0822d71c98fdcb2612d87242700b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e183e2e2d15e693d74a7449ab7287036875d0822d71c98fdcb2612d87242700b","first_computed_at":"2026-05-18T00:40:24.718400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:24.718400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rzO12RKAoB76ENPiQHkG8zM1gxCPhiMRw+sv58KEcUXeUxlUnFqbm0RoCOuUUmuxodAB/4FkkBEq4oPTtmpNCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:24.718888Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.5090","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:757f69028f61b1a68235bb9fede1fa0069266510b26fa62f650a3f73132a0999","sha256:7b54c4873e8bc512166b96aad37b3b343a9a927b74db117a8f4348495033be1b"],"state_sha256":"26a640fd2ba6706c5bac8d95303dcb55ae9e5e0c62e49fa16650ae9c51bc38dd"}