{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:5C3JEDPRWOZUOH3U23O4T7VT36","short_pith_number":"pith:5C3JEDPR","schema_version":"1.0","canonical_sha256":"e8b6920df1b3b3471f74d6ddc9feb3df8b68e518d4bb6daecd29c5f7e9848625","source":{"kind":"arxiv","id":"0906.4142","version":3},"attestation_state":"computed","paper":{"title":"The maximum number of cliques in a graph embedded in a surface","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Ga\\v{s}per Fijav\\v{z}, Gwena\\\"el Joret, Thom Sulanke, Vida Dujmovi\\'c","submitted_at":"2009-06-22T23:01:30Z","abstract_excerpt":"This paper studies the following question: Given a surface $\\Sigma$ and an integer $n$, what is the maximum number of cliques in an $n$-vertex graph embeddable in $\\Sigma$? We characterise the extremal graphs for this question, and prove that the answer is between $8(n-\\omega)+2^{\\omega}$ and $8n+{3/2} 2^{\\omega}+o(2^{\\omega})$, where $\\omega$ is the maximum integer such that the complete graph $K_\\omega$ embeds in $\\Sigma$. For the surfaces $\\mathbb{S}_0$, $\\mathbb{S}_1$, $\\mathbb{S}_2$, $\\mathbb{N}_1$, $\\mathbb{N}_2$, $\\mathbb{N}_3$ and $\\mathbb{N}_4$ we establish an exact answer."},"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":"0906.4142","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-06-22T23:01:30Z","cross_cats_sorted":[],"title_canon_sha256":"cf72326965341d214aadcae3b0cf3c8466fc59ba0e96d9318b1ffb503c1a5c3f","abstract_canon_sha256":"f7d0c18837a73e6924a6c403b80901249a3433f1e4870106c2e270e83ff43814"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:43.897796Z","signature_b64":"6MHSQOTl7eQwbSkV0Fc0EaGrflzWrIEom82kdeJ1GdgYvREsj2GJSgWgnLwSpusnT/2T73+1FKM6lLQyYnWPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8b6920df1b3b3471f74d6ddc9feb3df8b68e518d4bb6daecd29c5f7e9848625","last_reissued_at":"2026-05-18T04:03:43.897159Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:43.897159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The maximum number of cliques in a graph embedded in a surface","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Ga\\v{s}per Fijav\\v{z}, Gwena\\\"el Joret, Thom Sulanke, Vida Dujmovi\\'c","submitted_at":"2009-06-22T23:01:30Z","abstract_excerpt":"This paper studies the following question: Given a surface $\\Sigma$ and an integer $n$, what is the maximum number of cliques in an $n$-vertex graph embeddable in $\\Sigma$? We characterise the extremal graphs for this question, and prove that the answer is between $8(n-\\omega)+2^{\\omega}$ and $8n+{3/2} 2^{\\omega}+o(2^{\\omega})$, where $\\omega$ is the maximum integer such that the complete graph $K_\\omega$ embeds in $\\Sigma$. For the surfaces $\\mathbb{S}_0$, $\\mathbb{S}_1$, $\\mathbb{S}_2$, $\\mathbb{N}_1$, $\\mathbb{N}_2$, $\\mathbb{N}_3$ and $\\mathbb{N}_4$ we establish an exact answer."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.4142","kind":"arxiv","version":3},"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":"0906.4142","created_at":"2026-05-18T04:03:43.897247+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.4142v3","created_at":"2026-05-18T04:03:43.897247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.4142","created_at":"2026-05-18T04:03:43.897247+00:00"},{"alias_kind":"pith_short_12","alias_value":"5C3JEDPRWOZU","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"5C3JEDPRWOZUOH3U","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"5C3JEDPR","created_at":"2026-05-18T12:25:58.837520+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/5C3JEDPRWOZUOH3U23O4T7VT36","json":"https://pith.science/pith/5C3JEDPRWOZUOH3U23O4T7VT36.json","graph_json":"https://pith.science/api/pith-number/5C3JEDPRWOZUOH3U23O4T7VT36/graph.json","events_json":"https://pith.science/api/pith-number/5C3JEDPRWOZUOH3U23O4T7VT36/events.json","paper":"https://pith.science/paper/5C3JEDPR"},"agent_actions":{"view_html":"https://pith.science/pith/5C3JEDPRWOZUOH3U23O4T7VT36","download_json":"https://pith.science/pith/5C3JEDPRWOZUOH3U23O4T7VT36.json","view_paper":"https://pith.science/paper/5C3JEDPR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.4142&json=true","fetch_graph":"https://pith.science/api/pith-number/5C3JEDPRWOZUOH3U23O4T7VT36/graph.json","fetch_events":"https://pith.science/api/pith-number/5C3JEDPRWOZUOH3U23O4T7VT36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5C3JEDPRWOZUOH3U23O4T7VT36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5C3JEDPRWOZUOH3U23O4T7VT36/action/storage_attestation","attest_author":"https://pith.science/pith/5C3JEDPRWOZUOH3U23O4T7VT36/action/author_attestation","sign_citation":"https://pith.science/pith/5C3JEDPRWOZUOH3U23O4T7VT36/action/citation_signature","submit_replication":"https://pith.science/pith/5C3JEDPRWOZUOH3U23O4T7VT36/action/replication_record"}},"created_at":"2026-05-18T04:03:43.897247+00:00","updated_at":"2026-05-18T04:03:43.897247+00:00"}