{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3L7CLFS7VDAFTKNNKJ633J6AYE","short_pith_number":"pith:3L7CLFS7","schema_version":"1.0","canonical_sha256":"dafe25965fa8c059a9ad527dbda7c0c12020d28a4ad675e184929b296526a0d3","source":{"kind":"arxiv","id":"1302.2387","version":1},"attestation_state":"computed","paper":{"title":"Hypergraph Turan numbers of linear cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tao Jiang, Zoltan Furedi","submitted_at":"2013-02-11T02:09:01Z","abstract_excerpt":"A k-uniform linear cycle of length s is a cyclic list of k-sets A_1,..., A_s such that consecutive sets intersect in exactly one element and nonconsecutive sets are disjoint. For all k at least 5 and s at least 3 and sufficiently large n we determine the largest size of a k-uniform set family on [n] not containing a linear cycle of length s. For odd s=2t+1 the unique extremal family F_S consists of all k-sets in [n] intersecting a fixed t-set S in [n]. For even s=2t+2, the unique extremal family consists of F_S plus all the k-sets outside S containing some fixed two elements.\n  For k at least "},"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":"1302.2387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-11T02:09:01Z","cross_cats_sorted":[],"title_canon_sha256":"4047e63ea770f3419339eb2c3b0827477ecd31a7f2de20de0d018411f927456a","abstract_canon_sha256":"1d20d20242a0ea2cf356bd37b29ad24b79dbc3283b2ed778beeade1380f56553"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:01.334094Z","signature_b64":"Ajf40PSoWrlEmBAq4n7IKka+adjIpGhHpG1iqt+ocY+QIJQ0/tXcWpLlB7oS2KC54zZnnU6rxpqCzm5It9WsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dafe25965fa8c059a9ad527dbda7c0c12020d28a4ad675e184929b296526a0d3","last_reissued_at":"2026-05-18T03:34:01.331261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:01.331261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph Turan numbers of linear cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tao Jiang, Zoltan Furedi","submitted_at":"2013-02-11T02:09:01Z","abstract_excerpt":"A k-uniform linear cycle of length s is a cyclic list of k-sets A_1,..., A_s such that consecutive sets intersect in exactly one element and nonconsecutive sets are disjoint. For all k at least 5 and s at least 3 and sufficiently large n we determine the largest size of a k-uniform set family on [n] not containing a linear cycle of length s. For odd s=2t+1 the unique extremal family F_S consists of all k-sets in [n] intersecting a fixed t-set S in [n]. For even s=2t+2, the unique extremal family consists of F_S plus all the k-sets outside S containing some fixed two elements.\n  For k at least "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2387","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":"1302.2387","created_at":"2026-05-18T03:34:01.331421+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2387v1","created_at":"2026-05-18T03:34:01.331421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2387","created_at":"2026-05-18T03:34:01.331421+00:00"},{"alias_kind":"pith_short_12","alias_value":"3L7CLFS7VDAF","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3L7CLFS7VDAFTKNN","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3L7CLFS7","created_at":"2026-05-18T12:27:32.513160+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/3L7CLFS7VDAFTKNNKJ633J6AYE","json":"https://pith.science/pith/3L7CLFS7VDAFTKNNKJ633J6AYE.json","graph_json":"https://pith.science/api/pith-number/3L7CLFS7VDAFTKNNKJ633J6AYE/graph.json","events_json":"https://pith.science/api/pith-number/3L7CLFS7VDAFTKNNKJ633J6AYE/events.json","paper":"https://pith.science/paper/3L7CLFS7"},"agent_actions":{"view_html":"https://pith.science/pith/3L7CLFS7VDAFTKNNKJ633J6AYE","download_json":"https://pith.science/pith/3L7CLFS7VDAFTKNNKJ633J6AYE.json","view_paper":"https://pith.science/paper/3L7CLFS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2387&json=true","fetch_graph":"https://pith.science/api/pith-number/3L7CLFS7VDAFTKNNKJ633J6AYE/graph.json","fetch_events":"https://pith.science/api/pith-number/3L7CLFS7VDAFTKNNKJ633J6AYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3L7CLFS7VDAFTKNNKJ633J6AYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3L7CLFS7VDAFTKNNKJ633J6AYE/action/storage_attestation","attest_author":"https://pith.science/pith/3L7CLFS7VDAFTKNNKJ633J6AYE/action/author_attestation","sign_citation":"https://pith.science/pith/3L7CLFS7VDAFTKNNKJ633J6AYE/action/citation_signature","submit_replication":"https://pith.science/pith/3L7CLFS7VDAFTKNNKJ633J6AYE/action/replication_record"}},"created_at":"2026-05-18T03:34:01.331421+00:00","updated_at":"2026-05-18T03:34:01.331421+00:00"}