{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:G7ETMC4KAGPNPHWPMEPRBJLEU3","short_pith_number":"pith:G7ETMC4K","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"},"canonical_sha256":"37c9360b8a019ed79ecf611f10a564a6f552a754e0bead468e40129f09c5b438","source":{"kind":"arxiv","id":"1311.2749","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2749","created_at":"2026-05-18T02:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2749v2","created_at":"2026-05-18T02:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2749","created_at":"2026-05-18T02:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"G7ETMC4KAGPN","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G7ETMC4KAGPNPHWP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G7ETMC4K","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:G7ETMC4KAGPNPHWPMEPRBJLEU3","target":"record","payload":{"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"},"canonical_sha256":"37c9360b8a019ed79ecf611f10a564a6f552a754e0bead468e40129f09c5b438","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"},"source_kind":"arxiv","source_id":"1311.2749","source_version":2,"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-18T02:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f7yKH/kHm1GkMlXyaNljRkiLNp2XYTdraYpiUiLNqlxhHwiNevQWusFyxXCuxZ8Ei7kWiWgsV+xiuvgqq2CnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:05:27.528025Z"},"content_sha256":"eadf466a19c882f1a5ba20162d831ec8c7909d66d5612972a8631b6f43b8cba2","schema_version":"1.0","event_id":"sha256:eadf466a19c882f1a5ba20162d831ec8c7909d66d5612972a8631b6f43b8cba2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:G7ETMC4KAGPNPHWPMEPRBJLEU3","target":"graph","payload":{"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"},"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-18T02:42:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ed6cd5f5421pr5yMmzaSVAvzKBwSEXqPOIefUI5REkuZ8QjQtI5pq1r4iTfMj3hQeZOkZ1mvnwS+5jqG1odACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:05:27.528702Z"},"content_sha256":"f580da84286339455e9752506419f42480b973d213ec514717b4e0c26313473c","schema_version":"1.0","event_id":"sha256:f580da84286339455e9752506419f42480b973d213ec514717b4e0c26313473c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3/bundle.json","state_url":"https://pith.science/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3/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-05-25T15:05:27Z","links":{"resolver":"https://pith.science/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3","bundle":"https://pith.science/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3/bundle.json","state":"https://pith.science/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7ETMC4KAGPNPHWPMEPRBJLEU3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:G7ETMC4KAGPNPHWPMEPRBJLEU3","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":"ecfeeef010915f7f45699aabd2439abc100f395309649ea0242b1b1b7444956e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-12T12:19:45Z","title_canon_sha256":"a0d65224e1a2544b039717f0583fc6099ab6f11ffc1118660f828c3ae9fc136c"},"schema_version":"1.0","source":{"id":"1311.2749","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2749","created_at":"2026-05-18T02:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2749v2","created_at":"2026-05-18T02:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2749","created_at":"2026-05-18T02:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"G7ETMC4KAGPN","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"G7ETMC4KAGPNPHWP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"G7ETMC4K","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:f580da84286339455e9752506419f42480b973d213ec514717b4e0c26313473c","target":"graph","created_at":"2026-05-18T02:42:14Z","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":"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","authors_text":"Matthias Mnich, Zdenek Dvorak","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-12T12:19:45Z","title":"Large Independent Sets in Triangle-Free Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2749","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:eadf466a19c882f1a5ba20162d831ec8c7909d66d5612972a8631b6f43b8cba2","target":"record","created_at":"2026-05-18T02:42:14Z","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":"ecfeeef010915f7f45699aabd2439abc100f395309649ea0242b1b1b7444956e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-12T12:19:45Z","title_canon_sha256":"a0d65224e1a2544b039717f0583fc6099ab6f11ffc1118660f828c3ae9fc136c"},"schema_version":"1.0","source":{"id":"1311.2749","kind":"arxiv","version":2}},"canonical_sha256":"37c9360b8a019ed79ecf611f10a564a6f552a754e0bead468e40129f09c5b438","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37c9360b8a019ed79ecf611f10a564a6f552a754e0bead468e40129f09c5b438","first_computed_at":"2026-05-18T02:42:14.826174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:14.826174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e7XUK6H6EtuaF2GKBC6wZgCxAU6IW6Xi8IxKXXiirRv7qzlEwWcwDW8XJ/UzwOAIYgMulOCXKqRnnKn2+ulCAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:14.826951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2749","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eadf466a19c882f1a5ba20162d831ec8c7909d66d5612972a8631b6f43b8cba2","sha256:f580da84286339455e9752506419f42480b973d213ec514717b4e0c26313473c"],"state_sha256":"5a47f3edcd492e382e23b9905b466010b095374fda3cbbfc20e6f5a974b77040"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9GsCcxRFynlJIHavMS1CRE8GjpDHdJcNJH+ynLSkXvI/vs5a0f68dUSpmZLXQrkjFMUHCYSkX9RVvJM62M/DBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:05:27.533170Z","bundle_sha256":"b582c919cdfedf80560773edc74bbd90d16b1cf6aa62a636498aabb9c7a5c34c"}}