{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ANQB3I3NTXDJO56DWNY27HDZAP","short_pith_number":"pith:ANQB3I3N","canonical_record":{"source":{"id":"2507.16351","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-22T08:33:38Z","cross_cats_sorted":[],"title_canon_sha256":"d44d44b627d6084f2b506a3bb30a8678847606901463ad539b3a6191eb202b89","abstract_canon_sha256":"bea6cf8bb8bc5199b49d079646f8d3574a2ae53f82dff151cf5b3482fa3c5e25"},"schema_version":"1.0"},"canonical_sha256":"03601da36d9dc69777c3b371af9c7903f40d83e221e18336dee2e1ab796fc34a","source":{"kind":"arxiv","id":"2507.16351","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.16351","created_at":"2026-07-05T11:41:07Z"},{"alias_kind":"arxiv_version","alias_value":"2507.16351v1","created_at":"2026-07-05T11:41:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.16351","created_at":"2026-07-05T11:41:07Z"},{"alias_kind":"pith_short_12","alias_value":"ANQB3I3NTXDJ","created_at":"2026-07-05T11:41:07Z"},{"alias_kind":"pith_short_16","alias_value":"ANQB3I3NTXDJO56D","created_at":"2026-07-05T11:41:07Z"},{"alias_kind":"pith_short_8","alias_value":"ANQB3I3N","created_at":"2026-07-05T11:41:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ANQB3I3NTXDJO56DWNY27HDZAP","target":"record","payload":{"canonical_record":{"source":{"id":"2507.16351","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-22T08:33:38Z","cross_cats_sorted":[],"title_canon_sha256":"d44d44b627d6084f2b506a3bb30a8678847606901463ad539b3a6191eb202b89","abstract_canon_sha256":"bea6cf8bb8bc5199b49d079646f8d3574a2ae53f82dff151cf5b3482fa3c5e25"},"schema_version":"1.0"},"canonical_sha256":"03601da36d9dc69777c3b371af9c7903f40d83e221e18336dee2e1ab796fc34a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:41:07.913063Z","signature_b64":"Ira1IZc3mUr3xQwPjACx2S/aElo0OETrq5alRaIg2qLQErdf4YHr0EOMBpIoKmsjj9lTgIIMT5q/YcOQ/pt8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03601da36d9dc69777c3b371af9c7903f40d83e221e18336dee2e1ab796fc34a","last_reissued_at":"2026-07-05T11:41:07.912665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:41:07.912665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.16351","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-05T11:41:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odxnQvQ9Z+b/9WIxTueNRQnyGTScgIEkZQiaJFMoWRzd/9LfhdKTFX5RiisNbdc1yBZ1YUUrNZyI83pndrQuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:16:45.401322Z"},"content_sha256":"c0a4da6b6c738f1f93e8c485de90941de357992da3984856391e21ef8789042b","schema_version":"1.0","event_id":"sha256:c0a4da6b6c738f1f93e8c485de90941de357992da3984856391e21ef8789042b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ANQB3I3NTXDJO56DWNY27HDZAP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Planar Tur\\'an number of disjoint union of $C_3$ and $C_5$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guiying Yan, Luyi Li, Ping Li, Qiang Zhou","submitted_at":"2025-07-22T08:33:38Z","abstract_excerpt":"The planar Tur\\'an number of $H$, denoted by $ex_{\\mathcal{P}}(n,H)$, is the maximum number of edges in an $n$-vertex $H$-free planar graph. The planar Tur\\'an number of $k\\geq 3$ vertex-disjoint union of cycles is the trivial value $3n-6$. Let $C_{\\ell}$ denote the cycle of length $\\ell$ and $C_{\\ell}\\cup C_t$ denote the union of disjoint cycles $C_{\\ell}$ and $C_t$. The planar Tur\\'an number $ex_{\\mathcal{P}}(n,H)$ is known if $H=C_{\\ell}\\cup C_k$, where $\\ell,k\\in \\{3,4\\}$. In this paper, we determine the value $ex_{\\mathcal{P}}(n,C_3\\cup C_5)=\\lfloor\\frac{8n-13}{3}\\rfloor$ and characterize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.16351","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/2507.16351/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-05T11:41:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkP2SmW9yBgvXg8dOQ0R8G/xT5H1WwnBu8zWgtz8bKOq2e8176eybvV7fKUzDJ6wn0vq+MM2H4LacQEriU56Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:16:45.402227Z"},"content_sha256":"5863be651da61397e8d810935085f1c2dddbf6174cda7ab496c779b3f458bc2f","schema_version":"1.0","event_id":"sha256:5863be651da61397e8d810935085f1c2dddbf6174cda7ab496c779b3f458bc2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ANQB3I3NTXDJO56DWNY27HDZAP/bundle.json","state_url":"https://pith.science/pith/ANQB3I3NTXDJO56DWNY27HDZAP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ANQB3I3NTXDJO56DWNY27HDZAP/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-13T14:16:45Z","links":{"resolver":"https://pith.science/pith/ANQB3I3NTXDJO56DWNY27HDZAP","bundle":"https://pith.science/pith/ANQB3I3NTXDJO56DWNY27HDZAP/bundle.json","state":"https://pith.science/pith/ANQB3I3NTXDJO56DWNY27HDZAP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ANQB3I3NTXDJO56DWNY27HDZAP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ANQB3I3NTXDJO56DWNY27HDZAP","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":"bea6cf8bb8bc5199b49d079646f8d3574a2ae53f82dff151cf5b3482fa3c5e25","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-22T08:33:38Z","title_canon_sha256":"d44d44b627d6084f2b506a3bb30a8678847606901463ad539b3a6191eb202b89"},"schema_version":"1.0","source":{"id":"2507.16351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.16351","created_at":"2026-07-05T11:41:07Z"},{"alias_kind":"arxiv_version","alias_value":"2507.16351v1","created_at":"2026-07-05T11:41:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.16351","created_at":"2026-07-05T11:41:07Z"},{"alias_kind":"pith_short_12","alias_value":"ANQB3I3NTXDJ","created_at":"2026-07-05T11:41:07Z"},{"alias_kind":"pith_short_16","alias_value":"ANQB3I3NTXDJO56D","created_at":"2026-07-05T11:41:07Z"},{"alias_kind":"pith_short_8","alias_value":"ANQB3I3N","created_at":"2026-07-05T11:41:07Z"}],"graph_snapshots":[{"event_id":"sha256:5863be651da61397e8d810935085f1c2dddbf6174cda7ab496c779b3f458bc2f","target":"graph","created_at":"2026-07-05T11:41: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/2507.16351/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The planar Tur\\'an number of $H$, denoted by $ex_{\\mathcal{P}}(n,H)$, is the maximum number of edges in an $n$-vertex $H$-free planar graph. The planar Tur\\'an number of $k\\geq 3$ vertex-disjoint union of cycles is the trivial value $3n-6$. Let $C_{\\ell}$ denote the cycle of length $\\ell$ and $C_{\\ell}\\cup C_t$ denote the union of disjoint cycles $C_{\\ell}$ and $C_t$. The planar Tur\\'an number $ex_{\\mathcal{P}}(n,H)$ is known if $H=C_{\\ell}\\cup C_k$, where $\\ell,k\\in \\{3,4\\}$. In this paper, we determine the value $ex_{\\mathcal{P}}(n,C_3\\cup C_5)=\\lfloor\\frac{8n-13}{3}\\rfloor$ and characterize","authors_text":"Guiying Yan, Luyi Li, Ping Li, Qiang Zhou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-22T08:33:38Z","title":"Planar Tur\\'an number of disjoint union of $C_3$ and $C_5$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.16351","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:c0a4da6b6c738f1f93e8c485de90941de357992da3984856391e21ef8789042b","target":"record","created_at":"2026-07-05T11:41: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":"bea6cf8bb8bc5199b49d079646f8d3574a2ae53f82dff151cf5b3482fa3c5e25","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-22T08:33:38Z","title_canon_sha256":"d44d44b627d6084f2b506a3bb30a8678847606901463ad539b3a6191eb202b89"},"schema_version":"1.0","source":{"id":"2507.16351","kind":"arxiv","version":1}},"canonical_sha256":"03601da36d9dc69777c3b371af9c7903f40d83e221e18336dee2e1ab796fc34a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03601da36d9dc69777c3b371af9c7903f40d83e221e18336dee2e1ab796fc34a","first_computed_at":"2026-07-05T11:41:07.912665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:41:07.912665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ira1IZc3mUr3xQwPjACx2S/aElo0OETrq5alRaIg2qLQErdf4YHr0EOMBpIoKmsjj9lTgIIMT5q/YcOQ/pt8CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:41:07.913063Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.16351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0a4da6b6c738f1f93e8c485de90941de357992da3984856391e21ef8789042b","sha256:5863be651da61397e8d810935085f1c2dddbf6174cda7ab496c779b3f458bc2f"],"state_sha256":"f027ff668b5501d6e6805d8abfa3befbb63e604d546d22a5efaf4e40b2b6b00e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eaSweSreK5GR+UBlLBFk7rYLJMMo+PdyUZEfTLSZhfcUYqkzQy6aLD1BeGyAuz5Ls2aAf/09SuizGoCPJXbzCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T14:16:45.420587Z","bundle_sha256":"63a4fc0158f36042b5f11f532001814826908adb5e1d57207da1dec71b1d99ec"}}