{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:LEIMW2PRX3L3NHXY2TXB5RK5EP","short_pith_number":"pith:LEIMW2PR","canonical_record":{"source":{"id":"1212.2454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-11T16:14:44Z","cross_cats_sorted":[],"title_canon_sha256":"304e196e4638ca7899c62664d118db3196a8e8f9fc4799ecca42a1a1b70b07ac","abstract_canon_sha256":"d6e0de726759a84c840d5fd93ebb83beaf0f44c0201dd4422683c7a39a7629b9"},"schema_version":"1.0"},"canonical_sha256":"5910cb69f1bed7b69ef8d4ee1ec55d23e2f3d36304aa88b453c60248f7202113","source":{"kind":"arxiv","id":"1212.2454","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2454","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2454v2","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2454","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"LEIMW2PRX3L3","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LEIMW2PRX3L3NHXY","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LEIMW2PR","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:LEIMW2PRX3L3NHXY2TXB5RK5EP","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2454","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-11T16:14:44Z","cross_cats_sorted":[],"title_canon_sha256":"304e196e4638ca7899c62664d118db3196a8e8f9fc4799ecca42a1a1b70b07ac","abstract_canon_sha256":"d6e0de726759a84c840d5fd93ebb83beaf0f44c0201dd4422683c7a39a7629b9"},"schema_version":"1.0"},"canonical_sha256":"5910cb69f1bed7b69ef8d4ee1ec55d23e2f3d36304aa88b453c60248f7202113","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:36.379528Z","signature_b64":"j5b2AeML766N4y5S5cBv7cJOOwjczqtIYw3jiaynOF13NdNaYaWpvRnQISSUzrQggbKumuZIiWboIdDC1hfuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5910cb69f1bed7b69ef8d4ee1ec55d23e2f3d36304aa88b453c60248f7202113","last_reissued_at":"2026-05-18T01:01:36.378943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:36.378943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2454","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-18T01:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UE7Eb/1efyXlj4HGyojtsgiMYfzI5+anvKNCMZ3JeFB0WQLaQvMJ2Kcz4WbLh/QsS9IQ8ID0dJz9q1XClRvgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:23:52.949474Z"},"content_sha256":"e016711c828a079c4f787d19d8176fbad2a1c2fdb4eef89430608eab4a2371d9","schema_version":"1.0","event_id":"sha256:e016711c828a079c4f787d19d8176fbad2a1c2fdb4eef89430608eab4a2371d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:LEIMW2PRX3L3NHXY2TXB5RK5EP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Clique Density Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian Reiher","submitted_at":"2012-12-11T16:14:44Z","abstract_excerpt":"Tur\\'{a}n's theorem is a cornerstone of extremal graph theory. It asserts that for any integer $r \\geq 2$ every graph on $n$ vertices with more than ${\\tfrac{r-2}{2(r-1)}\\cdot n^2}$ edges contains a clique of size $r$, i.e., $r$ mutually adjacent vertices. The corresponding extremal graphs are balanced $(r-1)$-partite graphs.\n  The question as to how many such $r$-cliques appear at least in any $n$-vertex graph with $\\gamma n^2$ edges has been intensively studied in the literature. In particular, Lov\\'{a}sz and Simonovits conjectured in the 1970s that asymptotically the best possible lower bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2454","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-18T01:01:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1UKHpMEDau1wAsOKht0mtp9enPVIPYkfeuhjFXNThBkZAfzmUEfCi87FsVijQyF2f0gkcxOv366rno7IhPsaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:23:52.950174Z"},"content_sha256":"fdd48619a0955e8c0e94d921b31b262b2a77392ebd481c90d0b8b524b9a661ed","schema_version":"1.0","event_id":"sha256:fdd48619a0955e8c0e94d921b31b262b2a77392ebd481c90d0b8b524b9a661ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP/bundle.json","state_url":"https://pith.science/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP/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-09T04:23:52Z","links":{"resolver":"https://pith.science/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP","bundle":"https://pith.science/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP/bundle.json","state":"https://pith.science/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LEIMW2PRX3L3NHXY2TXB5RK5EP","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":"d6e0de726759a84c840d5fd93ebb83beaf0f44c0201dd4422683c7a39a7629b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-11T16:14:44Z","title_canon_sha256":"304e196e4638ca7899c62664d118db3196a8e8f9fc4799ecca42a1a1b70b07ac"},"schema_version":"1.0","source":{"id":"1212.2454","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2454","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2454v2","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2454","created_at":"2026-05-18T01:01:36Z"},{"alias_kind":"pith_short_12","alias_value":"LEIMW2PRX3L3","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LEIMW2PRX3L3NHXY","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LEIMW2PR","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:fdd48619a0955e8c0e94d921b31b262b2a77392ebd481c90d0b8b524b9a661ed","target":"graph","created_at":"2026-05-18T01:01:36Z","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":"Tur\\'{a}n's theorem is a cornerstone of extremal graph theory. It asserts that for any integer $r \\geq 2$ every graph on $n$ vertices with more than ${\\tfrac{r-2}{2(r-1)}\\cdot n^2}$ edges contains a clique of size $r$, i.e., $r$ mutually adjacent vertices. The corresponding extremal graphs are balanced $(r-1)$-partite graphs.\n  The question as to how many such $r$-cliques appear at least in any $n$-vertex graph with $\\gamma n^2$ edges has been intensively studied in the literature. In particular, Lov\\'{a}sz and Simonovits conjectured in the 1970s that asymptotically the best possible lower bou","authors_text":"Christian Reiher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-11T16:14:44Z","title":"The Clique Density Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2454","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:e016711c828a079c4f787d19d8176fbad2a1c2fdb4eef89430608eab4a2371d9","target":"record","created_at":"2026-05-18T01:01:36Z","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":"d6e0de726759a84c840d5fd93ebb83beaf0f44c0201dd4422683c7a39a7629b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-11T16:14:44Z","title_canon_sha256":"304e196e4638ca7899c62664d118db3196a8e8f9fc4799ecca42a1a1b70b07ac"},"schema_version":"1.0","source":{"id":"1212.2454","kind":"arxiv","version":2}},"canonical_sha256":"5910cb69f1bed7b69ef8d4ee1ec55d23e2f3d36304aa88b453c60248f7202113","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5910cb69f1bed7b69ef8d4ee1ec55d23e2f3d36304aa88b453c60248f7202113","first_computed_at":"2026-05-18T01:01:36.378943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:36.378943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j5b2AeML766N4y5S5cBv7cJOOwjczqtIYw3jiaynOF13NdNaYaWpvRnQISSUzrQggbKumuZIiWboIdDC1hfuBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:36.379528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2454","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e016711c828a079c4f787d19d8176fbad2a1c2fdb4eef89430608eab4a2371d9","sha256:fdd48619a0955e8c0e94d921b31b262b2a77392ebd481c90d0b8b524b9a661ed"],"state_sha256":"50f8f83fe54cb6671f5066e52757bdc71f7161effb5cdf6f6ad3057c617735d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VKfQ6xhc/YzaZjFfuKoBXzcmAxeLPIhlxAtuBsqwUPpcU5H9x/88PcJimk3PgGA6DYa/YJM495eVPRyNVUkkCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:23:52.954597Z","bundle_sha256":"276016777ed27dd087ed0042df0deda7ba2864f499b91fe5405241602b9b1afc"}}