{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CSHZQ4JPMV7POT2CSVS3QM6KDT","short_pith_number":"pith:CSHZQ4JP","schema_version":"1.0","canonical_sha256":"148f98712f657ef74f429565b833ca1ccda4955fc2d0bd3cce3879ff633cdf5f","source":{"kind":"arxiv","id":"1807.10177","version":2},"attestation_state":"computed","paper":{"title":"Hypergraphs with few Berge paths of fixed length between vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Tait, Zhiyang He","submitted_at":"2018-07-26T14:54:46Z","abstract_excerpt":"In this paper we study the maximum number of hyperedges which may be in an $r$-uniform hypergraph under the restriction that no pair of vertices has more than $t$ Berge paths of length $k$ between them. When $r=t=2$, this is the even-cycle problem asking for $\\mathrm{ex}(n, C_{2k})$. We extend results of F\\\"uredi and Simonovits and of Conlon, who studied the problem when $r=2$. In particular, we show that for fixed $k$ and $r$, there is a constant $t$ such that the maximum number of edges can be determined in order of magnitude."},"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":"1807.10177","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-26T14:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"37e01dd09c57ffc9428610256d528a84b060030ed26537f98e19e4c3e7ad27a0","abstract_canon_sha256":"573df67b4db16200f3c84e1a1f86e55e65435606faf9a8fb6a2536543c9ae991"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:41.455200Z","signature_b64":"BgGNGkgdY/iq+VeewzggRYwHLeka+l5eWuXFKg/Ng8J/IXofbh8bF1SR82o3Kf4Z1eSXxR4nmNXI/7IN0rweAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"148f98712f657ef74f429565b833ca1ccda4955fc2d0bd3cce3879ff633cdf5f","last_reissued_at":"2026-05-17T23:52:41.454556Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:41.454556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraphs with few Berge paths of fixed length between vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael Tait, Zhiyang He","submitted_at":"2018-07-26T14:54:46Z","abstract_excerpt":"In this paper we study the maximum number of hyperedges which may be in an $r$-uniform hypergraph under the restriction that no pair of vertices has more than $t$ Berge paths of length $k$ between them. When $r=t=2$, this is the even-cycle problem asking for $\\mathrm{ex}(n, C_{2k})$. We extend results of F\\\"uredi and Simonovits and of Conlon, who studied the problem when $r=2$. In particular, we show that for fixed $k$ and $r$, there is a constant $t$ such that the maximum number of edges can be determined in order of magnitude."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10177","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":"1807.10177","created_at":"2026-05-17T23:52:41.454655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10177v2","created_at":"2026-05-17T23:52:41.454655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10177","created_at":"2026-05-17T23:52:41.454655+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSHZQ4JPMV7P","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSHZQ4JPMV7POT2C","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSHZQ4JP","created_at":"2026-05-18T12:32:19.392346+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/CSHZQ4JPMV7POT2CSVS3QM6KDT","json":"https://pith.science/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT.json","graph_json":"https://pith.science/api/pith-number/CSHZQ4JPMV7POT2CSVS3QM6KDT/graph.json","events_json":"https://pith.science/api/pith-number/CSHZQ4JPMV7POT2CSVS3QM6KDT/events.json","paper":"https://pith.science/paper/CSHZQ4JP"},"agent_actions":{"view_html":"https://pith.science/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT","download_json":"https://pith.science/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT.json","view_paper":"https://pith.science/paper/CSHZQ4JP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10177&json=true","fetch_graph":"https://pith.science/api/pith-number/CSHZQ4JPMV7POT2CSVS3QM6KDT/graph.json","fetch_events":"https://pith.science/api/pith-number/CSHZQ4JPMV7POT2CSVS3QM6KDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT/action/storage_attestation","attest_author":"https://pith.science/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT/action/author_attestation","sign_citation":"https://pith.science/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT/action/citation_signature","submit_replication":"https://pith.science/pith/CSHZQ4JPMV7POT2CSVS3QM6KDT/action/replication_record"}},"created_at":"2026-05-17T23:52:41.454655+00:00","updated_at":"2026-05-17T23:52:41.454655+00:00"}