{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CRITOTNT36JVMTLHQ3KTM654GS","short_pith_number":"pith:CRITOTNT","schema_version":"1.0","canonical_sha256":"1451374db3df93564d6786d5367bbc349549aee33801da1992664537431859a0","source":{"kind":"arxiv","id":"1801.03972","version":2},"attestation_state":"computed","paper":{"title":"Extremal $G$-free induced subgraphs of Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Taherkhani, Meysam Alishahi","submitted_at":"2018-01-11T20:06:30Z","abstract_excerpt":"The Kneser graph ${\\rm KG}_{n,k}$ is a graph whose vertex set is the family of all $k$-subsets of $[n]$ and two vertices are adjacent if their corresponding subsets are disjoint. The classical Erd\\H{o}s-Ko-Rado theorem determines the cardinality and structure of a maximum induced $K_2$-free subgraph in ${\\rm KG}_{n,k}$. As a generalization of the Erd\\H{o}s-Ko-Rado theorem, Erd\\H{o}s proposed a conjecture about the maximum order of an induced $K_{s+1}$-free subgraph of ${\\rm KG}_{n,k}$. As the best known result concerning this conjecture, Frankl [Journal of Combinatorial Theory, Series A, 2013]"},"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":"1801.03972","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-11T20:06:30Z","cross_cats_sorted":[],"title_canon_sha256":"afac57435d82ff0396e0c4d8b4fc509de74d12c497a4b7ebb096d13b57bac58c","abstract_canon_sha256":"8b4f5c4842d093ea6f2684de8454a3261f71836c2593927e99b11e5f7056b6c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:46.343744Z","signature_b64":"DhQpnTeQ7kz6pWqNVC/y/kchMWx7naSgHa80hL3D1ndBVrGyzOxATrXX/iQoGN3FCo3znM8YGReNFroFNvITDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1451374db3df93564d6786d5367bbc349549aee33801da1992664537431859a0","last_reissued_at":"2026-05-18T00:20:46.343296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:46.343296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal $G$-free induced subgraphs of Kneser graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ali Taherkhani, Meysam Alishahi","submitted_at":"2018-01-11T20:06:30Z","abstract_excerpt":"The Kneser graph ${\\rm KG}_{n,k}$ is a graph whose vertex set is the family of all $k$-subsets of $[n]$ and two vertices are adjacent if their corresponding subsets are disjoint. The classical Erd\\H{o}s-Ko-Rado theorem determines the cardinality and structure of a maximum induced $K_2$-free subgraph in ${\\rm KG}_{n,k}$. As a generalization of the Erd\\H{o}s-Ko-Rado theorem, Erd\\H{o}s proposed a conjecture about the maximum order of an induced $K_{s+1}$-free subgraph of ${\\rm KG}_{n,k}$. As the best known result concerning this conjecture, Frankl [Journal of Combinatorial Theory, Series A, 2013]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03972","kind":"arxiv","version":2},"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":"1801.03972","created_at":"2026-05-18T00:20:46.343374+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03972v2","created_at":"2026-05-18T00:20:46.343374+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03972","created_at":"2026-05-18T00:20:46.343374+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRITOTNT36JV","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRITOTNT36JVMTLH","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRITOTNT","created_at":"2026-05-18T12:32:19.392346+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/CRITOTNT36JVMTLHQ3KTM654GS","json":"https://pith.science/pith/CRITOTNT36JVMTLHQ3KTM654GS.json","graph_json":"https://pith.science/api/pith-number/CRITOTNT36JVMTLHQ3KTM654GS/graph.json","events_json":"https://pith.science/api/pith-number/CRITOTNT36JVMTLHQ3KTM654GS/events.json","paper":"https://pith.science/paper/CRITOTNT"},"agent_actions":{"view_html":"https://pith.science/pith/CRITOTNT36JVMTLHQ3KTM654GS","download_json":"https://pith.science/pith/CRITOTNT36JVMTLHQ3KTM654GS.json","view_paper":"https://pith.science/paper/CRITOTNT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03972&json=true","fetch_graph":"https://pith.science/api/pith-number/CRITOTNT36JVMTLHQ3KTM654GS/graph.json","fetch_events":"https://pith.science/api/pith-number/CRITOTNT36JVMTLHQ3KTM654GS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRITOTNT36JVMTLHQ3KTM654GS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRITOTNT36JVMTLHQ3KTM654GS/action/storage_attestation","attest_author":"https://pith.science/pith/CRITOTNT36JVMTLHQ3KTM654GS/action/author_attestation","sign_citation":"https://pith.science/pith/CRITOTNT36JVMTLHQ3KTM654GS/action/citation_signature","submit_replication":"https://pith.science/pith/CRITOTNT36JVMTLHQ3KTM654GS/action/replication_record"}},"created_at":"2026-05-18T00:20:46.343374+00:00","updated_at":"2026-05-18T00:20:46.343374+00:00"}