{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:W46KMVPFFAYZ23KZEW2QXW66YU","short_pith_number":"pith:W46KMVPF","schema_version":"1.0","canonical_sha256":"b73ca655e528319d6d5925b50bdbdec513be2d4a1711693e9a3084ffb3f70b47","source":{"kind":"arxiv","id":"1603.04559","version":2},"attestation_state":"computed","paper":{"title":"Minimum Size of Feedback Vertex Sets of Planar Graphs of Girth at least Five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chun-Hung Liu, Tom Kelly","submitted_at":"2016-03-15T05:42:00Z","abstract_excerpt":"A feedback vertex set of a graph is a subset of vertices intersecting all cycles. We provide tight upper bounds on the size of a minimum feedback vertex set in planar graphs of girth at least five. We prove that if $G$ is a connected planar graph of girth at least five on $n$ vertices and $m$ edges, then $G$ has a feedback vertex set of size at most $\\frac{2m-n+2}{7}$. By Euler's formula, this implies that $G$ has a feedback vertex set of size at most $\\frac{m}{5}$ and $\\frac{n-2}{3}$. These results not only improve a result of Dross, Montassier and Pinlou and confirm the girth-5 case of one o"},"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":"1603.04559","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-15T05:42:00Z","cross_cats_sorted":[],"title_canon_sha256":"ecdc510861aa87541157cc21229a55034922533f3fa315d5d4374b7ff3f63586","abstract_canon_sha256":"058d66bcfdfe208edc5484595fd5b5f5f30db62c8ad467f99261a84c0c552f36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:37.940956Z","signature_b64":"DEauXUNWV5SGVlEpiEiW6DjnNuNAUXZJQPXTEEyDVe8Bxz1wEf5FWa9y+QeehADI+2OK2J3YD6VRQD/Usm3vAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b73ca655e528319d6d5925b50bdbdec513be2d4a1711693e9a3084ffb3f70b47","last_reissued_at":"2026-05-18T00:56:37.940211Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:37.940211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Size of Feedback Vertex Sets of Planar Graphs of Girth at least Five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chun-Hung Liu, Tom Kelly","submitted_at":"2016-03-15T05:42:00Z","abstract_excerpt":"A feedback vertex set of a graph is a subset of vertices intersecting all cycles. We provide tight upper bounds on the size of a minimum feedback vertex set in planar graphs of girth at least five. We prove that if $G$ is a connected planar graph of girth at least five on $n$ vertices and $m$ edges, then $G$ has a feedback vertex set of size at most $\\frac{2m-n+2}{7}$. By Euler's formula, this implies that $G$ has a feedback vertex set of size at most $\\frac{m}{5}$ and $\\frac{n-2}{3}$. These results not only improve a result of Dross, Montassier and Pinlou and confirm the girth-5 case of one o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04559","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":""},"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":"1603.04559","created_at":"2026-05-18T00:56:37.940330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04559v2","created_at":"2026-05-18T00:56:37.940330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04559","created_at":"2026-05-18T00:56:37.940330+00:00"},{"alias_kind":"pith_short_12","alias_value":"W46KMVPFFAYZ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"W46KMVPFFAYZ23KZ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"W46KMVPF","created_at":"2026-05-18T12:30:48.956258+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/W46KMVPFFAYZ23KZEW2QXW66YU","json":"https://pith.science/pith/W46KMVPFFAYZ23KZEW2QXW66YU.json","graph_json":"https://pith.science/api/pith-number/W46KMVPFFAYZ23KZEW2QXW66YU/graph.json","events_json":"https://pith.science/api/pith-number/W46KMVPFFAYZ23KZEW2QXW66YU/events.json","paper":"https://pith.science/paper/W46KMVPF"},"agent_actions":{"view_html":"https://pith.science/pith/W46KMVPFFAYZ23KZEW2QXW66YU","download_json":"https://pith.science/pith/W46KMVPFFAYZ23KZEW2QXW66YU.json","view_paper":"https://pith.science/paper/W46KMVPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04559&json=true","fetch_graph":"https://pith.science/api/pith-number/W46KMVPFFAYZ23KZEW2QXW66YU/graph.json","fetch_events":"https://pith.science/api/pith-number/W46KMVPFFAYZ23KZEW2QXW66YU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W46KMVPFFAYZ23KZEW2QXW66YU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W46KMVPFFAYZ23KZEW2QXW66YU/action/storage_attestation","attest_author":"https://pith.science/pith/W46KMVPFFAYZ23KZEW2QXW66YU/action/author_attestation","sign_citation":"https://pith.science/pith/W46KMVPFFAYZ23KZEW2QXW66YU/action/citation_signature","submit_replication":"https://pith.science/pith/W46KMVPFFAYZ23KZEW2QXW66YU/action/replication_record"}},"created_at":"2026-05-18T00:56:37.940330+00:00","updated_at":"2026-05-18T00:56:37.940330+00:00"}