{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WQNYFKNDMCM7SCO3EQKI7LM3GB","short_pith_number":"pith:WQNYFKND","canonical_record":{"source":{"id":"2605.17945","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T07:02:59Z","cross_cats_sorted":[],"title_canon_sha256":"3aa18d8639c842c9115817c990e0a0c5a981bb7ca569348f721da4a1fda24e81","abstract_canon_sha256":"2a80b537045664db02250900dd1f481146d85064a4f6b98448b93d453a263298"},"schema_version":"1.0"},"canonical_sha256":"b41b82a9a36099f909db24148fad9b30560e2967c1b7093ea9a65b7a5c403523","source":{"kind":"arxiv","id":"2605.17945","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17945","created_at":"2026-05-20T00:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17945v1","created_at":"2026-05-20T00:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17945","created_at":"2026-05-20T00:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"WQNYFKNDMCM7","created_at":"2026-05-20T00:05:07Z"},{"alias_kind":"pith_short_16","alias_value":"WQNYFKNDMCM7SCO3","created_at":"2026-05-20T00:05:07Z"},{"alias_kind":"pith_short_8","alias_value":"WQNYFKND","created_at":"2026-05-20T00:05:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WQNYFKNDMCM7SCO3EQKI7LM3GB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17945","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T07:02:59Z","cross_cats_sorted":[],"title_canon_sha256":"3aa18d8639c842c9115817c990e0a0c5a981bb7ca569348f721da4a1fda24e81","abstract_canon_sha256":"2a80b537045664db02250900dd1f481146d85064a4f6b98448b93d453a263298"},"schema_version":"1.0"},"canonical_sha256":"b41b82a9a36099f909db24148fad9b30560e2967c1b7093ea9a65b7a5c403523","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:07.334156Z","signature_b64":"Ro5bFwlGMabvJibAI+LkgAax1tOwxgz0ayTM9+4GZtvATKnnOMgb6iGevF/7Rj/TR3eHU44xT2mQ2yKfYLKvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b41b82a9a36099f909db24148fad9b30560e2967c1b7093ea9a65b7a5c403523","last_reissued_at":"2026-05-20T00:05:07.333331Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:07.333331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17945","source_version":1,"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-20T00:05:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3GKdxlhqjyJj6JqlszrkCprZuA/B/tfZJx/qkx77NtLRyZXooUiI2GKnm9Lu/q4SXUgF16nNEhSvCde/ri/UAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:37:47.388094Z"},"content_sha256":"bc19df86ed2556f914021278dd7c17de9023c1df17cfb2167e6694d2e84a24dd","schema_version":"1.0","event_id":"sha256:bc19df86ed2556f914021278dd7c17de9023c1df17cfb2167e6694d2e84a24dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WQNYFKNDMCM7SCO3EQKI7LM3GB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Note on the codegree version of the Erd\\H{o}s--Ko--Rado theorem","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han, Luyining Gan, Seonghyuk Im","submitted_at":"2026-05-18T07:02:59Z","abstract_excerpt":"Kupavskii proved a codegree version of the Erd\\H{o}s--Ko--Rado theorem by showing that for an intersecting family $\\mathcal{F} \\subseteq \\binom{[n]}{k}$ with $n \\geq 2k +3d/(1-d/k)$, the minimum $d$-degree of $\\mathcal{F}$ is at most $\\binom{n-d-1}{k-d-1}$. Huang and Zhang improved the bound on $n$ to $n \\geq 2k+2d-3$. In this short note, we prove that if $d = k-1$, then the bound on $n$ can be improved to $2k + \\sqrt{2k} + O(1)$. In addition, we extend our method to show that the bound on $n$ can be improved to $2k + 7k^{2/3}+O(k^{1/3})$ when $d=k-2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17945","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17945/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.603973Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"34c712aefc660c2a2070767f10fd67508e8c809dc79a5b28693bf38a435ff8c3"},"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-20T00:05:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w86EKoc4AWpaB0ub+XZPK1khdhB0Rv9JEkSaLArX2QQ5xlRprkf1wpBfq9viWzjjMgGOLXHT9359Q1Mr+AfADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:37:47.388495Z"},"content_sha256":"01abbbe2ad9afe34faf48fe84268e8961a57b41762230964bc44a132cf9af82a","schema_version":"1.0","event_id":"sha256:01abbbe2ad9afe34faf48fe84268e8961a57b41762230964bc44a132cf9af82a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQNYFKNDMCM7SCO3EQKI7LM3GB/bundle.json","state_url":"https://pith.science/pith/WQNYFKNDMCM7SCO3EQKI7LM3GB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQNYFKNDMCM7SCO3EQKI7LM3GB/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-04T20:37:47Z","links":{"resolver":"https://pith.science/pith/WQNYFKNDMCM7SCO3EQKI7LM3GB","bundle":"https://pith.science/pith/WQNYFKNDMCM7SCO3EQKI7LM3GB/bundle.json","state":"https://pith.science/pith/WQNYFKNDMCM7SCO3EQKI7LM3GB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQNYFKNDMCM7SCO3EQKI7LM3GB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WQNYFKNDMCM7SCO3EQKI7LM3GB","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":"2a80b537045664db02250900dd1f481146d85064a4f6b98448b93d453a263298","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T07:02:59Z","title_canon_sha256":"3aa18d8639c842c9115817c990e0a0c5a981bb7ca569348f721da4a1fda24e81"},"schema_version":"1.0","source":{"id":"2605.17945","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17945","created_at":"2026-05-20T00:05:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17945v1","created_at":"2026-05-20T00:05:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17945","created_at":"2026-05-20T00:05:07Z"},{"alias_kind":"pith_short_12","alias_value":"WQNYFKNDMCM7","created_at":"2026-05-20T00:05:07Z"},{"alias_kind":"pith_short_16","alias_value":"WQNYFKNDMCM7SCO3","created_at":"2026-05-20T00:05:07Z"},{"alias_kind":"pith_short_8","alias_value":"WQNYFKND","created_at":"2026-05-20T00:05:07Z"}],"graph_snapshots":[{"event_id":"sha256:01abbbe2ad9afe34faf48fe84268e8961a57b41762230964bc44a132cf9af82a","target":"graph","created_at":"2026-05-20T00:05:07Z","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":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T23:33:35.603973Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17945/integrity.json","findings":[],"snapshot_sha256":"34c712aefc660c2a2070767f10fd67508e8c809dc79a5b28693bf38a435ff8c3","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Kupavskii proved a codegree version of the Erd\\H{o}s--Ko--Rado theorem by showing that for an intersecting family $\\mathcal{F} \\subseteq \\binom{[n]}{k}$ with $n \\geq 2k +3d/(1-d/k)$, the minimum $d$-degree of $\\mathcal{F}$ is at most $\\binom{n-d-1}{k-d-1}$. Huang and Zhang improved the bound on $n$ to $n \\geq 2k+2d-3$. In this short note, we prove that if $d = k-1$, then the bound on $n$ can be improved to $2k + \\sqrt{2k} + O(1)$. In addition, we extend our method to show that the bound on $n$ can be improved to $2k + 7k^{2/3}+O(k^{1/3})$ when $d=k-2$.","authors_text":"Jie Han, Luyining Gan, Seonghyuk Im","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T07:02:59Z","title":"Note on the codegree version of the Erd\\H{o}s--Ko--Rado theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.17945","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:bc19df86ed2556f914021278dd7c17de9023c1df17cfb2167e6694d2e84a24dd","target":"record","created_at":"2026-05-20T00:05:07Z","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":"2a80b537045664db02250900dd1f481146d85064a4f6b98448b93d453a263298","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T07:02:59Z","title_canon_sha256":"3aa18d8639c842c9115817c990e0a0c5a981bb7ca569348f721da4a1fda24e81"},"schema_version":"1.0","source":{"id":"2605.17945","kind":"arxiv","version":1}},"canonical_sha256":"b41b82a9a36099f909db24148fad9b30560e2967c1b7093ea9a65b7a5c403523","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b41b82a9a36099f909db24148fad9b30560e2967c1b7093ea9a65b7a5c403523","first_computed_at":"2026-05-20T00:05:07.333331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:05:07.333331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ro5bFwlGMabvJibAI+LkgAax1tOwxgz0ayTM9+4GZtvATKnnOMgb6iGevF/7Rj/TR3eHU44xT2mQ2yKfYLKvCg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:05:07.334156Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17945","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc19df86ed2556f914021278dd7c17de9023c1df17cfb2167e6694d2e84a24dd","sha256:01abbbe2ad9afe34faf48fe84268e8961a57b41762230964bc44a132cf9af82a"],"state_sha256":"500b93310743ab3721de3bc3d833a1942adb7b7b229097177ee339249057f32e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQt4qfpYtFor0jyWVXNAegxmRXsSR4OU5DY6OZDR8H+igmTLcPu61b8kKbEtSg7f6NMed2VykDX1pc1Y72GnDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:37:47.390579Z","bundle_sha256":"8758b60201977c9f2c954bd5bd742a091e74fb727b66ccb86d97712b2074d584"}}