{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CRITOTNT36JVMTLHQ3KTM654GS","short_pith_number":"pith:CRITOTNT","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"},"canonical_sha256":"1451374db3df93564d6786d5367bbc349549aee33801da1992664537431859a0","source":{"kind":"arxiv","id":"1801.03972","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03972","created_at":"2026-05-18T00:20:46Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03972v2","created_at":"2026-05-18T00:20:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03972","created_at":"2026-05-18T00:20:46Z"},{"alias_kind":"pith_short_12","alias_value":"CRITOTNT36JV","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CRITOTNT36JVMTLH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CRITOTNT","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CRITOTNT36JVMTLHQ3KTM654GS","target":"record","payload":{"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"},"canonical_sha256":"1451374db3df93564d6786d5367bbc349549aee33801da1992664537431859a0","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"},"source_kind":"arxiv","source_id":"1801.03972","source_version":2,"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-18T00:20:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+2o4dv/sKDaBUes0loGsAIBLWY0FSKufjJhID1woKXfFXHa5/VMiCuKAcwsxE+nGLfXR+kPqlbZBp5EBBG24CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:15:08.015267Z"},"content_sha256":"5d95b7a3b184e316bbb0305034dcfe823ac65454c5e57bedbda49023a9816c48","schema_version":"1.0","event_id":"sha256:5d95b7a3b184e316bbb0305034dcfe823ac65454c5e57bedbda49023a9816c48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CRITOTNT36JVMTLHQ3KTM654GS","target":"graph","payload":{"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"},"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-18T00:20:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4CLxPPJOgXHtHFnJTuyjbK/A0BkV6ZYUJjDG/6MSwfOwhwgFoqR7vnRsRyVRK+g6MUdfyXGHabI5dbDM+9g7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:15:08.015649Z"},"content_sha256":"117c1b4d5bcc57ad6c2cd4d1be35214611f2dac66c3d2378f079cb5ac2080a6a","schema_version":"1.0","event_id":"sha256:117c1b4d5bcc57ad6c2cd4d1be35214611f2dac66c3d2378f079cb5ac2080a6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CRITOTNT36JVMTLHQ3KTM654GS/bundle.json","state_url":"https://pith.science/pith/CRITOTNT36JVMTLHQ3KTM654GS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CRITOTNT36JVMTLHQ3KTM654GS/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-06-02T13:15:08Z","links":{"resolver":"https://pith.science/pith/CRITOTNT36JVMTLHQ3KTM654GS","bundle":"https://pith.science/pith/CRITOTNT36JVMTLHQ3KTM654GS/bundle.json","state":"https://pith.science/pith/CRITOTNT36JVMTLHQ3KTM654GS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CRITOTNT36JVMTLHQ3KTM654GS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CRITOTNT36JVMTLHQ3KTM654GS","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":"8b4f5c4842d093ea6f2684de8454a3261f71836c2593927e99b11e5f7056b6c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-11T20:06:30Z","title_canon_sha256":"afac57435d82ff0396e0c4d8b4fc509de74d12c497a4b7ebb096d13b57bac58c"},"schema_version":"1.0","source":{"id":"1801.03972","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03972","created_at":"2026-05-18T00:20:46Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03972v2","created_at":"2026-05-18T00:20:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03972","created_at":"2026-05-18T00:20:46Z"},{"alias_kind":"pith_short_12","alias_value":"CRITOTNT36JV","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CRITOTNT36JVMTLH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CRITOTNT","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:117c1b4d5bcc57ad6c2cd4d1be35214611f2dac66c3d2378f079cb5ac2080a6a","target":"graph","created_at":"2026-05-18T00:20:46Z","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 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]","authors_text":"Ali Taherkhani, Meysam Alishahi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-11T20:06:30Z","title":"Extremal $G$-free induced subgraphs of Kneser graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03972","kind":"arxiv","version":2},"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:5d95b7a3b184e316bbb0305034dcfe823ac65454c5e57bedbda49023a9816c48","target":"record","created_at":"2026-05-18T00:20:46Z","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":"8b4f5c4842d093ea6f2684de8454a3261f71836c2593927e99b11e5f7056b6c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-11T20:06:30Z","title_canon_sha256":"afac57435d82ff0396e0c4d8b4fc509de74d12c497a4b7ebb096d13b57bac58c"},"schema_version":"1.0","source":{"id":"1801.03972","kind":"arxiv","version":2}},"canonical_sha256":"1451374db3df93564d6786d5367bbc349549aee33801da1992664537431859a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1451374db3df93564d6786d5367bbc349549aee33801da1992664537431859a0","first_computed_at":"2026-05-18T00:20:46.343296Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:46.343296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DhQpnTeQ7kz6pWqNVC/y/kchMWx7naSgHa80hL3D1ndBVrGyzOxATrXX/iQoGN3FCo3znM8YGReNFroFNvITDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:46.343744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03972","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d95b7a3b184e316bbb0305034dcfe823ac65454c5e57bedbda49023a9816c48","sha256:117c1b4d5bcc57ad6c2cd4d1be35214611f2dac66c3d2378f079cb5ac2080a6a"],"state_sha256":"fb4e720cbc0e27980ade25a460c200a0ee42e455ad25306fa754276889f177c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/81w/FdUUiBuFbimH6r+a/+tdIG+39/DkyCoW15tkDsYQMcA/lFyCuuX4CmFFD4zLVN1Z40ZfTAZLGQJklefAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:15:08.017971Z","bundle_sha256":"223aefde7bf72ae0166e4130fb9350d2524b71394cdb17e788bf6f4004290a01"}}