{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HV7G62L37MAXO23EY744TF7ZG4","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":"a105a92b5dc2e55140d3f368ff0a3f1f8e5c2d650e95597179bd5c31e8560960","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-27T17:43:16Z","title_canon_sha256":"77a5cb82c094a282bc91021a1fcdc1534ac003dc1507fca2b3c8fbd921905024"},"schema_version":"1.0","source":{"id":"2307.15036","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.15036","created_at":"2026-07-05T06:35:21Z"},{"alias_kind":"arxiv_version","alias_value":"2307.15036v1","created_at":"2026-07-05T06:35:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.15036","created_at":"2026-07-05T06:35:21Z"},{"alias_kind":"pith_short_12","alias_value":"HV7G62L37MAX","created_at":"2026-07-05T06:35:21Z"},{"alias_kind":"pith_short_16","alias_value":"HV7G62L37MAXO23E","created_at":"2026-07-05T06:35:21Z"},{"alias_kind":"pith_short_8","alias_value":"HV7G62L3","created_at":"2026-07-05T06:35:21Z"}],"graph_snapshots":[{"event_id":"sha256:7bff357291480f3dc679dcf03cfba3bfd1d404d452c2490f4cec8bcf5f4ff5d7","target":"graph","created_at":"2026-07-05T06:35:21Z","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/2307.15036/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The question of whether 3-Coloring can be solved in polynomial-time for the diameter two graphs is a well-known open problem in the area of algorithmic graph theory. We study the problem restricted to graph classes that avoid cycles of given lengths as induced subgraphs. Martin et. al. [CIAC 2021] showed that the problem is polynomial-time solvable for $C_5$-free or $C_6$-free graphs, and, $(C_4,C_s)$-free graphs where $s \\in \\{3,7,8,9\\}$. We extend their result proving that it is polynomial-time solvable for $(C_4,C_s)$-free graphs, for any constant $s$, and for $(C_3,C_7)$-free graphs. Our r","authors_text":"Tereza Klimo\\v{s}ov\\'a, Vibha Sahlot","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-27T17:43:16Z","title":"3-Coloring $C_4$ or $C_3$-free Diameter Two Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.15036","kind":"arxiv","version":1},"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:160c712a74e7b79e85b5e79e18b42357a1adaee120509a452fa465f32ab720ee","target":"record","created_at":"2026-07-05T06:35:21Z","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":"a105a92b5dc2e55140d3f368ff0a3f1f8e5c2d650e95597179bd5c31e8560960","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-27T17:43:16Z","title_canon_sha256":"77a5cb82c094a282bc91021a1fcdc1534ac003dc1507fca2b3c8fbd921905024"},"schema_version":"1.0","source":{"id":"2307.15036","kind":"arxiv","version":1}},"canonical_sha256":"3d7e6f697bfb01776b64c7f9c997f93718951436b97065998f7f671fabc765e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d7e6f697bfb01776b64c7f9c997f93718951436b97065998f7f671fabc765e8","first_computed_at":"2026-07-05T06:35:21.157922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:35:21.157922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Jx3A/ObFKC5T0VY33RxLsBdZ3jt+3Eik1MvGu7RiXtk5hRG/Q1VBmpYi0SDqjCWgeZ3fRIBHWyQvY7PdExODg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:35:21.158434Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.15036","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:160c712a74e7b79e85b5e79e18b42357a1adaee120509a452fa465f32ab720ee","sha256:7bff357291480f3dc679dcf03cfba3bfd1d404d452c2490f4cec8bcf5f4ff5d7"],"state_sha256":"85e763b42bf7da7c738620679a72cac817ffe59b862e744b13c0cf203f2545e4"}