{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XP6PFPWZXDHKSNISOFWDKWKA2T","short_pith_number":"pith:XP6PFPWZ","schema_version":"1.0","canonical_sha256":"bbfcf2bed9b8cea93512716c355940d4e801fb72e21f810b547a4507e4f007d8","source":{"kind":"arxiv","id":"2507.11860","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2507.11860","created_at":"2026-07-05T11:37:52.297934+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.11860v1","created_at":"2026-07-05T11:37:52.297934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11860","created_at":"2026-07-05T11:37:52.297934+00:00"},{"alias_kind":"pith_short_12","alias_value":"XP6PFPWZXDHK","created_at":"2026-07-05T11:37:52.297934+00:00"},{"alias_kind":"pith_short_16","alias_value":"XP6PFPWZXDHKSNIS","created_at":"2026-07-05T11:37:52.297934+00:00"},{"alias_kind":"pith_short_8","alias_value":"XP6PFPWZ","created_at":"2026-07-05T11:37:52.297934+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XP6PFPWZXDHKSNISOFWDKWKA2T","json":"https://pith.science/pith/XP6PFPWZXDHKSNISOFWDKWKA2T.json","graph_json":"https://pith.science/api/pith-number/XP6PFPWZXDHKSNISOFWDKWKA2T/graph.json","events_json":"https://pith.science/api/pith-number/XP6PFPWZXDHKSNISOFWDKWKA2T/events.json","paper":"https://pith.science/paper/XP6PFPWZ"},"agent_actions":{"view_html":"https://pith.science/pith/XP6PFPWZXDHKSNISOFWDKWKA2T","download_json":"https://pith.science/pith/XP6PFPWZXDHKSNISOFWDKWKA2T.json","view_paper":"https://pith.science/paper/XP6PFPWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.11860&json=true","fetch_graph":"https://pith.science/api/pith-number/XP6PFPWZXDHKSNISOFWDKWKA2T/graph.json","fetch_events":"https://pith.science/api/pith-number/XP6PFPWZXDHKSNISOFWDKWKA2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XP6PFPWZXDHKSNISOFWDKWKA2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XP6PFPWZXDHKSNISOFWDKWKA2T/action/storage_attestation","attest_author":"https://pith.science/pith/XP6PFPWZXDHKSNISOFWDKWKA2T/action/author_attestation","sign_citation":"https://pith.science/pith/XP6PFPWZXDHKSNISOFWDKWKA2T/action/citation_signature","submit_replication":"https://pith.science/pith/XP6PFPWZXDHKSNISOFWDKWKA2T/action/replication_record"}},"created_at":"2026-07-05T11:37:52.297934+00:00","updated_at":"2026-07-05T11:37:52.297934+00:00"}