{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CB4ONERWX2V3IN2R2WZGYMWS5D","short_pith_number":"pith:CB4ONERW","canonical_record":{"source":{"id":"1711.01614","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-05T16:50:52Z","cross_cats_sorted":[],"title_canon_sha256":"28437ecd194d3a39eda4acbab0984bd587ab7f0bc7217a68823bf87bd4a70a32","abstract_canon_sha256":"484928a86f40a8e1ae2733cbf62d0fc55c16c9e59d7b6448b5fb4f575adcb8f2"},"schema_version":"1.0"},"canonical_sha256":"1078e69236beabb43751d5b26c32d2e8dac96e3089ab4775df58e4cf7e0967b3","source":{"kind":"arxiv","id":"1711.01614","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01614","created_at":"2026-05-17T23:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01614v3","created_at":"2026-05-17T23:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01614","created_at":"2026-05-17T23:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"CB4ONERWX2V3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CB4ONERWX2V3IN2R","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CB4ONERW","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CB4ONERWX2V3IN2R2WZGYMWS5D","target":"record","payload":{"canonical_record":{"source":{"id":"1711.01614","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-05T16:50:52Z","cross_cats_sorted":[],"title_canon_sha256":"28437ecd194d3a39eda4acbab0984bd587ab7f0bc7217a68823bf87bd4a70a32","abstract_canon_sha256":"484928a86f40a8e1ae2733cbf62d0fc55c16c9e59d7b6448b5fb4f575adcb8f2"},"schema_version":"1.0"},"canonical_sha256":"1078e69236beabb43751d5b26c32d2e8dac96e3089ab4775df58e4cf7e0967b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:55.961191Z","signature_b64":"nDHIOBe6EcdUe6aZOP1g7QDKxOM3UPNu7Ds521G0IJIcCpir7o4Cgl98m2A/aO7eXcBXiZI+UPG5tdYwQXz2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1078e69236beabb43751d5b26c32d2e8dac96e3089ab4775df58e4cf7e0967b3","last_reissued_at":"2026-05-17T23:52:55.960551Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:55.960551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.01614","source_version":3,"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-05-17T23:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/UAeUt0vh3C8uQuy9i2IcdglPUZs+vYCkJljOLFFnx7WxZuO5yl7m9okv+RIMkkrUurzdaBKz26jlOWGBVCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:58:25.764756Z"},"content_sha256":"3ea1cc9f3a1bed06d3cd717ceefaee9122510e1503944d409a740189ac1c28e5","schema_version":"1.0","event_id":"sha256:3ea1cc9f3a1bed06d3cd717ceefaee9122510e1503944d409a740189ac1c28e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CB4ONERWX2V3IN2R2WZGYMWS5D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal Theta-free planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yongtang Shi, Yongxin Lan, Zi-Xia Song","submitted_at":"2017-11-05T16:50:52Z","abstract_excerpt":"Given a family $\\mathcal{F}$, a graph is $\\mathcal{F}$-free if it does not contain any graph in $\\mathcal{F}$ as a subgraph. We study the topic of \"extremal\" planar graphs initiated by Dowden [J. Graph Theory 83 (2016) 213--230], that is, how many edges can an $\\mathcal{F}$-free planar graph on $n$ vertices have? We define $ex_{_\\mathcal{P}}(n,\\mathcal{F})$ to be the maximum number of edges in an $\\mathcal{F}$-free planar graph on $n $ vertices. Dowden obtained the tight bounds $ex_{_\\mathcal{P}}(n,C_4)\\leq15(n-2)/7$ for all $n\\geq4$ and $ex_{_\\mathcal{P}}(n,C_5)\\leq(12n-33)/5$ for all $n\\geq1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01614","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":""},"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-05-17T23:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZWci9kdN41ucoCiXZ8aUB/yuoF4KMckWzjLkymShKXAba3R7qll8uhzwtlpU9rGi+UsO0RmXdM/gnhID82AvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:58:25.765109Z"},"content_sha256":"872175c2bbc5a8b07e02d4cd0d9a806fa3c19e40736cf3cf4affa591cfdb8288","schema_version":"1.0","event_id":"sha256:872175c2bbc5a8b07e02d4cd0d9a806fa3c19e40736cf3cf4affa591cfdb8288"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CB4ONERWX2V3IN2R2WZGYMWS5D/bundle.json","state_url":"https://pith.science/pith/CB4ONERWX2V3IN2R2WZGYMWS5D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CB4ONERWX2V3IN2R2WZGYMWS5D/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-06-03T05:58:25Z","links":{"resolver":"https://pith.science/pith/CB4ONERWX2V3IN2R2WZGYMWS5D","bundle":"https://pith.science/pith/CB4ONERWX2V3IN2R2WZGYMWS5D/bundle.json","state":"https://pith.science/pith/CB4ONERWX2V3IN2R2WZGYMWS5D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CB4ONERWX2V3IN2R2WZGYMWS5D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CB4ONERWX2V3IN2R2WZGYMWS5D","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":"484928a86f40a8e1ae2733cbf62d0fc55c16c9e59d7b6448b5fb4f575adcb8f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-05T16:50:52Z","title_canon_sha256":"28437ecd194d3a39eda4acbab0984bd587ab7f0bc7217a68823bf87bd4a70a32"},"schema_version":"1.0","source":{"id":"1711.01614","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01614","created_at":"2026-05-17T23:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01614v3","created_at":"2026-05-17T23:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01614","created_at":"2026-05-17T23:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"CB4ONERWX2V3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CB4ONERWX2V3IN2R","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CB4ONERW","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:872175c2bbc5a8b07e02d4cd0d9a806fa3c19e40736cf3cf4affa591cfdb8288","target":"graph","created_at":"2026-05-17T23:52:55Z","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"},"paper":{"abstract_excerpt":"Given a family $\\mathcal{F}$, a graph is $\\mathcal{F}$-free if it does not contain any graph in $\\mathcal{F}$ as a subgraph. We study the topic of \"extremal\" planar graphs initiated by Dowden [J. Graph Theory 83 (2016) 213--230], that is, how many edges can an $\\mathcal{F}$-free planar graph on $n$ vertices have? We define $ex_{_\\mathcal{P}}(n,\\mathcal{F})$ to be the maximum number of edges in an $\\mathcal{F}$-free planar graph on $n $ vertices. Dowden obtained the tight bounds $ex_{_\\mathcal{P}}(n,C_4)\\leq15(n-2)/7$ for all $n\\geq4$ and $ex_{_\\mathcal{P}}(n,C_5)\\leq(12n-33)/5$ for all $n\\geq1","authors_text":"Yongtang Shi, Yongxin Lan, Zi-Xia Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-05T16:50:52Z","title":"Extremal Theta-free planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01614","kind":"arxiv","version":3},"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:3ea1cc9f3a1bed06d3cd717ceefaee9122510e1503944d409a740189ac1c28e5","target":"record","created_at":"2026-05-17T23:52:55Z","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":"484928a86f40a8e1ae2733cbf62d0fc55c16c9e59d7b6448b5fb4f575adcb8f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-05T16:50:52Z","title_canon_sha256":"28437ecd194d3a39eda4acbab0984bd587ab7f0bc7217a68823bf87bd4a70a32"},"schema_version":"1.0","source":{"id":"1711.01614","kind":"arxiv","version":3}},"canonical_sha256":"1078e69236beabb43751d5b26c32d2e8dac96e3089ab4775df58e4cf7e0967b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1078e69236beabb43751d5b26c32d2e8dac96e3089ab4775df58e4cf7e0967b3","first_computed_at":"2026-05-17T23:52:55.960551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:55.960551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nDHIOBe6EcdUe6aZOP1g7QDKxOM3UPNu7Ds521G0IJIcCpir7o4Cgl98m2A/aO7eXcBXiZI+UPG5tdYwQXz2Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:55.961191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01614","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ea1cc9f3a1bed06d3cd717ceefaee9122510e1503944d409a740189ac1c28e5","sha256:872175c2bbc5a8b07e02d4cd0d9a806fa3c19e40736cf3cf4affa591cfdb8288"],"state_sha256":"f663ccc5c4169823a511e2170e9f27c7b140dac07f955c95fdf1847c1f4bca2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xIyLWpGB7v5f+oEqEk4aG1sx1oaFAt2lxl2yCpLSy5H+cK/tIcUbTo510eOLDkh9d0PGkD9lWYeI7TVsp6tBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:58:25.767088Z","bundle_sha256":"14c09a9d5d81d0f5be8fd9397422d689ce3e0647ebd923d29acd0b846a58dafc"}}