{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XP6PFPWZXDHKSNISOFWDKWKA2T","short_pith_number":"pith:XP6PFPWZ","canonical_record":{"source":{"id":"2507.11860","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-16T03:12:10Z","cross_cats_sorted":[],"title_canon_sha256":"883cc813f9fb4075a9329f2e99d6496d36b6207fe81b586ff76280b80c0aae16","abstract_canon_sha256":"1de547658c494a290b35a25b756d7ef3a3cd82851e8cc62c3f0e616068d6d9ca"},"schema_version":"1.0"},"canonical_sha256":"bbfcf2bed9b8cea93512716c355940d4e801fb72e21f810b547a4507e4f007d8","source":{"kind":"arxiv","id":"2507.11860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11860","created_at":"2026-07-05T11:37:52Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11860v1","created_at":"2026-07-05T11:37:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11860","created_at":"2026-07-05T11:37:52Z"},{"alias_kind":"pith_short_12","alias_value":"XP6PFPWZXDHK","created_at":"2026-07-05T11:37:52Z"},{"alias_kind":"pith_short_16","alias_value":"XP6PFPWZXDHKSNIS","created_at":"2026-07-05T11:37:52Z"},{"alias_kind":"pith_short_8","alias_value":"XP6PFPWZ","created_at":"2026-07-05T11:37:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XP6PFPWZXDHKSNISOFWDKWKA2T","target":"record","payload":{"canonical_record":{"source":{"id":"2507.11860","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-16T03:12:10Z","cross_cats_sorted":[],"title_canon_sha256":"883cc813f9fb4075a9329f2e99d6496d36b6207fe81b586ff76280b80c0aae16","abstract_canon_sha256":"1de547658c494a290b35a25b756d7ef3a3cd82851e8cc62c3f0e616068d6d9ca"},"schema_version":"1.0"},"canonical_sha256":"bbfcf2bed9b8cea93512716c355940d4e801fb72e21f810b547a4507e4f007d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:52.298408Z","signature_b64":"Yw+5/N+/Lb6cJiq9/EK8shPPDvSq4O4MG07pBTvBdB33gbyBGFITwZvdegVljS8wKm5M5bmnvHQRFdyUTlvuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbfcf2bed9b8cea93512716c355940d4e801fb72e21f810b547a4507e4f007d8","last_reissued_at":"2026-07-05T11:37:52.297861Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:52.297861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.11860","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:37:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ym5p5ROW8Ok/sgiwSraekywhbL52wASaDg/iPr55xC44x2DZxPZ1DsPKW3xLO0JU+jMxYHMdhohDaOmEQ2NyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T13:24:03.456661Z"},"content_sha256":"2789b0dd0153381a22cf9c2ad77ae6d46744985a27af8c6a9bdcf4511c6171bd","schema_version":"1.0","event_id":"sha256:2789b0dd0153381a22cf9c2ad77ae6d46744985a27af8c6a9bdcf4511c6171bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XP6PFPWZXDHKSNISOFWDKWKA2T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Planar Tur\\'an number of quasi-double stars","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huiqing Liu, Qin Zhao, Tian Xie","submitted_at":"2025-07-16T03:12:10Z","abstract_excerpt":"Given a graph H, we call a graph $\\textit{H-free}$ if it does not contain H as a subgraph. The planar Tur\\'an number of a graph H, denoted by $ex_{\\mathcal{P}}(n, H)$, is the maximum number of edges in a planar H-free graph on n vertices. A (h,k)-quasi-double star $W_{h,k}$, obtained from a path $P_3=v_1v_2v_3$ by adding h leaves and k leaves to the vertices $v_1$ and $v_3$, respectively, is a subclass of caterpillars. In this paper, we study $ex_{\\mathcal{P}}(n,W_{h,k})$ for all $1\\le h\\le 2\\le k\\le 5$, and obtain some tight bounds $ex_{\\mathcal{P}}(n,W_{h,k})\\leq\\frac{3(h+k)}{h+k+2}n$ for $3"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11860","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.11860/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:37:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f0bgv39BUHqnK9ikd4jeTReelw0UtLY8Za7Cglzfs6XOFn1TYympJ248aKE1NieDv0LPMTen3jJ897ZOXl+uAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T13:24:03.457030Z"},"content_sha256":"b4f52271993847dd18f3db61496e297c45a2815e68787acde418e7aa5f6d491b","schema_version":"1.0","event_id":"sha256:b4f52271993847dd18f3db61496e297c45a2815e68787acde418e7aa5f6d491b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XP6PFPWZXDHKSNISOFWDKWKA2T/bundle.json","state_url":"https://pith.science/pith/XP6PFPWZXDHKSNISOFWDKWKA2T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XP6PFPWZXDHKSNISOFWDKWKA2T/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-13T13:24:03Z","links":{"resolver":"https://pith.science/pith/XP6PFPWZXDHKSNISOFWDKWKA2T","bundle":"https://pith.science/pith/XP6PFPWZXDHKSNISOFWDKWKA2T/bundle.json","state":"https://pith.science/pith/XP6PFPWZXDHKSNISOFWDKWKA2T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XP6PFPWZXDHKSNISOFWDKWKA2T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XP6PFPWZXDHKSNISOFWDKWKA2T","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":"1de547658c494a290b35a25b756d7ef3a3cd82851e8cc62c3f0e616068d6d9ca","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-16T03:12:10Z","title_canon_sha256":"883cc813f9fb4075a9329f2e99d6496d36b6207fe81b586ff76280b80c0aae16"},"schema_version":"1.0","source":{"id":"2507.11860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11860","created_at":"2026-07-05T11:37:52Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11860v1","created_at":"2026-07-05T11:37:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11860","created_at":"2026-07-05T11:37:52Z"},{"alias_kind":"pith_short_12","alias_value":"XP6PFPWZXDHK","created_at":"2026-07-05T11:37:52Z"},{"alias_kind":"pith_short_16","alias_value":"XP6PFPWZXDHKSNIS","created_at":"2026-07-05T11:37:52Z"},{"alias_kind":"pith_short_8","alias_value":"XP6PFPWZ","created_at":"2026-07-05T11:37:52Z"}],"graph_snapshots":[{"event_id":"sha256:b4f52271993847dd18f3db61496e297c45a2815e68787acde418e7aa5f6d491b","target":"graph","created_at":"2026-07-05T11:37:52Z","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.11860/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph H, we call a graph $\\textit{H-free}$ if it does not contain H as a subgraph. The planar Tur\\'an number of a graph H, denoted by $ex_{\\mathcal{P}}(n, H)$, is the maximum number of edges in a planar H-free graph on n vertices. A (h,k)-quasi-double star $W_{h,k}$, obtained from a path $P_3=v_1v_2v_3$ by adding h leaves and k leaves to the vertices $v_1$ and $v_3$, respectively, is a subclass of caterpillars. In this paper, we study $ex_{\\mathcal{P}}(n,W_{h,k})$ for all $1\\le h\\le 2\\le k\\le 5$, and obtain some tight bounds $ex_{\\mathcal{P}}(n,W_{h,k})\\leq\\frac{3(h+k)}{h+k+2}n$ for $3","authors_text":"Huiqing Liu, Qin Zhao, Tian Xie","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-16T03:12:10Z","title":"Planar Tur\\'an number of quasi-double stars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11860","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:2789b0dd0153381a22cf9c2ad77ae6d46744985a27af8c6a9bdcf4511c6171bd","target":"record","created_at":"2026-07-05T11:37:52Z","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":"1de547658c494a290b35a25b756d7ef3a3cd82851e8cc62c3f0e616068d6d9ca","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-16T03:12:10Z","title_canon_sha256":"883cc813f9fb4075a9329f2e99d6496d36b6207fe81b586ff76280b80c0aae16"},"schema_version":"1.0","source":{"id":"2507.11860","kind":"arxiv","version":1}},"canonical_sha256":"bbfcf2bed9b8cea93512716c355940d4e801fb72e21f810b547a4507e4f007d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbfcf2bed9b8cea93512716c355940d4e801fb72e21f810b547a4507e4f007d8","first_computed_at":"2026-07-05T11:37:52.297861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:52.297861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yw+5/N+/Lb6cJiq9/EK8shPPDvSq4O4MG07pBTvBdB33gbyBGFITwZvdegVljS8wKm5M5bmnvHQRFdyUTlvuAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:52.298408Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.11860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2789b0dd0153381a22cf9c2ad77ae6d46744985a27af8c6a9bdcf4511c6171bd","sha256:b4f52271993847dd18f3db61496e297c45a2815e68787acde418e7aa5f6d491b"],"state_sha256":"4379a863815bd1a41d8b82ef37eabd3bd670e0df2ef0f5ed9e7b6ca4f5e37325"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jltIEMd3YR4SCBsJJ1mrEIH9Excn1BC6hpYljQ8AgUcBrq1ABIvC4o8FzqpTax+u4H6xylyfi5P+yGYiipOKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T13:24:03.459961Z","bundle_sha256":"1a257e8f2614714d0940d5476f0490b88af51c58ca4070468a84fdb49f0edfc9"}}