{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:W5VOAD4P3KBFDKWR3XFYBSA6J6","short_pith_number":"pith:W5VOAD4P","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"},"canonical_sha256":"b76ae00f8fda8251aad1ddcb80c81e4f85d7a6e213a4bd4546385fcc09bb4b4b","source":{"kind":"arxiv","id":"1903.02777","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02777","created_at":"2026-05-17T23:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02777v1","created_at":"2026-05-17T23:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02777","created_at":"2026-05-17T23:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"W5VOAD4P3KBF","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"W5VOAD4P3KBFDKWR","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"W5VOAD4P","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:W5VOAD4P3KBFDKWR3XFYBSA6J6","target":"record","payload":{"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"},"canonical_sha256":"b76ae00f8fda8251aad1ddcb80c81e4f85d7a6e213a4bd4546385fcc09bb4b4b","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"},"source_kind":"arxiv","source_id":"1903.02777","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJzGaOwAvwyYAjUNSCgYU+XVnVd5PAc0ZGblQhMjSSDdbdBRki9mlhq6qBk97UyEp5xrvhcplmMDkV/x6CpoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:09:12.714178Z"},"content_sha256":"521a86ffbf6101ff7abe800a347a5a5e0b2e04ff8f25d92b808dbd3888e48a3a","schema_version":"1.0","event_id":"sha256:521a86ffbf6101ff7abe800a347a5a5e0b2e04ff8f25d92b808dbd3888e48a3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:W5VOAD4P3KBFDKWR3XFYBSA6J6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVJgSRZ5bnUrQS66jRKKvg/s/FXR6K2iLjtZ/KoFTrX/oj/RjcE6GEyJOBPD/E9r4J8pQG2WS3PvBS+PqxIDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:09:12.714871Z"},"content_sha256":"d7135c3aad85228c66a764581771566f252f16a4898a421f5f3f5100efdd62e9","schema_version":"1.0","event_id":"sha256:d7135c3aad85228c66a764581771566f252f16a4898a421f5f3f5100efdd62e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6/bundle.json","state_url":"https://pith.science/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T06:09:12Z","links":{"resolver":"https://pith.science/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6","bundle":"https://pith.science/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6/bundle.json","state":"https://pith.science/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5VOAD4P3KBFDKWR3XFYBSA6J6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:W5VOAD4P3KBFDKWR3XFYBSA6J6","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":"f384ba59cdcd8940ab6e3d48a638b30f6415eb3a2d0f032bead431fa64635cbd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-07T09:05:18Z","title_canon_sha256":"14c1ea181fee1bc8a4e5fb9813ab3f13bdb626e264dd0841170a932bcc3626ab"},"schema_version":"1.0","source":{"id":"1903.02777","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02777","created_at":"2026-05-17T23:51:51Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02777v1","created_at":"2026-05-17T23:51:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02777","created_at":"2026-05-17T23:51:51Z"},{"alias_kind":"pith_short_12","alias_value":"W5VOAD4P3KBF","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"W5VOAD4P3KBFDKWR","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"W5VOAD4P","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:d7135c3aad85228c66a764581771566f252f16a4898a421f5f3f5100efdd62e9","target":"graph","created_at":"2026-05-17T23:51:51Z","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":"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 ","authors_text":"Akira Saito, Sergey Kitaev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-07T09:05:18Z","title":"On semi-transitive orientability of Kneser graphs and their complements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02777","kind":"arxiv","version":1},"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:521a86ffbf6101ff7abe800a347a5a5e0b2e04ff8f25d92b808dbd3888e48a3a","target":"record","created_at":"2026-05-17T23:51:51Z","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":"f384ba59cdcd8940ab6e3d48a638b30f6415eb3a2d0f032bead431fa64635cbd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-07T09:05:18Z","title_canon_sha256":"14c1ea181fee1bc8a4e5fb9813ab3f13bdb626e264dd0841170a932bcc3626ab"},"schema_version":"1.0","source":{"id":"1903.02777","kind":"arxiv","version":1}},"canonical_sha256":"b76ae00f8fda8251aad1ddcb80c81e4f85d7a6e213a4bd4546385fcc09bb4b4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b76ae00f8fda8251aad1ddcb80c81e4f85d7a6e213a4bd4546385fcc09bb4b4b","first_computed_at":"2026-05-17T23:51:51.148593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:51.148593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AHPM7lnoe8fMMNEex9IwOiJfW8klCk0QToGhlInrIgGbNHSVviOIzigV7Si22LHuAUMEMQ8leOcS/af9V3+CBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:51.149222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02777","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:521a86ffbf6101ff7abe800a347a5a5e0b2e04ff8f25d92b808dbd3888e48a3a","sha256:d7135c3aad85228c66a764581771566f252f16a4898a421f5f3f5100efdd62e9"],"state_sha256":"47787e81a9e2a34412b77ef5a6c2fc8cc01986f248be193ffedd0f2adeb62912"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DSZufa8i6ElI1Wtr5K2Ooa+dPfsH5GQQRjwJJY5wBMI9WkvtmprJPxFDe0ay26e+pa5wuEgonvkfq7MKDKGmCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:09:12.718894Z","bundle_sha256":"82ab68c98e7557b3141de92539bbe6e96a7066c6df2f03fa12a64b74f47a9edb"}}