{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:W5VOAD4P3KBFDKWR3XFYBSA6J6","short_pith_number":"pith:W5VOAD4P","schema_version":"1.0","canonical_sha256":"b76ae00f8fda8251aad1ddcb80c81e4f85d7a6e213a4bd4546385fcc09bb4b4b","source":{"kind":"arxiv","id":"1903.02777","version":1},"attestation_state":"computed","paper":{"title":"On semi-transitive orientability of Kneser graphs and their complements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akira Saito, Sergey Kitaev","submitted_at":"2019-03-07T09:05:18Z","abstract_excerpt":"An orientation of a graph is semi-transitive if it is acyclic, and for any directed path $v_0\\rightarrow v_1\\rightarrow \\cdots\\rightarrow v_k$ either there is no edge between $v_0$ and $v_k$, or $v_i\\rightarrow v_j$ is an edge for all $0\\leq i<j\\leq k$. An undirected graph is semi-transitive if it admits a semi-transitive orientation. Semi-transitive graphs include several important classes of graphs such as 3-colorable graphs, comparability graphs, and circle graphs, and they are precisely the class of word-representable graphs studied extensively in the literature.\n  In this paper, we study "},"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":"1903.02777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-07T09:05:18Z","cross_cats_sorted":[],"title_canon_sha256":"14c1ea181fee1bc8a4e5fb9813ab3f13bdb626e264dd0841170a932bcc3626ab","abstract_canon_sha256":"f384ba59cdcd8940ab6e3d48a638b30f6415eb3a2d0f032bead431fa64635cbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:51.149222Z","signature_b64":"AHPM7lnoe8fMMNEex9IwOiJfW8klCk0QToGhlInrIgGbNHSVviOIzigV7Si22LHuAUMEMQ8leOcS/af9V3+CBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b76ae00f8fda8251aad1ddcb80c81e4f85d7a6e213a4bd4546385fcc09bb4b4b","last_reissued_at":"2026-05-17T23:51:51.148593Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:51.148593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On semi-transitive orientability of Kneser graphs and their complements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akira Saito, Sergey Kitaev","submitted_at":"2019-03-07T09:05:18Z","abstract_excerpt":"An orientation of a graph is semi-transitive if it is acyclic, and for any directed path $v_0\\rightarrow v_1\\rightarrow \\cdots\\rightarrow v_k$ either there is no edge between $v_0$ and $v_k$, or $v_i\\rightarrow v_j$ is an edge for all $0\\leq i<j\\leq k$. An undirected graph is semi-transitive if it admits a semi-transitive orientation. Semi-transitive graphs include several important classes of graphs such as 3-colorable graphs, comparability graphs, and circle graphs, and they are precisely the class of word-representable graphs studied extensively in the literature.\n  In this paper, we study "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02777","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":"1903.02777","created_at":"2026-05-17T23:51:51.148672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02777v1","created_at":"2026-05-17T23:51:51.148672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02777","created_at":"2026-05-17T23:51:51.148672+00:00"},{"alias_kind":"pith_short_12","alias_value":"W5VOAD4P3KBF","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"W5VOAD4P3KBFDKWR","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"W5VOAD4P","created_at":"2026-05-18T12:33:30.264802+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/W5VOAD4P3KBFDKWR3XFYBSA6J6","json":"https://pith.science/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6.json","graph_json":"https://pith.science/api/pith-number/W5VOAD4P3KBFDKWR3XFYBSA6J6/graph.json","events_json":"https://pith.science/api/pith-number/W5VOAD4P3KBFDKWR3XFYBSA6J6/events.json","paper":"https://pith.science/paper/W5VOAD4P"},"agent_actions":{"view_html":"https://pith.science/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6","download_json":"https://pith.science/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6.json","view_paper":"https://pith.science/paper/W5VOAD4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02777&json=true","fetch_graph":"https://pith.science/api/pith-number/W5VOAD4P3KBFDKWR3XFYBSA6J6/graph.json","fetch_events":"https://pith.science/api/pith-number/W5VOAD4P3KBFDKWR3XFYBSA6J6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6/action/storage_attestation","attest_author":"https://pith.science/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6/action/author_attestation","sign_citation":"https://pith.science/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6/action/citation_signature","submit_replication":"https://pith.science/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6/action/replication_record"}},"created_at":"2026-05-17T23:51:51.148672+00:00","updated_at":"2026-05-17T23:51:51.148672+00:00"}