{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LCDSYEF7JK76RPSMPSV7UQBFMM","short_pith_number":"pith:LCDSYEF7","schema_version":"1.0","canonical_sha256":"58872c10bf4abfe8be4c7cabfa40256333d2b85df82c73205b891b7f1a0fc4dd","source":{"kind":"arxiv","id":"1802.04179","version":2},"attestation_state":"computed","paper":{"title":"Planar graphs without cycles of length 4 or 5 are (11:3)-colorable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaolan Hu, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2018-02-12T16:47:21Z","abstract_excerpt":"A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We show that every planar graph without cycles of length 4 or 5 is (11:3)-colorable, a weakening of recently disproved Steinberg's conjecture. In particular, each such graph with n vertices has an independent set of size at least 3n/11."},"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":"1802.04179","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-12T16:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"97703c04227bfdd761167f409089e755b23cb7799be410bbad35de1bdc33e6d0","abstract_canon_sha256":"2bdd0852379e567ab6aaa279a0a41a9281c622309849421451ff99de80cf1df9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:41.921130Z","signature_b64":"/0Cca0kxL3fbOmN9+NG8dmuEKVlvFoX88g20I0uRP+BjomysnY9j68pTVNXRs5vTEm85Y2K6xF1lbyVMFP5aAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58872c10bf4abfe8be4c7cabfa40256333d2b85df82c73205b891b7f1a0fc4dd","last_reissued_at":"2026-05-17T23:40:41.920484Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:41.920484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar graphs without cycles of length 4 or 5 are (11:3)-colorable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaolan Hu, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2018-02-12T16:47:21Z","abstract_excerpt":"A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We show that every planar graph without cycles of length 4 or 5 is (11:3)-colorable, a weakening of recently disproved Steinberg's conjecture. In particular, each such graph with n vertices has an independent set of size at least 3n/11."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04179","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":"1802.04179","created_at":"2026-05-17T23:40:41.920615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.04179v2","created_at":"2026-05-17T23:40:41.920615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04179","created_at":"2026-05-17T23:40:41.920615+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCDSYEF7JK76","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCDSYEF7JK76RPSM","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCDSYEF7","created_at":"2026-05-18T12:32:33.847187+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/LCDSYEF7JK76RPSMPSV7UQBFMM","json":"https://pith.science/pith/LCDSYEF7JK76RPSMPSV7UQBFMM.json","graph_json":"https://pith.science/api/pith-number/LCDSYEF7JK76RPSMPSV7UQBFMM/graph.json","events_json":"https://pith.science/api/pith-number/LCDSYEF7JK76RPSMPSV7UQBFMM/events.json","paper":"https://pith.science/paper/LCDSYEF7"},"agent_actions":{"view_html":"https://pith.science/pith/LCDSYEF7JK76RPSMPSV7UQBFMM","download_json":"https://pith.science/pith/LCDSYEF7JK76RPSMPSV7UQBFMM.json","view_paper":"https://pith.science/paper/LCDSYEF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.04179&json=true","fetch_graph":"https://pith.science/api/pith-number/LCDSYEF7JK76RPSMPSV7UQBFMM/graph.json","fetch_events":"https://pith.science/api/pith-number/LCDSYEF7JK76RPSMPSV7UQBFMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCDSYEF7JK76RPSMPSV7UQBFMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCDSYEF7JK76RPSMPSV7UQBFMM/action/storage_attestation","attest_author":"https://pith.science/pith/LCDSYEF7JK76RPSMPSV7UQBFMM/action/author_attestation","sign_citation":"https://pith.science/pith/LCDSYEF7JK76RPSMPSV7UQBFMM/action/citation_signature","submit_replication":"https://pith.science/pith/LCDSYEF7JK76RPSMPSV7UQBFMM/action/replication_record"}},"created_at":"2026-05-17T23:40:41.920615+00:00","updated_at":"2026-05-17T23:40:41.920615+00:00"}