{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S2MNNDAXVQAUVKJGJBFBQDYEDL","short_pith_number":"pith:S2MNNDAX","schema_version":"1.0","canonical_sha256":"9698d68c17ac014aa926484a180f041adbd3d1f2bcc72fd3813954e917ae170c","source":{"kind":"arxiv","id":"1804.03988","version":3},"attestation_state":"computed","paper":{"title":"Stability results on vertex Tur\\'an problems in Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Bal\\'azs Patk\\'os, D\\'aniel Gerbner, D\\'aniel Nagy, M\\'at\\'e Vizer","submitted_at":"2018-04-11T14:00:39Z","abstract_excerpt":"The vertex set of the Kneser graph $K(n,k)$ is $V = \\binom{[n]}{k}$ and two vertices are adjacent if the corresponding sets are disjoint. For any graph $F$, the largest size of a vertex set $U \\subseteq V$ such that $K(n,k)[U]$ is $F$-free, was recently determined by Alishahi and Taherkhani, whenever $n$ is large enough compared to $k$ and $F$. In this paper, we determine the second largest size of a vertex set $W \\subseteq V$ such that $K(n,k)[W]$ is $F$-free, in the case when $F$ is an even cycle or a complete multi-partite graph. In the latter case, we actually give a more general theorem d"},"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":"1804.03988","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-11T14:00:39Z","cross_cats_sorted":[],"title_canon_sha256":"cce3bcc2fac0b683b83cb86b3947e1c57d5bf5135f0eaf2ad4c1ccc389e22836","abstract_canon_sha256":"48d97fd1760d193721987813204ac4b147d70584e814789cf16dd94a70b18e60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:54.628102Z","signature_b64":"2OoXUeMFA+/xy6Umueo0I5aBaNwFkOYqu4D5RbEh6V0qPhqvbd9rfBhME+M1rZ9tRqe96c/L51DnGLBpKPCDDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9698d68c17ac014aa926484a180f041adbd3d1f2bcc72fd3813954e917ae170c","last_reissued_at":"2026-05-17T23:51:54.627491Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:54.627491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stability results on vertex Tur\\'an problems in Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Bal\\'azs Patk\\'os, D\\'aniel Gerbner, D\\'aniel Nagy, M\\'at\\'e Vizer","submitted_at":"2018-04-11T14:00:39Z","abstract_excerpt":"The vertex set of the Kneser graph $K(n,k)$ is $V = \\binom{[n]}{k}$ and two vertices are adjacent if the corresponding sets are disjoint. For any graph $F$, the largest size of a vertex set $U \\subseteq V$ such that $K(n,k)[U]$ is $F$-free, was recently determined by Alishahi and Taherkhani, whenever $n$ is large enough compared to $k$ and $F$. In this paper, we determine the second largest size of a vertex set $W \\subseteq V$ such that $K(n,k)[W]$ is $F$-free, in the case when $F$ is an even cycle or a complete multi-partite graph. In the latter case, we actually give a more general theorem d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03988","kind":"arxiv","version":3},"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":"1804.03988","created_at":"2026-05-17T23:51:54.627579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03988v3","created_at":"2026-05-17T23:51:54.627579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03988","created_at":"2026-05-17T23:51:54.627579+00:00"},{"alias_kind":"pith_short_12","alias_value":"S2MNNDAXVQAU","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S2MNNDAXVQAUVKJG","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S2MNNDAX","created_at":"2026-05-18T12:32:50.500415+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/S2MNNDAXVQAUVKJGJBFBQDYEDL","json":"https://pith.science/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL.json","graph_json":"https://pith.science/api/pith-number/S2MNNDAXVQAUVKJGJBFBQDYEDL/graph.json","events_json":"https://pith.science/api/pith-number/S2MNNDAXVQAUVKJGJBFBQDYEDL/events.json","paper":"https://pith.science/paper/S2MNNDAX"},"agent_actions":{"view_html":"https://pith.science/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL","download_json":"https://pith.science/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL.json","view_paper":"https://pith.science/paper/S2MNNDAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03988&json=true","fetch_graph":"https://pith.science/api/pith-number/S2MNNDAXVQAUVKJGJBFBQDYEDL/graph.json","fetch_events":"https://pith.science/api/pith-number/S2MNNDAXVQAUVKJGJBFBQDYEDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL/action/storage_attestation","attest_author":"https://pith.science/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL/action/author_attestation","sign_citation":"https://pith.science/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL/action/citation_signature","submit_replication":"https://pith.science/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL/action/replication_record"}},"created_at":"2026-05-17T23:51:54.627579+00:00","updated_at":"2026-05-17T23:51:54.627579+00:00"}