{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:5C3JEDPRWOZUOH3U23O4T7VT36","short_pith_number":"pith:5C3JEDPR","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"},"canonical_sha256":"e8b6920df1b3b3471f74d6ddc9feb3df8b68e518d4bb6daecd29c5f7e9848625","source":{"kind":"arxiv","id":"0906.4142","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.4142","created_at":"2026-05-18T04:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"0906.4142v3","created_at":"2026-05-18T04:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.4142","created_at":"2026-05-18T04:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"5C3JEDPRWOZU","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"5C3JEDPRWOZUOH3U","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"5C3JEDPR","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:5C3JEDPRWOZUOH3U23O4T7VT36","target":"record","payload":{"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"},"canonical_sha256":"e8b6920df1b3b3471f74d6ddc9feb3df8b68e518d4bb6daecd29c5f7e9848625","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"},"source_kind":"arxiv","source_id":"0906.4142","source_version":3,"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-18T04:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2fYSWTH7ecVPnjTsGSJ9Uwa1wz4/i6q4qMwLq9QsXZx4DGLjnoItucUuR4k7dvOwF5cgZSj4/Kcr4tiX0LKHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:54:34.021554Z"},"content_sha256":"59f0d001250a1b5943e16acc383300d21430f736dcceae5ed27917de1883ec25","schema_version":"1.0","event_id":"sha256:59f0d001250a1b5943e16acc383300d21430f736dcceae5ed27917de1883ec25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:5C3JEDPRWOZUOH3U23O4T7VT36","target":"graph","payload":{"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"},"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-18T04:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a4a1G1ZO2eaX9XHpCNvfIRyGvE20lJ4SlXi7SCkAU7VNz01Yrt9/tvYuA32G0NpYZu4+LXnFmIprkBbo2VtUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:54:34.021990Z"},"content_sha256":"02b04aa3038d6d9bfc9c9c91a314d7a00386a4cc447bcf0660cdeee04bef1649","schema_version":"1.0","event_id":"sha256:02b04aa3038d6d9bfc9c9c91a314d7a00386a4cc447bcf0660cdeee04bef1649"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5C3JEDPRWOZUOH3U23O4T7VT36/bundle.json","state_url":"https://pith.science/pith/5C3JEDPRWOZUOH3U23O4T7VT36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5C3JEDPRWOZUOH3U23O4T7VT36/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-27T02:54:34Z","links":{"resolver":"https://pith.science/pith/5C3JEDPRWOZUOH3U23O4T7VT36","bundle":"https://pith.science/pith/5C3JEDPRWOZUOH3U23O4T7VT36/bundle.json","state":"https://pith.science/pith/5C3JEDPRWOZUOH3U23O4T7VT36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5C3JEDPRWOZUOH3U23O4T7VT36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:5C3JEDPRWOZUOH3U23O4T7VT36","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":"f7d0c18837a73e6924a6c403b80901249a3433f1e4870106c2e270e83ff43814","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-06-22T23:01:30Z","title_canon_sha256":"cf72326965341d214aadcae3b0cf3c8466fc59ba0e96d9318b1ffb503c1a5c3f"},"schema_version":"1.0","source":{"id":"0906.4142","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.4142","created_at":"2026-05-18T04:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"0906.4142v3","created_at":"2026-05-18T04:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.4142","created_at":"2026-05-18T04:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"5C3JEDPRWOZU","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"5C3JEDPRWOZUOH3U","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"5C3JEDPR","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:02b04aa3038d6d9bfc9c9c91a314d7a00386a4cc447bcf0660cdeee04bef1649","target":"graph","created_at":"2026-05-18T04:03:43Z","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":"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.","authors_text":"David R. Wood, Ga\\v{s}per Fijav\\v{z}, Gwena\\\"el Joret, Thom Sulanke, Vida Dujmovi\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-06-22T23:01:30Z","title":"The maximum number of cliques in a graph embedded in a surface"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.4142","kind":"arxiv","version":3},"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:59f0d001250a1b5943e16acc383300d21430f736dcceae5ed27917de1883ec25","target":"record","created_at":"2026-05-18T04:03:43Z","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":"f7d0c18837a73e6924a6c403b80901249a3433f1e4870106c2e270e83ff43814","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-06-22T23:01:30Z","title_canon_sha256":"cf72326965341d214aadcae3b0cf3c8466fc59ba0e96d9318b1ffb503c1a5c3f"},"schema_version":"1.0","source":{"id":"0906.4142","kind":"arxiv","version":3}},"canonical_sha256":"e8b6920df1b3b3471f74d6ddc9feb3df8b68e518d4bb6daecd29c5f7e9848625","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8b6920df1b3b3471f74d6ddc9feb3df8b68e518d4bb6daecd29c5f7e9848625","first_computed_at":"2026-05-18T04:03:43.897159Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:43.897159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6MHSQOTl7eQwbSkV0Fc0EaGrflzWrIEom82kdeJ1GdgYvREsj2GJSgWgnLwSpusnT/2T73+1FKM6lLQyYnWPDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:43.897796Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.4142","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59f0d001250a1b5943e16acc383300d21430f736dcceae5ed27917de1883ec25","sha256:02b04aa3038d6d9bfc9c9c91a314d7a00386a4cc447bcf0660cdeee04bef1649"],"state_sha256":"2bda930afa7019df59d1a2463fb72b0c9ae1bb3a045a62687831fe628b2e87ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qddY2DfTfzaDSiTsNSvEGOGDnIFGSVfqK16MefCQfH8hSnnkcmXH0+UdwkTyR6GdAotzS+JcENICMrQlxzbRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:54:34.025008Z","bundle_sha256":"504a83aab958172873edba310ea83d60d26812fe452086dcaf60e9b7ed4800f4"}}