{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V6RNSRMI5S6L2OVPLCIYNJEOGQ","short_pith_number":"pith:V6RNSRMI","schema_version":"1.0","canonical_sha256":"afa2d94588ecbcbd3aaf589186a48e34194ff8030dfe91f1b93e69653b20f9ce","source":{"kind":"arxiv","id":"1712.00831","version":1},"attestation_state":"computed","paper":{"title":"A Generalized Tur\\'an Problem and its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Lior Gishboliner","submitted_at":"2017-12-03T20:15:43Z","abstract_excerpt":"The investigation of conditions guaranteeing the appearance of cycles of certain lengths is one of the most well-studied topics in graph theory. In this paper we consider a problem of this type which asks, for fixed integers ${\\ell}$ and $k$, how many copies of the $k$-cycle guarantee the appearance of an $\\ell$-cycle? Extending previous results of Bollob\\'as--Gy\\H{o}ri--Li and Alon--Shikhelman, we fully resolve this problem by giving tight (or nearly tight) bounds for all values of $\\ell$ and $k$.\n  We also present a somewhat surprising application of the above mentioned estimates to the stud"},"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":"1712.00831","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-03T20:15:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"85c5d97a2eb230f7758434ea93b54a51578a49ed6aa310c1d19201ef73cc044e","abstract_canon_sha256":"c29a11066063ac5c06b91055fb05293d840a4acc349d9375777e17a383b0ac65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:00.288197Z","signature_b64":"gknkRBeYLdEmeYkHNi2+nFBFo0jJuDhNze07NWrc6zsRS/c4eGQFBpdc4BLCjGmL/5YpjF2wFNQo85U0j7QBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afa2d94588ecbcbd3aaf589186a48e34194ff8030dfe91f1b93e69653b20f9ce","last_reissued_at":"2026-05-18T00:29:00.287681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:00.287681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generalized Tur\\'an Problem and its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Lior Gishboliner","submitted_at":"2017-12-03T20:15:43Z","abstract_excerpt":"The investigation of conditions guaranteeing the appearance of cycles of certain lengths is one of the most well-studied topics in graph theory. In this paper we consider a problem of this type which asks, for fixed integers ${\\ell}$ and $k$, how many copies of the $k$-cycle guarantee the appearance of an $\\ell$-cycle? Extending previous results of Bollob\\'as--Gy\\H{o}ri--Li and Alon--Shikhelman, we fully resolve this problem by giving tight (or nearly tight) bounds for all values of $\\ell$ and $k$.\n  We also present a somewhat surprising application of the above mentioned estimates to the stud"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00831","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":"1712.00831","created_at":"2026-05-18T00:29:00.287770+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.00831v1","created_at":"2026-05-18T00:29:00.287770+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00831","created_at":"2026-05-18T00:29:00.287770+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6RNSRMI5S6L","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6RNSRMI5S6L2OVP","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6RNSRMI","created_at":"2026-05-18T12:31:49.984773+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/V6RNSRMI5S6L2OVPLCIYNJEOGQ","json":"https://pith.science/pith/V6RNSRMI5S6L2OVPLCIYNJEOGQ.json","graph_json":"https://pith.science/api/pith-number/V6RNSRMI5S6L2OVPLCIYNJEOGQ/graph.json","events_json":"https://pith.science/api/pith-number/V6RNSRMI5S6L2OVPLCIYNJEOGQ/events.json","paper":"https://pith.science/paper/V6RNSRMI"},"agent_actions":{"view_html":"https://pith.science/pith/V6RNSRMI5S6L2OVPLCIYNJEOGQ","download_json":"https://pith.science/pith/V6RNSRMI5S6L2OVPLCIYNJEOGQ.json","view_paper":"https://pith.science/paper/V6RNSRMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.00831&json=true","fetch_graph":"https://pith.science/api/pith-number/V6RNSRMI5S6L2OVPLCIYNJEOGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/V6RNSRMI5S6L2OVPLCIYNJEOGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6RNSRMI5S6L2OVPLCIYNJEOGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6RNSRMI5S6L2OVPLCIYNJEOGQ/action/storage_attestation","attest_author":"https://pith.science/pith/V6RNSRMI5S6L2OVPLCIYNJEOGQ/action/author_attestation","sign_citation":"https://pith.science/pith/V6RNSRMI5S6L2OVPLCIYNJEOGQ/action/citation_signature","submit_replication":"https://pith.science/pith/V6RNSRMI5S6L2OVPLCIYNJEOGQ/action/replication_record"}},"created_at":"2026-05-18T00:29:00.287770+00:00","updated_at":"2026-05-18T00:29:00.287770+00:00"}