{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:RZ3NJ7AU4EPGTCPCE5ZE452BJ5","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":"39ed3aa4109af43b2b1bc19ea65652ad9f665cfc105ad782de49b3ace2334085","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-12T02:50:00Z","title_canon_sha256":"7451299a784d190397dc1f9d636fff248ac902b06360027763b6bf4f9ee009d0"},"schema_version":"1.0","source":{"id":"2011.06173","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.06173","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"arxiv_version","alias_value":"2011.06173v2","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.06173","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"pith_short_12","alias_value":"RZ3NJ7AU4EPG","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"pith_short_16","alias_value":"RZ3NJ7AU4EPGTCPC","created_at":"2026-07-05T07:32:14Z"},{"alias_kind":"pith_short_8","alias_value":"RZ3NJ7AU","created_at":"2026-07-05T07:32:14Z"}],"graph_snapshots":[{"event_id":"sha256:531ec23f86633ee9c9d9db3fae7cfb24b1cce474ac694607def900e619e4d243","target":"graph","created_at":"2026-07-05T07:32: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.06173/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","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","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-12T02:50:00Z","title":"On 3-Coloring of $(2P_4,C_5)$-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.06173","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:dc0c6095daa52a6d73364f01f8255272473f58b10b9b32ade921d496c67d2c7d","target":"record","created_at":"2026-07-05T07:32: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":"39ed3aa4109af43b2b1bc19ea65652ad9f665cfc105ad782de49b3ace2334085","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-11-12T02:50:00Z","title_canon_sha256":"7451299a784d190397dc1f9d636fff248ac902b06360027763b6bf4f9ee009d0"},"schema_version":"1.0","source":{"id":"2011.06173","kind":"arxiv","version":2}},"canonical_sha256":"8e76d4fc14e11e6989e227724e77414f4d4d697cfd872f4e001512ea8412ff21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e76d4fc14e11e6989e227724e77414f4d4d697cfd872f4e001512ea8412ff21","first_computed_at":"2026-07-05T07:32:14.302681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:32:14.302681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O0R6Ly9Kj1oMpzM5Up8UGwpPdeocFgPA3m8PlHgYkuxFZK35JH6OgbYP1P5q2NbFNZnc18nRck6EO388iJbhAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:32:14.303213Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.06173","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc0c6095daa52a6d73364f01f8255272473f58b10b9b32ade921d496c67d2c7d","sha256:531ec23f86633ee9c9d9db3fae7cfb24b1cce474ac694607def900e619e4d243"],"state_sha256":"f2b06349c85dd6cb23a854b039f543039a58877e63b6b5fd0da5cd8abbcc05d5"}