{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:7HHYZYGIDG2JZUMZUUB34NKRRH","short_pith_number":"pith:7HHYZYGI","canonical_record":{"source":{"id":"2410.06449","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-09T01:13:35Z","cross_cats_sorted":[],"title_canon_sha256":"cea5c590dfdd8a472a60a1eb5e36c4c9b9ad979b4b2baffa50c8cc1bfdb96171","abstract_canon_sha256":"9635cf2fbcfe1313e10c1a809314db2c361eac233a9cad81eac79b51c77eee44"},"schema_version":"1.0"},"canonical_sha256":"f9cf8ce0c819b49cd199a503be355189eaf0d1d917f3feb452588e42acf2a345","source":{"kind":"arxiv","id":"2410.06449","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.06449","created_at":"2026-07-05T09:47:56Z"},{"alias_kind":"arxiv_version","alias_value":"2410.06449v3","created_at":"2026-07-05T09:47:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06449","created_at":"2026-07-05T09:47:56Z"},{"alias_kind":"pith_short_12","alias_value":"7HHYZYGIDG2J","created_at":"2026-07-05T09:47:56Z"},{"alias_kind":"pith_short_16","alias_value":"7HHYZYGIDG2JZUMZ","created_at":"2026-07-05T09:47:56Z"},{"alias_kind":"pith_short_8","alias_value":"7HHYZYGI","created_at":"2026-07-05T09:47:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:7HHYZYGIDG2JZUMZUUB34NKRRH","target":"record","payload":{"canonical_record":{"source":{"id":"2410.06449","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-09T01:13:35Z","cross_cats_sorted":[],"title_canon_sha256":"cea5c590dfdd8a472a60a1eb5e36c4c9b9ad979b4b2baffa50c8cc1bfdb96171","abstract_canon_sha256":"9635cf2fbcfe1313e10c1a809314db2c361eac233a9cad81eac79b51c77eee44"},"schema_version":"1.0"},"canonical_sha256":"f9cf8ce0c819b49cd199a503be355189eaf0d1d917f3feb452588e42acf2a345","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:56.908466Z","signature_b64":"9NKGUBERnqo7nD9ZbmKucVga14oRcfevD8SNOpznGu8FW5MZeU4+I79yXbHHQHVynrHjH/CcoaKF5ayzfKaQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9cf8ce0c819b49cd199a503be355189eaf0d1d917f3feb452588e42acf2a345","last_reissued_at":"2026-07-05T09:47:56.907986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:56.907986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.06449","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-07-05T09:47:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZcswHKAazLTr5/1O2YbAzxui6KjtKfaD9mJm9ldAccASmMgdWZhuMOPW/2AChS6iua2fimxcPdYqiQN5iWsOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T03:11:30.179280Z"},"content_sha256":"15c377d7e703164ed7927519273b73ae02606aadd7a4355b675aa48fe2fd8b07","schema_version":"1.0","event_id":"sha256:15c377d7e703164ed7927519273b73ae02606aadd7a4355b675aa48fe2fd8b07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:7HHYZYGIDG2JZUMZUUB34NKRRH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The number of edges in graphs with bounded clique number and circumference","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Ning, Chunyang Dou, Xing Peng","submitted_at":"2024-10-09T01:13:35Z","abstract_excerpt":"Let $\\cal H$ be a family of graphs. The Tur\\'an number ${\\rm ex}(n,{\\cal H})$ is the maximum possible number of edges in an $n$-vertex graph which does not contain any member of $\\cal H$ as a subgraph. As a common generalization of Tur\\'an's theorem and Erd\\H{o}s-Gallai theorem on the Tur\\'an number of matchings, Alon and Frankl determined ${\\rm ex}(n,{\\cal H})$ for ${\\cal H}=\\{K_r,M_k\\}$, where $M_k$ is a matching of size $k$. Replacing $M_k$ by $P_k$, Katona and Xiao obtained the Tur\\'an number of ${\\cal H}=\\{K_r,P_k\\}$ for $r \\leq \\lfloor k/2 \\rfloor$ and sufficiently large $n$. In addition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06449","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.06449/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-05T09:47:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cdlYcwCLdwwtz24YbUG+tArhFg+bDPQik5VvuizZ3aJZ76uwczBxR9hvKy5CzaELDcMJTc/kegwMRgTKeDw3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T03:11:30.179803Z"},"content_sha256":"e079e80cca3b60e10e08a8ea9efe38b7d0d1a0dbabcca688b857ae59cf1bf1b4","schema_version":"1.0","event_id":"sha256:e079e80cca3b60e10e08a8ea9efe38b7d0d1a0dbabcca688b857ae59cf1bf1b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HHYZYGIDG2JZUMZUUB34NKRRH/bundle.json","state_url":"https://pith.science/pith/7HHYZYGIDG2JZUMZUUB34NKRRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HHYZYGIDG2JZUMZUUB34NKRRH/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-14T03:11:30Z","links":{"resolver":"https://pith.science/pith/7HHYZYGIDG2JZUMZUUB34NKRRH","bundle":"https://pith.science/pith/7HHYZYGIDG2JZUMZUUB34NKRRH/bundle.json","state":"https://pith.science/pith/7HHYZYGIDG2JZUMZUUB34NKRRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HHYZYGIDG2JZUMZUUB34NKRRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7HHYZYGIDG2JZUMZUUB34NKRRH","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":"9635cf2fbcfe1313e10c1a809314db2c361eac233a9cad81eac79b51c77eee44","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-09T01:13:35Z","title_canon_sha256":"cea5c590dfdd8a472a60a1eb5e36c4c9b9ad979b4b2baffa50c8cc1bfdb96171"},"schema_version":"1.0","source":{"id":"2410.06449","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.06449","created_at":"2026-07-05T09:47:56Z"},{"alias_kind":"arxiv_version","alias_value":"2410.06449v3","created_at":"2026-07-05T09:47:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06449","created_at":"2026-07-05T09:47:56Z"},{"alias_kind":"pith_short_12","alias_value":"7HHYZYGIDG2J","created_at":"2026-07-05T09:47:56Z"},{"alias_kind":"pith_short_16","alias_value":"7HHYZYGIDG2JZUMZ","created_at":"2026-07-05T09:47:56Z"},{"alias_kind":"pith_short_8","alias_value":"7HHYZYGI","created_at":"2026-07-05T09:47:56Z"}],"graph_snapshots":[{"event_id":"sha256:e079e80cca3b60e10e08a8ea9efe38b7d0d1a0dbabcca688b857ae59cf1bf1b4","target":"graph","created_at":"2026-07-05T09:47:56Z","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/2410.06449/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\cal H$ be a family of graphs. The Tur\\'an number ${\\rm ex}(n,{\\cal H})$ is the maximum possible number of edges in an $n$-vertex graph which does not contain any member of $\\cal H$ as a subgraph. As a common generalization of Tur\\'an's theorem and Erd\\H{o}s-Gallai theorem on the Tur\\'an number of matchings, Alon and Frankl determined ${\\rm ex}(n,{\\cal H})$ for ${\\cal H}=\\{K_r,M_k\\}$, where $M_k$ is a matching of size $k$. Replacing $M_k$ by $P_k$, Katona and Xiao obtained the Tur\\'an number of ${\\cal H}=\\{K_r,P_k\\}$ for $r \\leq \\lfloor k/2 \\rfloor$ and sufficiently large $n$. In addition","authors_text":"Bo Ning, Chunyang Dou, Xing Peng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-09T01:13:35Z","title":"The number of edges in graphs with bounded clique number and circumference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06449","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:15c377d7e703164ed7927519273b73ae02606aadd7a4355b675aa48fe2fd8b07","target":"record","created_at":"2026-07-05T09:47:56Z","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":"9635cf2fbcfe1313e10c1a809314db2c361eac233a9cad81eac79b51c77eee44","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-09T01:13:35Z","title_canon_sha256":"cea5c590dfdd8a472a60a1eb5e36c4c9b9ad979b4b2baffa50c8cc1bfdb96171"},"schema_version":"1.0","source":{"id":"2410.06449","kind":"arxiv","version":3}},"canonical_sha256":"f9cf8ce0c819b49cd199a503be355189eaf0d1d917f3feb452588e42acf2a345","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9cf8ce0c819b49cd199a503be355189eaf0d1d917f3feb452588e42acf2a345","first_computed_at":"2026-07-05T09:47:56.907986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:47:56.907986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9NKGUBERnqo7nD9ZbmKucVga14oRcfevD8SNOpznGu8FW5MZeU4+I79yXbHHQHVynrHjH/CcoaKF5ayzfKaQBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:47:56.908466Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.06449","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15c377d7e703164ed7927519273b73ae02606aadd7a4355b675aa48fe2fd8b07","sha256:e079e80cca3b60e10e08a8ea9efe38b7d0d1a0dbabcca688b857ae59cf1bf1b4"],"state_sha256":"a7846fef93cef1cf0f36e63108d2595b90cc443628f13fc7626a52dc041453a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OrFh2PRqr4uaj0lQVtfiyyAWXA+rAkcnz2x50pdg4FuQpSexnO5aRxd6bxWL9+DMHzwfJT6Le09cn7WwuA3IDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T03:11:30.185333Z","bundle_sha256":"560221370610c692963c2cbc182165510c532b9f7419a4b6868c1b975b1b7a6c"}}