{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:S2MNNDAXVQAUVKJGJBFBQDYEDL","short_pith_number":"pith:S2MNNDAX","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"},"canonical_sha256":"9698d68c17ac014aa926484a180f041adbd3d1f2bcc72fd3813954e917ae170c","source":{"kind":"arxiv","id":"1804.03988","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03988","created_at":"2026-05-17T23:51:54Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03988v3","created_at":"2026-05-17T23:51:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03988","created_at":"2026-05-17T23:51:54Z"},{"alias_kind":"pith_short_12","alias_value":"S2MNNDAXVQAU","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S2MNNDAXVQAUVKJG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S2MNNDAX","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:S2MNNDAXVQAUVKJGJBFBQDYEDL","target":"record","payload":{"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"},"canonical_sha256":"9698d68c17ac014aa926484a180f041adbd3d1f2bcc72fd3813954e917ae170c","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"},"source_kind":"arxiv","source_id":"1804.03988","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3cygr7j/ycstpWm9ftBUdgOKbgcytOrwBewoPrDgY1ubmV4wEBqOp3NfcnC1NWWcvMWeOQTrW7JkxXNBh427Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:56:19.129638Z"},"content_sha256":"76a2a2d99a389944ff14324d7d55364805ea7ca22376bcfefab612e7d5b71693","schema_version":"1.0","event_id":"sha256:76a2a2d99a389944ff14324d7d55364805ea7ca22376bcfefab612e7d5b71693"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:S2MNNDAXVQAUVKJGJBFBQDYEDL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U9LEyFDAD5NOIfdkIy2EoUnUzM+/0uNm3JI5RhUuveYKFD3jhNLoYfeUouE+PuLg3vHyMybRb/td4r9e373dAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:56:19.130373Z"},"content_sha256":"725cb4730a1f631f3f93774d23a41c652663c9e55ddc046806d2862ee0d297da","schema_version":"1.0","event_id":"sha256:725cb4730a1f631f3f93774d23a41c652663c9e55ddc046806d2862ee0d297da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL/bundle.json","state_url":"https://pith.science/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T17:56:19Z","links":{"resolver":"https://pith.science/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL","bundle":"https://pith.science/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL/bundle.json","state":"https://pith.science/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2MNNDAXVQAUVKJGJBFBQDYEDL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S2MNNDAXVQAUVKJGJBFBQDYEDL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"48d97fd1760d193721987813204ac4b147d70584e814789cf16dd94a70b18e60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-11T14:00:39Z","title_canon_sha256":"cce3bcc2fac0b683b83cb86b3947e1c57d5bf5135f0eaf2ad4c1ccc389e22836"},"schema_version":"1.0","source":{"id":"1804.03988","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03988","created_at":"2026-05-17T23:51:54Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03988v3","created_at":"2026-05-17T23:51:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03988","created_at":"2026-05-17T23:51:54Z"},{"alias_kind":"pith_short_12","alias_value":"S2MNNDAXVQAU","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S2MNNDAXVQAUVKJG","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S2MNNDAX","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:725cb4730a1f631f3f93774d23a41c652663c9e55ddc046806d2862ee0d297da","target":"graph","created_at":"2026-05-17T23:51:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Abhishek Methuku, Bal\\'azs Patk\\'os, D\\'aniel Gerbner, D\\'aniel Nagy, M\\'at\\'e Vizer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-11T14:00:39Z","title":"Stability results on vertex Tur\\'an problems in Kneser graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03988","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:76a2a2d99a389944ff14324d7d55364805ea7ca22376bcfefab612e7d5b71693","target":"record","created_at":"2026-05-17T23:51:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"48d97fd1760d193721987813204ac4b147d70584e814789cf16dd94a70b18e60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-11T14:00:39Z","title_canon_sha256":"cce3bcc2fac0b683b83cb86b3947e1c57d5bf5135f0eaf2ad4c1ccc389e22836"},"schema_version":"1.0","source":{"id":"1804.03988","kind":"arxiv","version":3}},"canonical_sha256":"9698d68c17ac014aa926484a180f041adbd3d1f2bcc72fd3813954e917ae170c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9698d68c17ac014aa926484a180f041adbd3d1f2bcc72fd3813954e917ae170c","first_computed_at":"2026-05-17T23:51:54.627491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:54.627491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2OoXUeMFA+/xy6Umueo0I5aBaNwFkOYqu4D5RbEh6V0qPhqvbd9rfBhME+M1rZ9tRqe96c/L51DnGLBpKPCDDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:54.628102Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03988","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76a2a2d99a389944ff14324d7d55364805ea7ca22376bcfefab612e7d5b71693","sha256:725cb4730a1f631f3f93774d23a41c652663c9e55ddc046806d2862ee0d297da"],"state_sha256":"040abbcc6f52daab32f4eaf2ffaeef779c1976648bd3a64c31d899cd629018b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HBjnEWhWiMoYpQSGobO2YrVW3Zr1csbs0BqHiGhHuWyfz7V/uifftrrnQBp9l8M8b4+37tY7ZXqqN81D16sdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:56:19.133973Z","bundle_sha256":"57dc47d7c7abe73bf4af40f87bd1d1727626557d758ab57041f0e240d915534b"}}