{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7VBLRP3LC42KFFQ45VMLTOPWOK","short_pith_number":"pith:7VBLRP3L","schema_version":"1.0","canonical_sha256":"fd42b8bf6b1734a2961ced58b9b9f672b66c443fa4f07eacb42777ae9043d62e","source":{"kind":"arxiv","id":"1203.4393","version":4},"attestation_state":"computed","paper":{"title":"Minimum Number of k-Cliques in Graphs with Bounded Independence Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emil R. Vaughan, Oleg Pikhurko","submitted_at":"2012-03-20T11:11:40Z","abstract_excerpt":"Erdos asked in 1962 about the value of f(n,k,l), the minimum number of k-cliques in a graph of order n and independence number less than l. The case (k,l)=(3,3) was solved by Lorden. Here we solve the problem (for all large n) when (k,l) is (3,4), (3,5), (3,6), (3,7), (4,3), (5,3), (6,3), and (7,3). Independently, Das, Huang, Ma, Naves, and Sudakov did the cases (k,l)=(3,4) and (4,3)."},"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":"1203.4393","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-20T11:11:40Z","cross_cats_sorted":[],"title_canon_sha256":"08726b9eeb93110e5e87c0ffea4d42c0421e5280419d242b8ecb433bc3b33267","abstract_canon_sha256":"0a0d2029221c11400d9b2ca5e55c3176becd2b2ffb3e998781d808ff24e93aa0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:16.942618Z","signature_b64":"VJhhhJo5Ux/Ka/JAke5bZ5N3a3rO1LSYC4tHxhVodvsED6KNEk89GSfN82uT5XY0J36lt9TN4PYZ2jUvMWqHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd42b8bf6b1734a2961ced58b9b9f672b66c443fa4f07eacb42777ae9043d62e","last_reissued_at":"2026-05-18T02:21:16.942092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:16.942092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Number of k-Cliques in Graphs with Bounded Independence Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emil R. Vaughan, Oleg Pikhurko","submitted_at":"2012-03-20T11:11:40Z","abstract_excerpt":"Erdos asked in 1962 about the value of f(n,k,l), the minimum number of k-cliques in a graph of order n and independence number less than l. The case (k,l)=(3,3) was solved by Lorden. Here we solve the problem (for all large n) when (k,l) is (3,4), (3,5), (3,6), (3,7), (4,3), (5,3), (6,3), and (7,3). Independently, Das, Huang, Ma, Naves, and Sudakov did the cases (k,l)=(3,4) and (4,3)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4393","kind":"arxiv","version":4},"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":"1203.4393","created_at":"2026-05-18T02:21:16.942165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.4393v4","created_at":"2026-05-18T02:21:16.942165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4393","created_at":"2026-05-18T02:21:16.942165+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VBLRP3LC42K","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VBLRP3LC42KFFQ4","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VBLRP3L","created_at":"2026-05-18T12:26:58.693483+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/7VBLRP3LC42KFFQ45VMLTOPWOK","json":"https://pith.science/pith/7VBLRP3LC42KFFQ45VMLTOPWOK.json","graph_json":"https://pith.science/api/pith-number/7VBLRP3LC42KFFQ45VMLTOPWOK/graph.json","events_json":"https://pith.science/api/pith-number/7VBLRP3LC42KFFQ45VMLTOPWOK/events.json","paper":"https://pith.science/paper/7VBLRP3L"},"agent_actions":{"view_html":"https://pith.science/pith/7VBLRP3LC42KFFQ45VMLTOPWOK","download_json":"https://pith.science/pith/7VBLRP3LC42KFFQ45VMLTOPWOK.json","view_paper":"https://pith.science/paper/7VBLRP3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.4393&json=true","fetch_graph":"https://pith.science/api/pith-number/7VBLRP3LC42KFFQ45VMLTOPWOK/graph.json","fetch_events":"https://pith.science/api/pith-number/7VBLRP3LC42KFFQ45VMLTOPWOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VBLRP3LC42KFFQ45VMLTOPWOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VBLRP3LC42KFFQ45VMLTOPWOK/action/storage_attestation","attest_author":"https://pith.science/pith/7VBLRP3LC42KFFQ45VMLTOPWOK/action/author_attestation","sign_citation":"https://pith.science/pith/7VBLRP3LC42KFFQ45VMLTOPWOK/action/citation_signature","submit_replication":"https://pith.science/pith/7VBLRP3LC42KFFQ45VMLTOPWOK/action/replication_record"}},"created_at":"2026-05-18T02:21:16.942165+00:00","updated_at":"2026-05-18T02:21:16.942165+00:00"}