{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:G7ETMC4KAGPNPHWPMEPRBJLEU3","short_pith_number":"pith:G7ETMC4K","schema_version":"1.0","canonical_sha256":"37c9360b8a019ed79ecf611f10a564a6f552a754e0bead468e40129f09c5b438","source":{"kind":"arxiv","id":"1311.2749","version":2},"attestation_state":"computed","paper":{"title":"Large Independent Sets in Triangle-Free Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Matthias Mnich, Zdenek Dvorak","submitted_at":"2013-11-12T12:19:45Z","abstract_excerpt":"Every triangle-free planar graph on n vertices has an independent set of size at least (n+1)/3, and this lower bound is tight. We give an algorithm that, given a triangle-free planar graph G on n vertices and an integer k>=0, decides whether G has an independent set of size at least (n+k)/3, in time 2^{O(sqrt{k})}n. Thus, the problem is fixed-parameter tractable when parameterized by k. Furthermore, as a corollary of the result used to prove the correctness of the algorithm, we show that there exists epsilon>0 such that every planar graph of girth at least five on n vertices has an independent"},"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":"1311.2749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-12T12:19:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"a0d65224e1a2544b039717f0583fc6099ab6f11ffc1118660f828c3ae9fc136c","abstract_canon_sha256":"ecfeeef010915f7f45699aabd2439abc100f395309649ea0242b1b1b7444956e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:14.826951Z","signature_b64":"e7XUK6H6EtuaF2GKBC6wZgCxAU6IW6Xi8IxKXXiirRv7qzlEwWcwDW8XJ/UzwOAIYgMulOCXKqRnnKn2+ulCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37c9360b8a019ed79ecf611f10a564a6f552a754e0bead468e40129f09c5b438","last_reissued_at":"2026-05-18T02:42:14.826174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:14.826174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large Independent Sets in Triangle-Free Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Matthias Mnich, Zdenek Dvorak","submitted_at":"2013-11-12T12:19:45Z","abstract_excerpt":"Every triangle-free planar graph on n vertices has an independent set of size at least (n+1)/3, and this lower bound is tight. We give an algorithm that, given a triangle-free planar graph G on n vertices and an integer k>=0, decides whether G has an independent set of size at least (n+k)/3, in time 2^{O(sqrt{k})}n. Thus, the problem is fixed-parameter tractable when parameterized by k. Furthermore, as a corollary of the result used to prove the correctness of the algorithm, we show that there exists epsilon>0 such that every planar graph of girth at least five on n vertices has an independent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2749","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":"1311.2749","created_at":"2026-05-18T02:42:14.826305+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.2749v2","created_at":"2026-05-18T02:42:14.826305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2749","created_at":"2026-05-18T02:42:14.826305+00:00"},{"alias_kind":"pith_short_12","alias_value":"G7ETMC4KAGPN","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"G7ETMC4KAGPNPHWP","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"G7ETMC4K","created_at":"2026-05-18T12:27:45.050594+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/G7ETMC4KAGPNPHWPMEPRBJLEU3","json":"https://pith.science/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3.json","graph_json":"https://pith.science/api/pith-number/G7ETMC4KAGPNPHWPMEPRBJLEU3/graph.json","events_json":"https://pith.science/api/pith-number/G7ETMC4KAGPNPHWPMEPRBJLEU3/events.json","paper":"https://pith.science/paper/G7ETMC4K"},"agent_actions":{"view_html":"https://pith.science/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3","download_json":"https://pith.science/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3.json","view_paper":"https://pith.science/paper/G7ETMC4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.2749&json=true","fetch_graph":"https://pith.science/api/pith-number/G7ETMC4KAGPNPHWPMEPRBJLEU3/graph.json","fetch_events":"https://pith.science/api/pith-number/G7ETMC4KAGPNPHWPMEPRBJLEU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3/action/storage_attestation","attest_author":"https://pith.science/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3/action/author_attestation","sign_citation":"https://pith.science/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3/action/citation_signature","submit_replication":"https://pith.science/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3/action/replication_record"}},"created_at":"2026-05-18T02:42:14.826305+00:00","updated_at":"2026-05-18T02:42:14.826305+00:00"}