{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:I4FFLUOMWCFTXL5NH3KVGIVGGA","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":"c8babfbe5990ace2f5b02d44a5514774a01bb016aecb3fed0e1f0fede3d3596d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-07T16:38:46Z","title_canon_sha256":"dddd98278a4d457af6706e426af13bd7e6563a829f5c9c7e497780a89aa4d23b"},"schema_version":"1.0","source":{"id":"2509.06131","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.06131","created_at":"2026-07-05T12:11:20Z"},{"alias_kind":"arxiv_version","alias_value":"2509.06131v2","created_at":"2026-07-05T12:11:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.06131","created_at":"2026-07-05T12:11:20Z"},{"alias_kind":"pith_short_12","alias_value":"I4FFLUOMWCFT","created_at":"2026-07-05T12:11:20Z"},{"alias_kind":"pith_short_16","alias_value":"I4FFLUOMWCFTXL5N","created_at":"2026-07-05T12:11:20Z"},{"alias_kind":"pith_short_8","alias_value":"I4FFLUOM","created_at":"2026-07-05T12:11:20Z"}],"graph_snapshots":[{"event_id":"sha256:cf4bfc520b0cc884c7807173dbb00bd987c85528ae1a27ade0062ce43a88223d","target":"graph","created_at":"2026-07-05T12:11:20Z","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/2509.06131/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 $","authors_text":"Ping Li, Xuqing Bai, Zhipeng Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-07T16:38:46Z","title":"Planar Tur\\'{a}n numbers of three configurations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.06131","kind":"arxiv","version":2},"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:9f0884e3290497b3b4d1b38a71091d6e710c2151408b5c50c419b911bf8c561c","target":"record","created_at":"2026-07-05T12:11:20Z","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":"c8babfbe5990ace2f5b02d44a5514774a01bb016aecb3fed0e1f0fede3d3596d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-07T16:38:46Z","title_canon_sha256":"dddd98278a4d457af6706e426af13bd7e6563a829f5c9c7e497780a89aa4d23b"},"schema_version":"1.0","source":{"id":"2509.06131","kind":"arxiv","version":2}},"canonical_sha256":"470a55d1ccb08b3bafad3ed55322a63038e7911aa05aec58c73d7a9ce9578085","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"470a55d1ccb08b3bafad3ed55322a63038e7911aa05aec58c73d7a9ce9578085","first_computed_at":"2026-07-05T12:11:20.518429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:11:20.518429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oxNMTyc9z1DpPfm8ToiAySCSQKKgr+zt6muv88ePCw4P4GbwJ5/MXA7OSK6r/+wpJfpZ0LcI8IMj5UVDMazEBw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:11:20.519046Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.06131","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f0884e3290497b3b4d1b38a71091d6e710c2151408b5c50c419b911bf8c561c","sha256:cf4bfc520b0cc884c7807173dbb00bd987c85528ae1a27ade0062ce43a88223d"],"state_sha256":"51132ecbf8ef92669e4a6043cfe0318a1aae9309f6d687da570d4cb346365952"}