{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:I4FFLUOMWCFTXL5NH3KVGIVGGA","short_pith_number":"pith:I4FFLUOM","schema_version":"1.0","canonical_sha256":"470a55d1ccb08b3bafad3ed55322a63038e7911aa05aec58c73d7a9ce9578085","source":{"kind":"arxiv","id":"2509.06131","version":2},"attestation_state":"computed","paper":{"title":"Planar Tur\\'{a}n numbers of three configurations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ping Li, Xuqing Bai, Zhipeng Gao","submitted_at":"2025-09-07T16:38:46Z","abstract_excerpt":"The planar Tu\\'{a}n number of $H$, denoted by $ex_{\\mathcal{P}}(n,H)$, is defined as the maximum number of edges in an $n$-vertex $H$-free planar graph. The exact value of $ex_{\\mathcal{P}}(n,H)$ remains a mystery when $H$ is large (for example, $H$ is a long path or a long cycle), while tight bounds have been established for many small planar graphs such as cycles, paths, $\\Theta$-graphs and other small graphs formed by a union of them.\n  One representative graph among such union graphs is $K_1+L$ where $L$ is a linear forest without isolated vertices.\n  Previous works solved the cases when $"},"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":"2509.06131","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-07T16:38:46Z","cross_cats_sorted":[],"title_canon_sha256":"dddd98278a4d457af6706e426af13bd7e6563a829f5c9c7e497780a89aa4d23b","abstract_canon_sha256":"c8babfbe5990ace2f5b02d44a5514774a01bb016aecb3fed0e1f0fede3d3596d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:11:20.519046Z","signature_b64":"oxNMTyc9z1DpPfm8ToiAySCSQKKgr+zt6muv88ePCw4P4GbwJ5/MXA7OSK6r/+wpJfpZ0LcI8IMj5UVDMazEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"470a55d1ccb08b3bafad3ed55322a63038e7911aa05aec58c73d7a9ce9578085","last_reissued_at":"2026-07-05T12:11:20.518429Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:11:20.518429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar Tur\\'{a}n numbers of three configurations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ping Li, Xuqing Bai, Zhipeng Gao","submitted_at":"2025-09-07T16:38:46Z","abstract_excerpt":"The planar Tu\\'{a}n number of $H$, denoted by $ex_{\\mathcal{P}}(n,H)$, is defined as the maximum number of edges in an $n$-vertex $H$-free planar graph. The exact value of $ex_{\\mathcal{P}}(n,H)$ remains a mystery when $H$ is large (for example, $H$ is a long path or a long cycle), while tight bounds have been established for many small planar graphs such as cycles, paths, $\\Theta$-graphs and other small graphs formed by a union of them.\n  One representative graph among such union graphs is $K_1+L$ where $L$ is a linear forest without isolated vertices.\n  Previous works solved the cases when $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.06131","kind":"arxiv","version":2},"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/2509.06131/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":"2509.06131","created_at":"2026-07-05T12:11:20.518511+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.06131v2","created_at":"2026-07-05T12:11:20.518511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06131","created_at":"2026-07-05T12:11:20.518511+00:00"},{"alias_kind":"pith_short_12","alias_value":"I4FFLUOMWCFT","created_at":"2026-07-05T12:11:20.518511+00:00"},{"alias_kind":"pith_short_16","alias_value":"I4FFLUOMWCFTXL5N","created_at":"2026-07-05T12:11:20.518511+00:00"},{"alias_kind":"pith_short_8","alias_value":"I4FFLUOM","created_at":"2026-07-05T12:11:20.518511+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/I4FFLUOMWCFTXL5NH3KVGIVGGA","json":"https://pith.science/pith/I4FFLUOMWCFTXL5NH3KVGIVGGA.json","graph_json":"https://pith.science/api/pith-number/I4FFLUOMWCFTXL5NH3KVGIVGGA/graph.json","events_json":"https://pith.science/api/pith-number/I4FFLUOMWCFTXL5NH3KVGIVGGA/events.json","paper":"https://pith.science/paper/I4FFLUOM"},"agent_actions":{"view_html":"https://pith.science/pith/I4FFLUOMWCFTXL5NH3KVGIVGGA","download_json":"https://pith.science/pith/I4FFLUOMWCFTXL5NH3KVGIVGGA.json","view_paper":"https://pith.science/paper/I4FFLUOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.06131&json=true","fetch_graph":"https://pith.science/api/pith-number/I4FFLUOMWCFTXL5NH3KVGIVGGA/graph.json","fetch_events":"https://pith.science/api/pith-number/I4FFLUOMWCFTXL5NH3KVGIVGGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I4FFLUOMWCFTXL5NH3KVGIVGGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I4FFLUOMWCFTXL5NH3KVGIVGGA/action/storage_attestation","attest_author":"https://pith.science/pith/I4FFLUOMWCFTXL5NH3KVGIVGGA/action/author_attestation","sign_citation":"https://pith.science/pith/I4FFLUOMWCFTXL5NH3KVGIVGGA/action/citation_signature","submit_replication":"https://pith.science/pith/I4FFLUOMWCFTXL5NH3KVGIVGGA/action/replication_record"}},"created_at":"2026-07-05T12:11:20.518511+00:00","updated_at":"2026-07-05T12:11:20.518511+00:00"}