{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XP44J53UHCDK6S23L6SKJU72G7","short_pith_number":"pith:XP44J53U","schema_version":"1.0","canonical_sha256":"bbf9c4f7743886af4b5b5fa4a4d3fa37f641d69851df2b4f130a92ccba1a963b","source":{"kind":"arxiv","id":"1606.06265","version":1},"attestation_state":"computed","paper":{"title":"Triangle-free planar graphs with the smallest independence number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Mus\\'ilek, Ond\\v{r}ej Pangr\\'ac, Tom\\'a\\v{s} Masa\\v{r}\\'ik, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2016-06-20T19:36:07Z","abstract_excerpt":"Steinberg and Tovey proved that every n-vertex planar triangle-free graph has an independent set of size at least (n+1)/3, and described an infinite class of tight examples. We show that all n-vertex planar triangle-free graphs except for this one infinite class have independent sets of size at least (n+2)/3."},"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":"1606.06265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-20T19:36:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6508706e1df957c7b530f9b7193e5406f7996702c9c8a40d921433be416573ad","abstract_canon_sha256":"5247b0a3f30bf1ae54f8dea715772b3a8f1e4607f23458228d498bffac360add"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:00.531368Z","signature_b64":"oxI58wchKIWC1xbGshzrPthv7CwD1GiO5Yy7I+9AYcIFWqbo0O3GDPlylumJpfsBcVSDLnWSDHFCwmDQFPFTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbf9c4f7743886af4b5b5fa4a4d3fa37f641d69851df2b4f130a92ccba1a963b","last_reissued_at":"2026-05-17T23:51:00.530799Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:00.530799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangle-free planar graphs with the smallest independence number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Mus\\'ilek, Ond\\v{r}ej Pangr\\'ac, Tom\\'a\\v{s} Masa\\v{r}\\'ik, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2016-06-20T19:36:07Z","abstract_excerpt":"Steinberg and Tovey proved that every n-vertex planar triangle-free graph has an independent set of size at least (n+1)/3, and described an infinite class of tight examples. We show that all n-vertex planar triangle-free graphs except for this one infinite class have independent sets of size at least (n+2)/3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06265","kind":"arxiv","version":1},"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":"1606.06265","created_at":"2026-05-17T23:51:00.530882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.06265v1","created_at":"2026-05-17T23:51:00.530882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06265","created_at":"2026-05-17T23:51:00.530882+00:00"},{"alias_kind":"pith_short_12","alias_value":"XP44J53UHCDK","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XP44J53UHCDK6S23","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XP44J53U","created_at":"2026-05-18T12:30:51.357362+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/XP44J53UHCDK6S23L6SKJU72G7","json":"https://pith.science/pith/XP44J53UHCDK6S23L6SKJU72G7.json","graph_json":"https://pith.science/api/pith-number/XP44J53UHCDK6S23L6SKJU72G7/graph.json","events_json":"https://pith.science/api/pith-number/XP44J53UHCDK6S23L6SKJU72G7/events.json","paper":"https://pith.science/paper/XP44J53U"},"agent_actions":{"view_html":"https://pith.science/pith/XP44J53UHCDK6S23L6SKJU72G7","download_json":"https://pith.science/pith/XP44J53UHCDK6S23L6SKJU72G7.json","view_paper":"https://pith.science/paper/XP44J53U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.06265&json=true","fetch_graph":"https://pith.science/api/pith-number/XP44J53UHCDK6S23L6SKJU72G7/graph.json","fetch_events":"https://pith.science/api/pith-number/XP44J53UHCDK6S23L6SKJU72G7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XP44J53UHCDK6S23L6SKJU72G7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XP44J53UHCDK6S23L6SKJU72G7/action/storage_attestation","attest_author":"https://pith.science/pith/XP44J53UHCDK6S23L6SKJU72G7/action/author_attestation","sign_citation":"https://pith.science/pith/XP44J53UHCDK6S23L6SKJU72G7/action/citation_signature","submit_replication":"https://pith.science/pith/XP44J53UHCDK6S23L6SKJU72G7/action/replication_record"}},"created_at":"2026-05-17T23:51:00.530882+00:00","updated_at":"2026-05-17T23:51:00.530882+00:00"}