{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LEIMW2PRX3L3NHXY2TXB5RK5EP","short_pith_number":"pith:LEIMW2PR","schema_version":"1.0","canonical_sha256":"5910cb69f1bed7b69ef8d4ee1ec55d23e2f3d36304aa88b453c60248f7202113","source":{"kind":"arxiv","id":"1212.2454","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.2454","created_at":"2026-05-18T01:01:36.379037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.2454v2","created_at":"2026-05-18T01:01:36.379037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2454","created_at":"2026-05-18T01:01:36.379037+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEIMW2PRX3L3","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEIMW2PRX3L3NHXY","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEIMW2PR","created_at":"2026-05-18T12:27:14.488303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP","json":"https://pith.science/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP.json","graph_json":"https://pith.science/api/pith-number/LEIMW2PRX3L3NHXY2TXB5RK5EP/graph.json","events_json":"https://pith.science/api/pith-number/LEIMW2PRX3L3NHXY2TXB5RK5EP/events.json","paper":"https://pith.science/paper/LEIMW2PR"},"agent_actions":{"view_html":"https://pith.science/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP","download_json":"https://pith.science/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP.json","view_paper":"https://pith.science/paper/LEIMW2PR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.2454&json=true","fetch_graph":"https://pith.science/api/pith-number/LEIMW2PRX3L3NHXY2TXB5RK5EP/graph.json","fetch_events":"https://pith.science/api/pith-number/LEIMW2PRX3L3NHXY2TXB5RK5EP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP/action/storage_attestation","attest_author":"https://pith.science/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP/action/author_attestation","sign_citation":"https://pith.science/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP/action/citation_signature","submit_replication":"https://pith.science/pith/LEIMW2PRX3L3NHXY2TXB5RK5EP/action/replication_record"}},"created_at":"2026-05-18T01:01:36.379037+00:00","updated_at":"2026-05-18T01:01:36.379037+00:00"}