{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:T4S7NS6A2WHG2MALFURO2QXCOI","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":"2c0b9c46bf86d31341e274fc1692475964dbcf10e2a3d6550c5b68290ee30029","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-08T10:46:04Z","title_canon_sha256":"5d4a3da3f70c6ffea8300b379d26a2e0775280d338f5fdfeced3f9f711fa6625"},"schema_version":"1.0","source":{"id":"1311.1928","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1928","created_at":"2026-05-18T02:39:25Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1928v3","created_at":"2026-05-18T02:39:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1928","created_at":"2026-05-18T02:39:25Z"},{"alias_kind":"pith_short_12","alias_value":"T4S7NS6A2WHG","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"T4S7NS6A2WHG2MAL","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"T4S7NS6A","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:57436857859a2f81926ac877ff9577883ef06a2c527c0b72ea92341ccc2c3a45","target":"graph","created_at":"2026-05-18T02:39:25Z","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"},"paper":{"abstract_excerpt":"A graph is unichord free if it does not contain a cycle with exactly one chord as its subgraph. In [3], it is shown that a graph is unichord free if and only if every minimal vertex separator is a stable set. In this paper, we first show that such a graph can be recognized in polynomial time. Further, we show that the chromatic number of unichord free graphs is one of (2,3, \\omega(G)). We also present a polynomial-time algorithm to produce a coloring with \\omega(G) colors.","authors_text":"Adithya Seshadri, Mahati Kumar, N.Sadagopan, S.Manasvini","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-08T10:46:04Z","title":"On Uni Chord Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1928","kind":"arxiv","version":3},"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:55ef491acfb1fcef0e55c9439ae7e2edfb31a0a9e0887adc58de7d1661ebea6f","target":"record","created_at":"2026-05-18T02:39:25Z","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":"2c0b9c46bf86d31341e274fc1692475964dbcf10e2a3d6550c5b68290ee30029","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-08T10:46:04Z","title_canon_sha256":"5d4a3da3f70c6ffea8300b379d26a2e0775280d338f5fdfeced3f9f711fa6625"},"schema_version":"1.0","source":{"id":"1311.1928","kind":"arxiv","version":3}},"canonical_sha256":"9f25f6cbc0d58e6d300b2d22ed42e2721c1d3d3ad350b12428e8536676b0ce69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f25f6cbc0d58e6d300b2d22ed42e2721c1d3d3ad350b12428e8536676b0ce69","first_computed_at":"2026-05-18T02:39:25.645092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:25.645092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Pji//xe9Awpa85JoExIRyiarYgK7Ky/UJieXiSeE4BbYfSPk/lcm9/hAO58kYoWnIssPCqspMqYORb0VO5tBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:25.645689Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.1928","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55ef491acfb1fcef0e55c9439ae7e2edfb31a0a9e0887adc58de7d1661ebea6f","sha256:57436857859a2f81926ac877ff9577883ef06a2c527c0b72ea92341ccc2c3a45"],"state_sha256":"47007cb3a9ae411cf95ac964d11bec37ae200a23af531c16b9bf9fc10f93b8ec"}