{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HV7G62L37MAXO23EY744TF7ZG4","short_pith_number":"pith:HV7G62L3","schema_version":"1.0","canonical_sha256":"3d7e6f697bfb01776b64c7f9c997f93718951436b97065998f7f671fabc765e8","source":{"kind":"arxiv","id":"2307.15036","version":1},"attestation_state":"computed","paper":{"title":"3-Coloring $C_4$ or $C_3$-free Diameter Two Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Tereza Klimo\\v{s}ov\\'a, Vibha Sahlot","submitted_at":"2023-07-27T17:43:16Z","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"},"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":"2307.15036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-27T17:43:16Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"77a5cb82c094a282bc91021a1fcdc1534ac003dc1507fca2b3c8fbd921905024","abstract_canon_sha256":"a105a92b5dc2e55140d3f368ff0a3f1f8e5c2d650e95597179bd5c31e8560960"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:35:21.158434Z","signature_b64":"4Jx3A/ObFKC5T0VY33RxLsBdZ3jt+3Eik1MvGu7RiXtk5hRG/Q1VBmpYi0SDqjCWgeZ3fRIBHWyQvY7PdExODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d7e6f697bfb01776b64c7f9c997f93718951436b97065998f7f671fabc765e8","last_reissued_at":"2026-07-05T06:35:21.157922Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:35:21.157922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"3-Coloring $C_4$ or $C_3$-free Diameter Two Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Tereza Klimo\\v{s}ov\\'a, Vibha Sahlot","submitted_at":"2023-07-27T17:43:16Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.15036","kind":"arxiv","version":1},"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/2307.15036/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":"2307.15036","created_at":"2026-07-05T06:35:21.157977+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.15036v1","created_at":"2026-07-05T06:35:21.157977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.15036","created_at":"2026-07-05T06:35:21.157977+00:00"},{"alias_kind":"pith_short_12","alias_value":"HV7G62L37MAX","created_at":"2026-07-05T06:35:21.157977+00:00"},{"alias_kind":"pith_short_16","alias_value":"HV7G62L37MAXO23E","created_at":"2026-07-05T06:35:21.157977+00:00"},{"alias_kind":"pith_short_8","alias_value":"HV7G62L3","created_at":"2026-07-05T06:35:21.157977+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/HV7G62L37MAXO23EY744TF7ZG4","json":"https://pith.science/pith/HV7G62L37MAXO23EY744TF7ZG4.json","graph_json":"https://pith.science/api/pith-number/HV7G62L37MAXO23EY744TF7ZG4/graph.json","events_json":"https://pith.science/api/pith-number/HV7G62L37MAXO23EY744TF7ZG4/events.json","paper":"https://pith.science/paper/HV7G62L3"},"agent_actions":{"view_html":"https://pith.science/pith/HV7G62L37MAXO23EY744TF7ZG4","download_json":"https://pith.science/pith/HV7G62L37MAXO23EY744TF7ZG4.json","view_paper":"https://pith.science/paper/HV7G62L3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.15036&json=true","fetch_graph":"https://pith.science/api/pith-number/HV7G62L37MAXO23EY744TF7ZG4/graph.json","fetch_events":"https://pith.science/api/pith-number/HV7G62L37MAXO23EY744TF7ZG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HV7G62L37MAXO23EY744TF7ZG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HV7G62L37MAXO23EY744TF7ZG4/action/storage_attestation","attest_author":"https://pith.science/pith/HV7G62L37MAXO23EY744TF7ZG4/action/author_attestation","sign_citation":"https://pith.science/pith/HV7G62L37MAXO23EY744TF7ZG4/action/citation_signature","submit_replication":"https://pith.science/pith/HV7G62L37MAXO23EY744TF7ZG4/action/replication_record"}},"created_at":"2026-07-05T06:35:21.157977+00:00","updated_at":"2026-07-05T06:35:21.157977+00:00"}