{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:T4S7NS6A2WHG2MALFURO2QXCOI","short_pith_number":"pith:T4S7NS6A","schema_version":"1.0","canonical_sha256":"9f25f6cbc0d58e6d300b2d22ed42e2721c1d3d3ad350b12428e8536676b0ce69","source":{"kind":"arxiv","id":"1311.1928","version":3},"attestation_state":"computed","paper":{"title":"On Uni Chord Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Adithya Seshadri, Mahati Kumar, N.Sadagopan, S.Manasvini","submitted_at":"2013-11-08T10:46:04Z","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."},"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":"1311.1928","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-08T10:46:04Z","cross_cats_sorted":[],"title_canon_sha256":"5d4a3da3f70c6ffea8300b379d26a2e0775280d338f5fdfeced3f9f711fa6625","abstract_canon_sha256":"2c0b9c46bf86d31341e274fc1692475964dbcf10e2a3d6550c5b68290ee30029"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:25.645689Z","signature_b64":"2Pji//xe9Awpa85JoExIRyiarYgK7Ky/UJieXiSeE4BbYfSPk/lcm9/hAO58kYoWnIssPCqspMqYORb0VO5tBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f25f6cbc0d58e6d300b2d22ed42e2721c1d3d3ad350b12428e8536676b0ce69","last_reissued_at":"2026-05-18T02:39:25.645092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:25.645092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Uni Chord Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Adithya Seshadri, Mahati Kumar, N.Sadagopan, S.Manasvini","submitted_at":"2013-11-08T10:46:04Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1928","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1311.1928","created_at":"2026-05-18T02:39:25.645171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.1928v3","created_at":"2026-05-18T02:39:25.645171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1928","created_at":"2026-05-18T02:39:25.645171+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4S7NS6A2WHG","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4S7NS6A2WHG2MAL","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4S7NS6A","created_at":"2026-05-18T12:27:59.945178+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/T4S7NS6A2WHG2MALFURO2QXCOI","json":"https://pith.science/pith/T4S7NS6A2WHG2MALFURO2QXCOI.json","graph_json":"https://pith.science/api/pith-number/T4S7NS6A2WHG2MALFURO2QXCOI/graph.json","events_json":"https://pith.science/api/pith-number/T4S7NS6A2WHG2MALFURO2QXCOI/events.json","paper":"https://pith.science/paper/T4S7NS6A"},"agent_actions":{"view_html":"https://pith.science/pith/T4S7NS6A2WHG2MALFURO2QXCOI","download_json":"https://pith.science/pith/T4S7NS6A2WHG2MALFURO2QXCOI.json","view_paper":"https://pith.science/paper/T4S7NS6A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.1928&json=true","fetch_graph":"https://pith.science/api/pith-number/T4S7NS6A2WHG2MALFURO2QXCOI/graph.json","fetch_events":"https://pith.science/api/pith-number/T4S7NS6A2WHG2MALFURO2QXCOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4S7NS6A2WHG2MALFURO2QXCOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4S7NS6A2WHG2MALFURO2QXCOI/action/storage_attestation","attest_author":"https://pith.science/pith/T4S7NS6A2WHG2MALFURO2QXCOI/action/author_attestation","sign_citation":"https://pith.science/pith/T4S7NS6A2WHG2MALFURO2QXCOI/action/citation_signature","submit_replication":"https://pith.science/pith/T4S7NS6A2WHG2MALFURO2QXCOI/action/replication_record"}},"created_at":"2026-05-18T02:39:25.645171+00:00","updated_at":"2026-05-18T02:39:25.645171+00:00"}