{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PELHRBCTDZUFKKDGMEITKNXBQN","short_pith_number":"pith:PELHRBCT","schema_version":"1.0","canonical_sha256":"79167884531e6855286661113536e1834ffe4e65eab452e1db58e83afe6ace9f","source":{"kind":"arxiv","id":"1501.07108","version":1},"attestation_state":"computed","paper":{"title":"Semi-Transitive Orientations and Word-Representable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Artem Pyatkin, Magn\\'us M. Halld\\'orsson, Sergey Kitaev","submitted_at":"2015-01-28T14:05:46Z","abstract_excerpt":"A graph $G=(V,E)$ is a \\emph{word-representable graph} if there exists a word $W$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $W$ if and only if $(x,y)\\in E$ for each $x\\neq y$.\n  In this paper we give an effective characterization of word-representable graphs in terms of orientations. Namely, we show that a graph is word-representable if and only if it admits a \\emph{semi-transitive orientation} defined in the paper. This allows us to prove a number of results about word-representable graphs, in particular showing that the recognition problem is in NP, and that word-repre"},"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":"1501.07108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-28T14:05:46Z","cross_cats_sorted":[],"title_canon_sha256":"8c3f799fc218eee00b3678c37851c97d52a99ff9278c3dd9c0c17ab6826f3a80","abstract_canon_sha256":"c636dc3a34f8362c04a8193720c7660f2256689df20c63c27d097ebca76a2dee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:30.225612Z","signature_b64":"ZzJ4ZNUWHEYKFRf6e/4rK3AC2oawkoZzju7a4KP9LyYwQVVt2Gr5ML1e0Rw3ky0tiGKLEaRO1qjMVvyX/nhVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79167884531e6855286661113536e1834ffe4e65eab452e1db58e83afe6ace9f","last_reissued_at":"2026-05-18T02:28:30.224971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:30.224971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-Transitive Orientations and Word-Representable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Artem Pyatkin, Magn\\'us M. Halld\\'orsson, Sergey Kitaev","submitted_at":"2015-01-28T14:05:46Z","abstract_excerpt":"A graph $G=(V,E)$ is a \\emph{word-representable graph} if there exists a word $W$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $W$ if and only if $(x,y)\\in E$ for each $x\\neq y$.\n  In this paper we give an effective characterization of word-representable graphs in terms of orientations. Namely, we show that a graph is word-representable if and only if it admits a \\emph{semi-transitive orientation} defined in the paper. This allows us to prove a number of results about word-representable graphs, in particular showing that the recognition problem is in NP, and that word-repre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07108","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":""},"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":"1501.07108","created_at":"2026-05-18T02:28:30.225061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07108v1","created_at":"2026-05-18T02:28:30.225061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07108","created_at":"2026-05-18T02:28:30.225061+00:00"},{"alias_kind":"pith_short_12","alias_value":"PELHRBCTDZUF","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PELHRBCTDZUFKKDG","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PELHRBCT","created_at":"2026-05-18T12:29:37.295048+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/PELHRBCTDZUFKKDGMEITKNXBQN","json":"https://pith.science/pith/PELHRBCTDZUFKKDGMEITKNXBQN.json","graph_json":"https://pith.science/api/pith-number/PELHRBCTDZUFKKDGMEITKNXBQN/graph.json","events_json":"https://pith.science/api/pith-number/PELHRBCTDZUFKKDGMEITKNXBQN/events.json","paper":"https://pith.science/paper/PELHRBCT"},"agent_actions":{"view_html":"https://pith.science/pith/PELHRBCTDZUFKKDGMEITKNXBQN","download_json":"https://pith.science/pith/PELHRBCTDZUFKKDGMEITKNXBQN.json","view_paper":"https://pith.science/paper/PELHRBCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07108&json=true","fetch_graph":"https://pith.science/api/pith-number/PELHRBCTDZUFKKDGMEITKNXBQN/graph.json","fetch_events":"https://pith.science/api/pith-number/PELHRBCTDZUFKKDGMEITKNXBQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PELHRBCTDZUFKKDGMEITKNXBQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PELHRBCTDZUFKKDGMEITKNXBQN/action/storage_attestation","attest_author":"https://pith.science/pith/PELHRBCTDZUFKKDGMEITKNXBQN/action/author_attestation","sign_citation":"https://pith.science/pith/PELHRBCTDZUFKKDGMEITKNXBQN/action/citation_signature","submit_replication":"https://pith.science/pith/PELHRBCTDZUFKKDGMEITKNXBQN/action/replication_record"}},"created_at":"2026-05-18T02:28:30.225061+00:00","updated_at":"2026-05-18T02:28:30.225061+00:00"}