{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:G6V4MQULN76GCWHJ3F27ESVHQI","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":"08006084c48b32f0ef149b55faac41ebf82acb4f8de046966c3f47e0442c00fa","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-18T22:39:06Z","title_canon_sha256":"6f1b62a8ece5113d024fe456f69f717440c47bdebb2588a6cee6cea7a262de79"},"schema_version":"1.0","source":{"id":"2004.08718","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.08718","created_at":"2026-07-05T00:56:08Z"},{"alias_kind":"arxiv_version","alias_value":"2004.08718v1","created_at":"2026-07-05T00:56:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08718","created_at":"2026-07-05T00:56:08Z"},{"alias_kind":"pith_short_12","alias_value":"G6V4MQULN76G","created_at":"2026-07-05T00:56:08Z"},{"alias_kind":"pith_short_16","alias_value":"G6V4MQULN76GCWHJ","created_at":"2026-07-05T00:56:08Z"},{"alias_kind":"pith_short_8","alias_value":"G6V4MQUL","created_at":"2026-07-05T00:56:08Z"}],"graph_snapshots":[{"event_id":"sha256:89fa12cd47925c218b2c0cb9e74df0abbbb985be494ef2b0530c6bb8aa267bb3","target":"graph","created_at":"2026-07-05T00:56:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2004.08718/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the maximum degree in non-empty induced subgraphs of the Kneser graph $KG(n,k)$. One of the main results asserts that, for $k>k_0$ and $n>64k^2$, whenever a non-empty subgraph has $m\\ge k{n-2\\choose k-2}$ vertices, its maximum degree is at least $\\frac 12(1-\\frac {k^2}n) m - {n-2\\choose k-2}\\ge 0.49 m$. This bound is essentially best possible. One of the intermediate steps is to obtain structural results on non-empty subgraphs with small maximum degree.","authors_text":"Andrey Kupavskii, Peter Frankl","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-18T22:39:06Z","title":"Maximal degrees in subgraphs of Kneser graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08718","kind":"arxiv","version":1},"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:77acaae1e33765ed9ad2c66dce485aa0d90d0c68fbda80a465fbde2a2bdf2c4b","target":"record","created_at":"2026-07-05T00:56:08Z","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":"08006084c48b32f0ef149b55faac41ebf82acb4f8de046966c3f47e0442c00fa","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-18T22:39:06Z","title_canon_sha256":"6f1b62a8ece5113d024fe456f69f717440c47bdebb2588a6cee6cea7a262de79"},"schema_version":"1.0","source":{"id":"2004.08718","kind":"arxiv","version":1}},"canonical_sha256":"37abc6428b6ffc6158e9d975f24aa7821e53d0bfbdfc0945ba13f88d8605cc0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37abc6428b6ffc6158e9d975f24aa7821e53d0bfbdfc0945ba13f88d8605cc0a","first_computed_at":"2026-07-05T00:56:08.772669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:56:08.772669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hjzlAep0nb1+1x6wpIO8iV/aa7Wyjvx+l29zxLtnmQNp6nr18OBAYwRGOT08w8EsOKsFasSBBSFaVTWiOEydBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:56:08.773048Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.08718","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77acaae1e33765ed9ad2c66dce485aa0d90d0c68fbda80a465fbde2a2bdf2c4b","sha256:89fa12cd47925c218b2c0cb9e74df0abbbb985be494ef2b0530c6bb8aa267bb3"],"state_sha256":"feb2db0cc541cc783b1cb2ac2c0f7b2facd7c6b3d9bf78154eb5c4abf936bdc6"}