{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PMWHE7XZUGGKVTYMIIHZ5JTJJG","short_pith_number":"pith:PMWHE7XZ","schema_version":"1.0","canonical_sha256":"7b2c727ef9a18caacf0c420f9ea6694981b7bd2ab10f55a5f556e99e70f817d1","source":{"kind":"arxiv","id":"1709.04079","version":2},"attestation_state":"computed","paper":{"title":"On the number of linear hypergraphs of large girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J\\'ozsef Balogh, Lina Li","submitted_at":"2017-09-12T22:51:33Z","abstract_excerpt":"An $r$-uniform \\textit{linear cycle} of length $\\ell$, denoted by $C_{\\ell}^r$, is an $r$-graph with edges $e_1, \\ldots, e_{\\ell}$ such that for every $i\\in [\\ell-1]$, $|e_i\\cap e_{i+1}|=1$, $|e_{\\ell}\\cap e_1|=1$ and $e_i\\cap e_j=\\emptyset$ for all other pairs $\\{i, j\\},\\ i\\neq j$. For every $r\\geq 3$ and $\\ell\\geq 4$, we show that there exists a constant $C$ depending on $r$ and $\\ell$ such that the number of linear $r$-graphs of girth $\\ell$ is at most $2^{Cn^{1+1/\\lfloor \\ell/2\\rfloor}}$. Furthermore, we extend the result for $\\ell=4$, proving that there exists a constant $C$ depending on "},"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":"1709.04079","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-12T22:51:33Z","cross_cats_sorted":[],"title_canon_sha256":"263a24da8db34610cb5db91ebbae65b925bed0623665be36b8b80db1fb1503f8","abstract_canon_sha256":"49c894b49b6383b16fb4c6432dcd765e32ce103a6bbc6fe7dc6fab88dbf0d629"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:25.151883Z","signature_b64":"hczk+lu1cTZk1pjgP0nnMXXsCIN0iEndNUd5UBFudORgsBB5nvyGWCvh5J1cBVL6N9dTiKWBuufMkkXDDq5WAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b2c727ef9a18caacf0c420f9ea6694981b7bd2ab10f55a5f556e99e70f817d1","last_reissued_at":"2026-05-17T23:59:25.151231Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:25.151231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of linear hypergraphs of large girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J\\'ozsef Balogh, Lina Li","submitted_at":"2017-09-12T22:51:33Z","abstract_excerpt":"An $r$-uniform \\textit{linear cycle} of length $\\ell$, denoted by $C_{\\ell}^r$, is an $r$-graph with edges $e_1, \\ldots, e_{\\ell}$ such that for every $i\\in [\\ell-1]$, $|e_i\\cap e_{i+1}|=1$, $|e_{\\ell}\\cap e_1|=1$ and $e_i\\cap e_j=\\emptyset$ for all other pairs $\\{i, j\\},\\ i\\neq j$. For every $r\\geq 3$ and $\\ell\\geq 4$, we show that there exists a constant $C$ depending on $r$ and $\\ell$ such that the number of linear $r$-graphs of girth $\\ell$ is at most $2^{Cn^{1+1/\\lfloor \\ell/2\\rfloor}}$. Furthermore, we extend the result for $\\ell=4$, proving that there exists a constant $C$ depending on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04079","kind":"arxiv","version":2},"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":"1709.04079","created_at":"2026-05-17T23:59:25.151336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.04079v2","created_at":"2026-05-17T23:59:25.151336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04079","created_at":"2026-05-17T23:59:25.151336+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMWHE7XZUGGK","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMWHE7XZUGGKVTYM","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMWHE7XZ","created_at":"2026-05-18T12:31:37.085036+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/PMWHE7XZUGGKVTYMIIHZ5JTJJG","json":"https://pith.science/pith/PMWHE7XZUGGKVTYMIIHZ5JTJJG.json","graph_json":"https://pith.science/api/pith-number/PMWHE7XZUGGKVTYMIIHZ5JTJJG/graph.json","events_json":"https://pith.science/api/pith-number/PMWHE7XZUGGKVTYMIIHZ5JTJJG/events.json","paper":"https://pith.science/paper/PMWHE7XZ"},"agent_actions":{"view_html":"https://pith.science/pith/PMWHE7XZUGGKVTYMIIHZ5JTJJG","download_json":"https://pith.science/pith/PMWHE7XZUGGKVTYMIIHZ5JTJJG.json","view_paper":"https://pith.science/paper/PMWHE7XZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.04079&json=true","fetch_graph":"https://pith.science/api/pith-number/PMWHE7XZUGGKVTYMIIHZ5JTJJG/graph.json","fetch_events":"https://pith.science/api/pith-number/PMWHE7XZUGGKVTYMIIHZ5JTJJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMWHE7XZUGGKVTYMIIHZ5JTJJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMWHE7XZUGGKVTYMIIHZ5JTJJG/action/storage_attestation","attest_author":"https://pith.science/pith/PMWHE7XZUGGKVTYMIIHZ5JTJJG/action/author_attestation","sign_citation":"https://pith.science/pith/PMWHE7XZUGGKVTYMIIHZ5JTJJG/action/citation_signature","submit_replication":"https://pith.science/pith/PMWHE7XZUGGKVTYMIIHZ5JTJJG/action/replication_record"}},"created_at":"2026-05-17T23:59:25.151336+00:00","updated_at":"2026-05-17T23:59:25.151336+00:00"}