{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IXM7J3MND7C24RCM5CZX5AJBKU","short_pith_number":"pith:IXM7J3MN","schema_version":"1.0","canonical_sha256":"45d9f4ed8d1fc5ae444ce8b37e8121553f49cab8796b2db285091daa7af6d86a","source":{"kind":"arxiv","id":"2503.03487","version":3},"attestation_state":"computed","paper":{"title":"The planar Turan number of double star S_(3,5)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dandan Liu, Shoujun Xu","submitted_at":"2025-03-05T13:25:04Z","abstract_excerpt":"Given a graph H and a positive integer n, the planar Turan number of H, denoted by exp(n, H), is the maximum number of edges in an n-vertex H-free planar graph.D.Ghosh, et al.initiated the topic of double stars S_(k,l). Recently Xu et al.[AIMS Mathematics, 2025, 10(1): 1628-1644.] mentioned that exp(n, S_(3,5)) is still unknown.In this paper, we first establish that the planar Turan number S_(3,5) satisfies exp(n, S_(3,5)) <= 23n/8 - 9/2 for all n >= 2. The upper bound is tight for n = 12."},"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":"2503.03487","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-05T13:25:04Z","cross_cats_sorted":[],"title_canon_sha256":"c9766aff145e2678b180578ebdd2875d68a8a6dbde31e5fa2165472463204e6e","abstract_canon_sha256":"7f0c99fc6d50b5d6e23238452b405e53227178d7bce3c45b074e92d596929df8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:07.636769Z","signature_b64":"HE97BiSAWK2g4f83uefO+O4pzlM/LFBFucvuszDasVg3KnNbDio3kC4BGfkkRxjjRuimVEqqcntQGK7zNJNgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45d9f4ed8d1fc5ae444ce8b37e8121553f49cab8796b2db285091daa7af6d86a","last_reissued_at":"2026-07-05T11:29:07.636205Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:07.636205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The planar Turan number of double star S_(3,5)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dandan Liu, Shoujun Xu","submitted_at":"2025-03-05T13:25:04Z","abstract_excerpt":"Given a graph H and a positive integer n, the planar Turan number of H, denoted by exp(n, H), is the maximum number of edges in an n-vertex H-free planar graph.D.Ghosh, et al.initiated the topic of double stars S_(k,l). Recently Xu et al.[AIMS Mathematics, 2025, 10(1): 1628-1644.] mentioned that exp(n, S_(3,5)) is still unknown.In this paper, we first establish that the planar Turan number S_(3,5) satisfies exp(n, S_(3,5)) <= 23n/8 - 9/2 for all n >= 2. The upper bound is tight for n = 12."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.03487","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/2503.03487/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":"2503.03487","created_at":"2026-07-05T11:29:07.636268+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.03487v3","created_at":"2026-07-05T11:29:07.636268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.03487","created_at":"2026-07-05T11:29:07.636268+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXM7J3MND7C2","created_at":"2026-07-05T11:29:07.636268+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXM7J3MND7C24RCM","created_at":"2026-07-05T11:29:07.636268+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXM7J3MN","created_at":"2026-07-05T11:29:07.636268+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.17330","citing_title":"The Outerplanar Tur\\'{a}n Number of Double Stars","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IXM7J3MND7C24RCM5CZX5AJBKU","json":"https://pith.science/pith/IXM7J3MND7C24RCM5CZX5AJBKU.json","graph_json":"https://pith.science/api/pith-number/IXM7J3MND7C24RCM5CZX5AJBKU/graph.json","events_json":"https://pith.science/api/pith-number/IXM7J3MND7C24RCM5CZX5AJBKU/events.json","paper":"https://pith.science/paper/IXM7J3MN"},"agent_actions":{"view_html":"https://pith.science/pith/IXM7J3MND7C24RCM5CZX5AJBKU","download_json":"https://pith.science/pith/IXM7J3MND7C24RCM5CZX5AJBKU.json","view_paper":"https://pith.science/paper/IXM7J3MN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.03487&json=true","fetch_graph":"https://pith.science/api/pith-number/IXM7J3MND7C24RCM5CZX5AJBKU/graph.json","fetch_events":"https://pith.science/api/pith-number/IXM7J3MND7C24RCM5CZX5AJBKU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXM7J3MND7C24RCM5CZX5AJBKU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXM7J3MND7C24RCM5CZX5AJBKU/action/storage_attestation","attest_author":"https://pith.science/pith/IXM7J3MND7C24RCM5CZX5AJBKU/action/author_attestation","sign_citation":"https://pith.science/pith/IXM7J3MND7C24RCM5CZX5AJBKU/action/citation_signature","submit_replication":"https://pith.science/pith/IXM7J3MND7C24RCM5CZX5AJBKU/action/replication_record"}},"created_at":"2026-07-05T11:29:07.636268+00:00","updated_at":"2026-07-05T11:29:07.636268+00:00"}