{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:INZPLIPA62CWRB5VEM72DUQMKK","short_pith_number":"pith:INZPLIPA","schema_version":"1.0","canonical_sha256":"4372f5a1e0f6856887b5233fa1d20c5299addf18d72af7de0eb061919936f0d6","source":{"kind":"arxiv","id":"1609.08212","version":1},"attestation_state":"computed","paper":{"title":"Cycles of given lengths in hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Tao Jiang","submitted_at":"2016-09-26T22:26:17Z","abstract_excerpt":"In this paper, we develop a method for studying cycle lengths in hypergraphs. Our method is built on earlier ones used in [21,22,18]. However, instead of utilizing the well-known lemma of Bondy and Simonovits [4] that most existing methods do, we develop a new and very simple lemma in its place. One useful feature of the new lemma is its adaptiveness for the hypergraph setting.\n  Using this new method, we prove a conjecture of Verstra\\\"ete [37] that for $r\\ge 3$, every $r$-uniform hypergraph with average degree $\\Omega(k^{r-1})$ contains Berge cycles of $k$ consecutive lengths. This is sharp u"},"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":"1609.08212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-26T22:26:17Z","cross_cats_sorted":[],"title_canon_sha256":"a2761cf09627fb45cc55d47596789a5074e1538db65548471f0aa68dc218f86d","abstract_canon_sha256":"e0c132b2327be09c63aaac2ea71d1b8b95e0478ded05a73833278f1817a26781"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:46.361270Z","signature_b64":"RDuer6ZcTbrcR4RrVNacSC2sNji5oJ+GIFb6mTDPvjD8D7iUhgKgPoKKIU1VyeG9E7tdZRyT0IgGbVxpimKsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4372f5a1e0f6856887b5233fa1d20c5299addf18d72af7de0eb061919936f0d6","last_reissued_at":"2026-05-18T01:03:46.359968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:46.359968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cycles of given lengths in hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Tao Jiang","submitted_at":"2016-09-26T22:26:17Z","abstract_excerpt":"In this paper, we develop a method for studying cycle lengths in hypergraphs. Our method is built on earlier ones used in [21,22,18]. However, instead of utilizing the well-known lemma of Bondy and Simonovits [4] that most existing methods do, we develop a new and very simple lemma in its place. One useful feature of the new lemma is its adaptiveness for the hypergraph setting.\n  Using this new method, we prove a conjecture of Verstra\\\"ete [37] that for $r\\ge 3$, every $r$-uniform hypergraph with average degree $\\Omega(k^{r-1})$ contains Berge cycles of $k$ consecutive lengths. This is sharp u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.08212","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":"1609.08212","created_at":"2026-05-18T01:03:46.360255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.08212v1","created_at":"2026-05-18T01:03:46.360255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.08212","created_at":"2026-05-18T01:03:46.360255+00:00"},{"alias_kind":"pith_short_12","alias_value":"INZPLIPA62CW","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"INZPLIPA62CWRB5V","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"INZPLIPA","created_at":"2026-05-18T12:30:22.444734+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/INZPLIPA62CWRB5VEM72DUQMKK","json":"https://pith.science/pith/INZPLIPA62CWRB5VEM72DUQMKK.json","graph_json":"https://pith.science/api/pith-number/INZPLIPA62CWRB5VEM72DUQMKK/graph.json","events_json":"https://pith.science/api/pith-number/INZPLIPA62CWRB5VEM72DUQMKK/events.json","paper":"https://pith.science/paper/INZPLIPA"},"agent_actions":{"view_html":"https://pith.science/pith/INZPLIPA62CWRB5VEM72DUQMKK","download_json":"https://pith.science/pith/INZPLIPA62CWRB5VEM72DUQMKK.json","view_paper":"https://pith.science/paper/INZPLIPA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.08212&json=true","fetch_graph":"https://pith.science/api/pith-number/INZPLIPA62CWRB5VEM72DUQMKK/graph.json","fetch_events":"https://pith.science/api/pith-number/INZPLIPA62CWRB5VEM72DUQMKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INZPLIPA62CWRB5VEM72DUQMKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INZPLIPA62CWRB5VEM72DUQMKK/action/storage_attestation","attest_author":"https://pith.science/pith/INZPLIPA62CWRB5VEM72DUQMKK/action/author_attestation","sign_citation":"https://pith.science/pith/INZPLIPA62CWRB5VEM72DUQMKK/action/citation_signature","submit_replication":"https://pith.science/pith/INZPLIPA62CWRB5VEM72DUQMKK/action/replication_record"}},"created_at":"2026-05-18T01:03:46.360255+00:00","updated_at":"2026-05-18T01:03:46.360255+00:00"}