{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:3WUGWICVIFS3PJKZQKD5OPNVG4","short_pith_number":"pith:3WUGWICV","canonical_record":{"source":{"id":"2211.07913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-15T05:34:46Z","cross_cats_sorted":[],"title_canon_sha256":"f0d082e07986c610dfed8102a8e04c039da9214555ae1874624715f107b3bb0f","abstract_canon_sha256":"3dc1450ad910126d53a6e0fcb71d5029b5e3da3418d62593b50b12c603d6f729"},"schema_version":"1.0"},"canonical_sha256":"dda86b20554165b7a5598287d73db5371310ad50d7a92f8b58df81c45800ad78","source":{"kind":"arxiv","id":"2211.07913","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.07913","created_at":"2026-07-05T05:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"2211.07913v1","created_at":"2026-07-05T05:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.07913","created_at":"2026-07-05T05:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"3WUGWICVIFS3","created_at":"2026-07-05T05:16:07Z"},{"alias_kind":"pith_short_16","alias_value":"3WUGWICVIFS3PJKZ","created_at":"2026-07-05T05:16:07Z"},{"alias_kind":"pith_short_8","alias_value":"3WUGWICV","created_at":"2026-07-05T05:16:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:3WUGWICVIFS3PJKZQKD5OPNVG4","target":"record","payload":{"canonical_record":{"source":{"id":"2211.07913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-15T05:34:46Z","cross_cats_sorted":[],"title_canon_sha256":"f0d082e07986c610dfed8102a8e04c039da9214555ae1874624715f107b3bb0f","abstract_canon_sha256":"3dc1450ad910126d53a6e0fcb71d5029b5e3da3418d62593b50b12c603d6f729"},"schema_version":"1.0"},"canonical_sha256":"dda86b20554165b7a5598287d73db5371310ad50d7a92f8b58df81c45800ad78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:16:07.796897Z","signature_b64":"s9Pv8H9xFX5izUJempzBuRSYRRkBXmhEn/W9R2MTxXn0iXB32wimnw8YjLcDTtUpD0XE+hId3eZqPaRpLdiSAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dda86b20554165b7a5598287d73db5371310ad50d7a92f8b58df81c45800ad78","last_reissued_at":"2026-07-05T05:16:07.796446Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:16:07.796446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.07913","source_version":1,"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-07-05T05:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3BVgK2Klboz6ypQ6khDi46sdkSbY2/0UGOP3fkknIudx77l69c07SnfBzAPhsjLauJOwEH5MJEgESgsoaG/kAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:31:29.885042Z"},"content_sha256":"639628be186fdd2926a779ca580f74bc1b3c5b008eee29c02181c06ce9d4ef70","schema_version":"1.0","event_id":"sha256:639628be186fdd2926a779ca580f74bc1b3c5b008eee29c02181c06ce9d4ef70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:3WUGWICVIFS3PJKZQKD5OPNVG4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal graphs for the suspension of edge-critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heng Li, Jianfeng Hou, Qinghou Zeng","submitted_at":"2022-11-15T05:34:46Z","abstract_excerpt":"The Tur\\'{a}n number of a graph $H$, $\\text{ex}(n,H)$, is the maximum number of edges in an $n$-vertex graph that does not contain $H$ as a subgraph. For a vertex $v$ and a multi-set $\\mathcal{F}$ of graphs, the suspension $\\mathcal{F}+v$ of $\\mathcal{F}$ is the graph obtained by connecting the vertex $v$ to all vertices of $F$ for each $F\\in \\mathcal{F}$. For two integers $k\\ge1$ and $r\\ge2$, let $H_i$ be a graph containing a critical edge with chromatic number $r$ for any $i\\in\\{1,\\ldots,k\\}$, and let $H=\\{H_1,\\ldots,H_k\\}+v$. In this paper, we determine $\\text{ex}(n, H)$ and characterize al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.07913","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2211.07913/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:16:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5H3HZcyTFdGG0OPYi8LOWSL4M1DxFLUA/py0cSAtIQqKu/LDXSsNTCjlnIpnorjmHqVcUeY8mJht7g1itg75Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:31:29.885555Z"},"content_sha256":"a563b60983c151ccf344bae37bd2f5a8f528993bb2af86073f4ef3ad2c25a345","schema_version":"1.0","event_id":"sha256:a563b60983c151ccf344bae37bd2f5a8f528993bb2af86073f4ef3ad2c25a345"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3WUGWICVIFS3PJKZQKD5OPNVG4/bundle.json","state_url":"https://pith.science/pith/3WUGWICVIFS3PJKZQKD5OPNVG4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3WUGWICVIFS3PJKZQKD5OPNVG4/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-08-03T17:31:29Z","links":{"resolver":"https://pith.science/pith/3WUGWICVIFS3PJKZQKD5OPNVG4","bundle":"https://pith.science/pith/3WUGWICVIFS3PJKZQKD5OPNVG4/bundle.json","state":"https://pith.science/pith/3WUGWICVIFS3PJKZQKD5OPNVG4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3WUGWICVIFS3PJKZQKD5OPNVG4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:3WUGWICVIFS3PJKZQKD5OPNVG4","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":"3dc1450ad910126d53a6e0fcb71d5029b5e3da3418d62593b50b12c603d6f729","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-15T05:34:46Z","title_canon_sha256":"f0d082e07986c610dfed8102a8e04c039da9214555ae1874624715f107b3bb0f"},"schema_version":"1.0","source":{"id":"2211.07913","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.07913","created_at":"2026-07-05T05:16:07Z"},{"alias_kind":"arxiv_version","alias_value":"2211.07913v1","created_at":"2026-07-05T05:16:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.07913","created_at":"2026-07-05T05:16:07Z"},{"alias_kind":"pith_short_12","alias_value":"3WUGWICVIFS3","created_at":"2026-07-05T05:16:07Z"},{"alias_kind":"pith_short_16","alias_value":"3WUGWICVIFS3PJKZ","created_at":"2026-07-05T05:16:07Z"},{"alias_kind":"pith_short_8","alias_value":"3WUGWICV","created_at":"2026-07-05T05:16:07Z"}],"graph_snapshots":[{"event_id":"sha256:a563b60983c151ccf344bae37bd2f5a8f528993bb2af86073f4ef3ad2c25a345","target":"graph","created_at":"2026-07-05T05:16:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.07913/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Tur\\'{a}n number of a graph $H$, $\\text{ex}(n,H)$, is the maximum number of edges in an $n$-vertex graph that does not contain $H$ as a subgraph. For a vertex $v$ and a multi-set $\\mathcal{F}$ of graphs, the suspension $\\mathcal{F}+v$ of $\\mathcal{F}$ is the graph obtained by connecting the vertex $v$ to all vertices of $F$ for each $F\\in \\mathcal{F}$. For two integers $k\\ge1$ and $r\\ge2$, let $H_i$ be a graph containing a critical edge with chromatic number $r$ for any $i\\in\\{1,\\ldots,k\\}$, and let $H=\\{H_1,\\ldots,H_k\\}+v$. In this paper, we determine $\\text{ex}(n, H)$ and characterize al","authors_text":"Heng Li, Jianfeng Hou, Qinghou Zeng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-15T05:34:46Z","title":"Extremal graphs for the suspension of edge-critical graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.07913","kind":"arxiv","version":1},"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:639628be186fdd2926a779ca580f74bc1b3c5b008eee29c02181c06ce9d4ef70","target":"record","created_at":"2026-07-05T05:16:07Z","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":"3dc1450ad910126d53a6e0fcb71d5029b5e3da3418d62593b50b12c603d6f729","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-11-15T05:34:46Z","title_canon_sha256":"f0d082e07986c610dfed8102a8e04c039da9214555ae1874624715f107b3bb0f"},"schema_version":"1.0","source":{"id":"2211.07913","kind":"arxiv","version":1}},"canonical_sha256":"dda86b20554165b7a5598287d73db5371310ad50d7a92f8b58df81c45800ad78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dda86b20554165b7a5598287d73db5371310ad50d7a92f8b58df81c45800ad78","first_computed_at":"2026-07-05T05:16:07.796446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:16:07.796446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s9Pv8H9xFX5izUJempzBuRSYRRkBXmhEn/W9R2MTxXn0iXB32wimnw8YjLcDTtUpD0XE+hId3eZqPaRpLdiSAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:16:07.796897Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.07913","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:639628be186fdd2926a779ca580f74bc1b3c5b008eee29c02181c06ce9d4ef70","sha256:a563b60983c151ccf344bae37bd2f5a8f528993bb2af86073f4ef3ad2c25a345"],"state_sha256":"86ac70715876eff872c0373fcc2a64027be368250102fdf60feb5d20dc0e17bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mLqJ8nr1h9pcUxpv//0o1+rDypYWuDUiMgwyesQbj/XPyS5LdHnq/STpeD3neKQd3uqknb4YIQ987FKJDyEADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:31:29.890358Z","bundle_sha256":"bbf5c229c9bc8ef1b2b4d8c347f81b3bf9b45fc98fb7806fc5d4875f3c1085a6"}}