{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RZ3NJ7AU4EPGTCPCE5ZE452BJ5","short_pith_number":"pith:RZ3NJ7AU","schema_version":"1.0","canonical_sha256":"8e76d4fc14e11e6989e227724e77414f4d4d697cfd872f4e001512ea8412ff21","source":{"kind":"arxiv","id":"2011.06173","version":2},"attestation_state":"computed","paper":{"title":"On 3-Coloring of $(2P_4,C_5)$-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Aneta Pokorn\\'a, Jana Novotn\\'a, Tereza Klimo\\v{s}ov\\'a, Tom\\'a\\v{s} Masa\\v{r}\\'ik, V\\'it Jel\\'inek","submitted_at":"2020-11-12T02:50:00Z","abstract_excerpt":"The 3-coloring of hereditary graph classes has been a deeply-researched problem in the last decade. A hereditary graph class is characterized by a (possibly infinite) list of minimal forbidden induced subgraphs $H_1,H_2,\\ldots$; the graphs in the class are called $(H_1,H_2,\\ldots)$-free. The complexity of 3-coloring is far from being understood, even for classes defined by a few small forbidden induced subgraphs. For $H$-free graphs, the complexity is settled for any $H$ on up to seven vertices. There are only two unsolved cases on eight vertices, namely $2P_4$ and $P_8$. For $P_8$-free graphs"},"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":"2011.06173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-12T02:50:00Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"7451299a784d190397dc1f9d636fff248ac902b06360027763b6bf4f9ee009d0","abstract_canon_sha256":"39ed3aa4109af43b2b1bc19ea65652ad9f665cfc105ad782de49b3ace2334085"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:32:14.303213Z","signature_b64":"O0R6Ly9Kj1oMpzM5Up8UGwpPdeocFgPA3m8PlHgYkuxFZK35JH6OgbYP1P5q2NbFNZnc18nRck6EO388iJbhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e76d4fc14e11e6989e227724e77414f4d4d697cfd872f4e001512ea8412ff21","last_reissued_at":"2026-07-05T07:32:14.302681Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:32:14.302681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On 3-Coloring of $(2P_4,C_5)$-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Aneta Pokorn\\'a, Jana Novotn\\'a, Tereza Klimo\\v{s}ov\\'a, Tom\\'a\\v{s} Masa\\v{r}\\'ik, V\\'it Jel\\'inek","submitted_at":"2020-11-12T02:50:00Z","abstract_excerpt":"The 3-coloring of hereditary graph classes has been a deeply-researched problem in the last decade. A hereditary graph class is characterized by a (possibly infinite) list of minimal forbidden induced subgraphs $H_1,H_2,\\ldots$; the graphs in the class are called $(H_1,H_2,\\ldots)$-free. The complexity of 3-coloring is far from being understood, even for classes defined by a few small forbidden induced subgraphs. For $H$-free graphs, the complexity is settled for any $H$ on up to seven vertices. There are only two unsolved cases on eight vertices, namely $2P_4$ and $P_8$. For $P_8$-free graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.06173","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.06173/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.06173","created_at":"2026-07-05T07:32:14.302750+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.06173v2","created_at":"2026-07-05T07:32:14.302750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.06173","created_at":"2026-07-05T07:32:14.302750+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZ3NJ7AU4EPG","created_at":"2026-07-05T07:32:14.302750+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZ3NJ7AU4EPGTCPC","created_at":"2026-07-05T07:32:14.302750+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZ3NJ7AU","created_at":"2026-07-05T07:32:14.302750+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/RZ3NJ7AU4EPGTCPCE5ZE452BJ5","json":"https://pith.science/pith/RZ3NJ7AU4EPGTCPCE5ZE452BJ5.json","graph_json":"https://pith.science/api/pith-number/RZ3NJ7AU4EPGTCPCE5ZE452BJ5/graph.json","events_json":"https://pith.science/api/pith-number/RZ3NJ7AU4EPGTCPCE5ZE452BJ5/events.json","paper":"https://pith.science/paper/RZ3NJ7AU"},"agent_actions":{"view_html":"https://pith.science/pith/RZ3NJ7AU4EPGTCPCE5ZE452BJ5","download_json":"https://pith.science/pith/RZ3NJ7AU4EPGTCPCE5ZE452BJ5.json","view_paper":"https://pith.science/paper/RZ3NJ7AU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.06173&json=true","fetch_graph":"https://pith.science/api/pith-number/RZ3NJ7AU4EPGTCPCE5ZE452BJ5/graph.json","fetch_events":"https://pith.science/api/pith-number/RZ3NJ7AU4EPGTCPCE5ZE452BJ5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZ3NJ7AU4EPGTCPCE5ZE452BJ5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZ3NJ7AU4EPGTCPCE5ZE452BJ5/action/storage_attestation","attest_author":"https://pith.science/pith/RZ3NJ7AU4EPGTCPCE5ZE452BJ5/action/author_attestation","sign_citation":"https://pith.science/pith/RZ3NJ7AU4EPGTCPCE5ZE452BJ5/action/citation_signature","submit_replication":"https://pith.science/pith/RZ3NJ7AU4EPGTCPCE5ZE452BJ5/action/replication_record"}},"created_at":"2026-07-05T07:32:14.302750+00:00","updated_at":"2026-07-05T07:32:14.302750+00:00"}