{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2JFOW3S7W3QIZPMIM3FCT4PKI4","short_pith_number":"pith:2JFOW3S7","schema_version":"1.0","canonical_sha256":"d24aeb6e5fb6e08cbd8866ca29f1ea472cf5042789a97452de996956135775c6","source":{"kind":"arxiv","id":"2006.13206","version":1},"attestation_state":"computed","paper":{"title":"Linear cycles of consecutive lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Liana Yepremyan, Tao Jiang","submitted_at":"2020-06-23T17:59:12Z","abstract_excerpt":"A well-known result of Verstra\\\"ete \\cite{V00} shows that for each integer $k\\geq 2$ every graph $G$ with average degree at least $8k$ contains cycles of $k$ consecutive even lengths, the shortest of which is at most twice the radius of $G$. We establish two extensions of Verstra\\\"ete's result for linear cycles in linear $r$-uniform hypergraphs.\n  We show that for any fixed integers $r\\geq 3,k\\geq 2$, there exist constants $c_1=c_1(r)$ and $c_2=c_2(r,k)$, such that every linear $r$-uniform hypergraph $G$ with average degree $d(G)\\geq c_1 k$ contains linear cycles of $k$ consecutive even length"},"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":"2006.13206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-06-23T17:59:12Z","cross_cats_sorted":[],"title_canon_sha256":"f11beaad54239565da94fe0b7f17fb4c57b76209a7db77eaea3dd97af6d6a703","abstract_canon_sha256":"3fb7440a01bfe6c3fc75e4bd1e4eeb8c8b6c5c25538a3a2d789b0243c0c9fe84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:12:54.124009Z","signature_b64":"+xyCPIksDpHmtFXmNISPNbzoU9FKWWK/zHg4Zrisvqr3hoMMyGNchbFOx/96h/QutIpG3JYFqRrysWTPh2ogCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d24aeb6e5fb6e08cbd8866ca29f1ea472cf5042789a97452de996956135775c6","last_reissued_at":"2026-07-05T01:12:54.123605Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:12:54.123605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear cycles of consecutive lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Liana Yepremyan, Tao Jiang","submitted_at":"2020-06-23T17:59:12Z","abstract_excerpt":"A well-known result of Verstra\\\"ete \\cite{V00} shows that for each integer $k\\geq 2$ every graph $G$ with average degree at least $8k$ contains cycles of $k$ consecutive even lengths, the shortest of which is at most twice the radius of $G$. We establish two extensions of Verstra\\\"ete's result for linear cycles in linear $r$-uniform hypergraphs.\n  We show that for any fixed integers $r\\geq 3,k\\geq 2$, there exist constants $c_1=c_1(r)$ and $c_2=c_2(r,k)$, such that every linear $r$-uniform hypergraph $G$ with average degree $d(G)\\geq c_1 k$ contains linear cycles of $k$ consecutive even length"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.13206","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.13206/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2006.13206","created_at":"2026-07-05T01:12:54.123668+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.13206v1","created_at":"2026-07-05T01:12:54.123668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.13206","created_at":"2026-07-05T01:12:54.123668+00:00"},{"alias_kind":"pith_short_12","alias_value":"2JFOW3S7W3QI","created_at":"2026-07-05T01:12:54.123668+00:00"},{"alias_kind":"pith_short_16","alias_value":"2JFOW3S7W3QIZPMI","created_at":"2026-07-05T01:12:54.123668+00:00"},{"alias_kind":"pith_short_8","alias_value":"2JFOW3S7","created_at":"2026-07-05T01:12:54.123668+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/2JFOW3S7W3QIZPMIM3FCT4PKI4","json":"https://pith.science/pith/2JFOW3S7W3QIZPMIM3FCT4PKI4.json","graph_json":"https://pith.science/api/pith-number/2JFOW3S7W3QIZPMIM3FCT4PKI4/graph.json","events_json":"https://pith.science/api/pith-number/2JFOW3S7W3QIZPMIM3FCT4PKI4/events.json","paper":"https://pith.science/paper/2JFOW3S7"},"agent_actions":{"view_html":"https://pith.science/pith/2JFOW3S7W3QIZPMIM3FCT4PKI4","download_json":"https://pith.science/pith/2JFOW3S7W3QIZPMIM3FCT4PKI4.json","view_paper":"https://pith.science/paper/2JFOW3S7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.13206&json=true","fetch_graph":"https://pith.science/api/pith-number/2JFOW3S7W3QIZPMIM3FCT4PKI4/graph.json","fetch_events":"https://pith.science/api/pith-number/2JFOW3S7W3QIZPMIM3FCT4PKI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2JFOW3S7W3QIZPMIM3FCT4PKI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2JFOW3S7W3QIZPMIM3FCT4PKI4/action/storage_attestation","attest_author":"https://pith.science/pith/2JFOW3S7W3QIZPMIM3FCT4PKI4/action/author_attestation","sign_citation":"https://pith.science/pith/2JFOW3S7W3QIZPMIM3FCT4PKI4/action/citation_signature","submit_replication":"https://pith.science/pith/2JFOW3S7W3QIZPMIM3FCT4PKI4/action/replication_record"}},"created_at":"2026-07-05T01:12:54.123668+00:00","updated_at":"2026-07-05T01:12:54.123668+00:00"}