{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AQXEXSORN5JZFLEOPNFS6GOKIO","short_pith_number":"pith:AQXEXSOR","canonical_record":{"source":{"id":"1211.4532","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-19T18:44:35Z","cross_cats_sorted":[],"title_canon_sha256":"9a387e4433c2de4b37b1fc6c63852c69ed2e01cf1b0ebd4a8d082f6a6bd8b2e0","abstract_canon_sha256":"441acaa83acfc3c4d36e1e88615788dba9c28097f010ff28a9894b3755b88716"},"schema_version":"1.0"},"canonical_sha256":"042e4bc9d16f5392ac8e7b4b2f19ca43897b5dd727a55c8f201d85a5b158928e","source":{"kind":"arxiv","id":"1211.4532","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4532","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4532v2","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4532","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"AQXEXSORN5JZ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AQXEXSORN5JZFLEO","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AQXEXSOR","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AQXEXSORN5JZFLEOPNFS6GOKIO","target":"record","payload":{"canonical_record":{"source":{"id":"1211.4532","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-19T18:44:35Z","cross_cats_sorted":[],"title_canon_sha256":"9a387e4433c2de4b37b1fc6c63852c69ed2e01cf1b0ebd4a8d082f6a6bd8b2e0","abstract_canon_sha256":"441acaa83acfc3c4d36e1e88615788dba9c28097f010ff28a9894b3755b88716"},"schema_version":"1.0"},"canonical_sha256":"042e4bc9d16f5392ac8e7b4b2f19ca43897b5dd727a55c8f201d85a5b158928e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:18.761673Z","signature_b64":"DWi0KdMo0DddEz+lZzAzc2XKTt/h/pgrVc9qvJxsx3YgoRqTPYtZwLe+fa6J09EXH+otFZClATiZaF5OSIyrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"042e4bc9d16f5392ac8e7b4b2f19ca43897b5dd727a55c8f201d85a5b158928e","last_reissued_at":"2026-05-18T03:05:18.761249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:18.761249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.4532","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-18T03:05:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7KdPDql3UwlrrtER4A9007Fq/nruJMTtfX46tLPVyWEUEvoDckiR2Hkrk7aYRhpV7LUY3b1fucRyqE6a2i1PCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:36:19.314869Z"},"content_sha256":"f886769dbfd8c005cb5840f15221ee38f687782eefe1aad718923e23108ec96d","schema_version":"1.0","event_id":"sha256:f886769dbfd8c005cb5840f15221ee38f687782eefe1aad718923e23108ec96d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AQXEXSORN5JZFLEOPNFS6GOKIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the densities of cliques and independent sets in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Hao Huang, Humberto Naves, Nati Linial, Yuval Peled","submitted_at":"2012-11-19T18:44:35Z","abstract_excerpt":"Let r, s >= 2 be integers. Suppose that the number of blue r-cliques in a red/blue coloring of the edges of the complete graph K_n is known and fixed. What is the largest possible number of red s-cliques under this assumption? The well known Kruskal-Katona theorem answers this question for r=2 or s=2. Using the shifting technique from extremal set theory together with some analytical arguments, we resolve this problem in general and prove that in the extremal coloring either the blue edges or the red edges form a clique."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4532","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-18T03:05:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZgI+9oIZAkQskh6x3y++M+VGGTYFloBkG0gbAytTQYJUmGjIHxjlVt7iMvCIcoJp88mOT7WmsLb9mb4mn8QCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:36:19.315223Z"},"content_sha256":"7c4fd584632151ca802f5554ae4004d92de6cd61c22896ff72d75553c08e3613","schema_version":"1.0","event_id":"sha256:7c4fd584632151ca802f5554ae4004d92de6cd61c22896ff72d75553c08e3613"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AQXEXSORN5JZFLEOPNFS6GOKIO/bundle.json","state_url":"https://pith.science/pith/AQXEXSORN5JZFLEOPNFS6GOKIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AQXEXSORN5JZFLEOPNFS6GOKIO/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-30T06:36:19Z","links":{"resolver":"https://pith.science/pith/AQXEXSORN5JZFLEOPNFS6GOKIO","bundle":"https://pith.science/pith/AQXEXSORN5JZFLEOPNFS6GOKIO/bundle.json","state":"https://pith.science/pith/AQXEXSORN5JZFLEOPNFS6GOKIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AQXEXSORN5JZFLEOPNFS6GOKIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AQXEXSORN5JZFLEOPNFS6GOKIO","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":"441acaa83acfc3c4d36e1e88615788dba9c28097f010ff28a9894b3755b88716","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-19T18:44:35Z","title_canon_sha256":"9a387e4433c2de4b37b1fc6c63852c69ed2e01cf1b0ebd4a8d082f6a6bd8b2e0"},"schema_version":"1.0","source":{"id":"1211.4532","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4532","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4532v2","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4532","created_at":"2026-05-18T03:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"AQXEXSORN5JZ","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AQXEXSORN5JZFLEO","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AQXEXSOR","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:7c4fd584632151ca802f5554ae4004d92de6cd61c22896ff72d75553c08e3613","target":"graph","created_at":"2026-05-18T03:05:18Z","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":"Let r, s >= 2 be integers. Suppose that the number of blue r-cliques in a red/blue coloring of the edges of the complete graph K_n is known and fixed. What is the largest possible number of red s-cliques under this assumption? The well known Kruskal-Katona theorem answers this question for r=2 or s=2. Using the shifting technique from extremal set theory together with some analytical arguments, we resolve this problem in general and prove that in the extremal coloring either the blue edges or the red edges form a clique.","authors_text":"Benny Sudakov, Hao Huang, Humberto Naves, Nati Linial, Yuval Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-19T18:44:35Z","title":"On the densities of cliques and independent sets in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4532","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:f886769dbfd8c005cb5840f15221ee38f687782eefe1aad718923e23108ec96d","target":"record","created_at":"2026-05-18T03:05:18Z","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":"441acaa83acfc3c4d36e1e88615788dba9c28097f010ff28a9894b3755b88716","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-19T18:44:35Z","title_canon_sha256":"9a387e4433c2de4b37b1fc6c63852c69ed2e01cf1b0ebd4a8d082f6a6bd8b2e0"},"schema_version":"1.0","source":{"id":"1211.4532","kind":"arxiv","version":2}},"canonical_sha256":"042e4bc9d16f5392ac8e7b4b2f19ca43897b5dd727a55c8f201d85a5b158928e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"042e4bc9d16f5392ac8e7b4b2f19ca43897b5dd727a55c8f201d85a5b158928e","first_computed_at":"2026-05-18T03:05:18.761249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:18.761249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DWi0KdMo0DddEz+lZzAzc2XKTt/h/pgrVc9qvJxsx3YgoRqTPYtZwLe+fa6J09EXH+otFZClATiZaF5OSIyrCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:18.761673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.4532","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f886769dbfd8c005cb5840f15221ee38f687782eefe1aad718923e23108ec96d","sha256:7c4fd584632151ca802f5554ae4004d92de6cd61c22896ff72d75553c08e3613"],"state_sha256":"1ff442b64ef3b5857f3c4c321efe895647cbc47266c44d79e1f59acbac068625"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mFxGkcythI6uibOG2EFtBWSeK9k4xDlUdeOwGSasE12zWTjFuJFk/01ZQcIY3dlOfH7lOVzZYvjknAH9JVt4AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:36:19.317397Z","bundle_sha256":"8b22a036bf31a7f87725168ab5a30fdb9367658b2c344268dd0cc646ebcd8e5f"}}