{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IVEYMR4ZZEU2CUHDVGLDLOZTI4","short_pith_number":"pith:IVEYMR4Z","schema_version":"1.0","canonical_sha256":"4549864799c929a150e3a99635bb33473cc1da181ec72dea0834fa20c7cb1243","source":{"kind":"arxiv","id":"1409.4054","version":2},"attestation_state":"computed","paper":{"title":"Planar graphs without 5-cycles and intersecting triangles are $(1,1,0)$-colorable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gexin Yu, Runrun Liu, Xiangwen Li","submitted_at":"2014-09-14T13:34:09Z","abstract_excerpt":"A $(c_1,c_2,...,c_k)$-coloring of $G$ is a mapping $\\varphi:V(G)\\mapsto\\{1,2,...,k\\}$ such that for every $i,1 \\leq i \\leq k$, $G[V_i]$ has maximum degree at most $c_i$, where $G[V_i]$ denotes the subgraph induced by the vertices colored $i$. Borodin and Raspaud conjecture that every planar graph without $5$-cycles and intersecting triangles is $(0,0,0)$-colorable. We prove in this paper that such graphs are $(1,1,0)$-colorable."},"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":"1409.4054","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-14T13:34:09Z","cross_cats_sorted":[],"title_canon_sha256":"07bfbd3d74e9ebb64cfd53fb2e08abf8616319cdada12e6e4bc481d7c4c66a45","abstract_canon_sha256":"ddee20785a9a43877419b5115ab5a3f2bc1ee0713c9458b5029526d6a9df7055"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:52.858800Z","signature_b64":"LFCTbPvbgJnZQspOCRhLmr2stv/HjMq+YjYAZZDqaFFfwF/+p/FGufDs68It9tZLE0F/cMyoC8G7e5aIKDekCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4549864799c929a150e3a99635bb33473cc1da181ec72dea0834fa20c7cb1243","last_reissued_at":"2026-05-18T02:41:52.858132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:52.858132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar graphs without 5-cycles and intersecting triangles are $(1,1,0)$-colorable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gexin Yu, Runrun Liu, Xiangwen Li","submitted_at":"2014-09-14T13:34:09Z","abstract_excerpt":"A $(c_1,c_2,...,c_k)$-coloring of $G$ is a mapping $\\varphi:V(G)\\mapsto\\{1,2,...,k\\}$ such that for every $i,1 \\leq i \\leq k$, $G[V_i]$ has maximum degree at most $c_i$, where $G[V_i]$ denotes the subgraph induced by the vertices colored $i$. Borodin and Raspaud conjecture that every planar graph without $5$-cycles and intersecting triangles is $(0,0,0)$-colorable. We prove in this paper that such graphs are $(1,1,0)$-colorable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4054","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":"1409.4054","created_at":"2026-05-18T02:41:52.858224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.4054v2","created_at":"2026-05-18T02:41:52.858224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4054","created_at":"2026-05-18T02:41:52.858224+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVEYMR4ZZEU2","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVEYMR4ZZEU2CUHD","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVEYMR4Z","created_at":"2026-05-18T12:28:33.132498+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/IVEYMR4ZZEU2CUHDVGLDLOZTI4","json":"https://pith.science/pith/IVEYMR4ZZEU2CUHDVGLDLOZTI4.json","graph_json":"https://pith.science/api/pith-number/IVEYMR4ZZEU2CUHDVGLDLOZTI4/graph.json","events_json":"https://pith.science/api/pith-number/IVEYMR4ZZEU2CUHDVGLDLOZTI4/events.json","paper":"https://pith.science/paper/IVEYMR4Z"},"agent_actions":{"view_html":"https://pith.science/pith/IVEYMR4ZZEU2CUHDVGLDLOZTI4","download_json":"https://pith.science/pith/IVEYMR4ZZEU2CUHDVGLDLOZTI4.json","view_paper":"https://pith.science/paper/IVEYMR4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.4054&json=true","fetch_graph":"https://pith.science/api/pith-number/IVEYMR4ZZEU2CUHDVGLDLOZTI4/graph.json","fetch_events":"https://pith.science/api/pith-number/IVEYMR4ZZEU2CUHDVGLDLOZTI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVEYMR4ZZEU2CUHDVGLDLOZTI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVEYMR4ZZEU2CUHDVGLDLOZTI4/action/storage_attestation","attest_author":"https://pith.science/pith/IVEYMR4ZZEU2CUHDVGLDLOZTI4/action/author_attestation","sign_citation":"https://pith.science/pith/IVEYMR4ZZEU2CUHDVGLDLOZTI4/action/citation_signature","submit_replication":"https://pith.science/pith/IVEYMR4ZZEU2CUHDVGLDLOZTI4/action/replication_record"}},"created_at":"2026-05-18T02:41:52.858224+00:00","updated_at":"2026-05-18T02:41:52.858224+00:00"}