{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PELHRBCTDZUFKKDGMEITKNXBQN","short_pith_number":"pith:PELHRBCT","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"},"canonical_sha256":"79167884531e6855286661113536e1834ffe4e65eab452e1db58e83afe6ace9f","source":{"kind":"arxiv","id":"1501.07108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07108","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07108v1","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07108","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"PELHRBCTDZUF","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PELHRBCTDZUFKKDG","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PELHRBCT","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PELHRBCTDZUFKKDGMEITKNXBQN","target":"record","payload":{"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"},"canonical_sha256":"79167884531e6855286661113536e1834ffe4e65eab452e1db58e83afe6ace9f","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"},"source_kind":"arxiv","source_id":"1501.07108","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-18T02:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DWU6h9HLTBveoztua3NmqGkCDIOpLxoDYGnfNHDUt5pMv2rdWqczP4nt9UGBOYhCdzJtFedvbaoXV2vVwIgwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:40:34.470168Z"},"content_sha256":"644b7ac22f07620154661f2a53221247ba02bd6f16a1894ee7a24d484ab5deb0","schema_version":"1.0","event_id":"sha256:644b7ac22f07620154661f2a53221247ba02bd6f16a1894ee7a24d484ab5deb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PELHRBCTDZUFKKDGMEITKNXBQN","target":"graph","payload":{"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"},"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-18T02:28:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P/64gHqczqUnMgsh4XSoe3EBsNgxiakY1hmp7XKdGdVQnXfy+rE+C/jHJNzhJze2RKxnZiO+GbTposjD5H1rBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:40:34.470530Z"},"content_sha256":"4bcabc868f67c506250181427134192b9f33e45e35eb7b784615600873692e04","schema_version":"1.0","event_id":"sha256:4bcabc868f67c506250181427134192b9f33e45e35eb7b784615600873692e04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PELHRBCTDZUFKKDGMEITKNXBQN/bundle.json","state_url":"https://pith.science/pith/PELHRBCTDZUFKKDGMEITKNXBQN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PELHRBCTDZUFKKDGMEITKNXBQN/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-06-03T06:40:34Z","links":{"resolver":"https://pith.science/pith/PELHRBCTDZUFKKDGMEITKNXBQN","bundle":"https://pith.science/pith/PELHRBCTDZUFKKDGMEITKNXBQN/bundle.json","state":"https://pith.science/pith/PELHRBCTDZUFKKDGMEITKNXBQN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PELHRBCTDZUFKKDGMEITKNXBQN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PELHRBCTDZUFKKDGMEITKNXBQN","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":"c636dc3a34f8362c04a8193720c7660f2256689df20c63c27d097ebca76a2dee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-28T14:05:46Z","title_canon_sha256":"8c3f799fc218eee00b3678c37851c97d52a99ff9278c3dd9c0c17ab6826f3a80"},"schema_version":"1.0","source":{"id":"1501.07108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.07108","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"arxiv_version","alias_value":"1501.07108v1","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07108","created_at":"2026-05-18T02:28:30Z"},{"alias_kind":"pith_short_12","alias_value":"PELHRBCTDZUF","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PELHRBCTDZUFKKDG","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PELHRBCT","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:4bcabc868f67c506250181427134192b9f33e45e35eb7b784615600873692e04","target":"graph","created_at":"2026-05-18T02:28:30Z","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 $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","authors_text":"Artem Pyatkin, Magn\\'us M. Halld\\'orsson, Sergey Kitaev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-28T14:05:46Z","title":"Semi-Transitive Orientations and Word-Representable Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07108","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:644b7ac22f07620154661f2a53221247ba02bd6f16a1894ee7a24d484ab5deb0","target":"record","created_at":"2026-05-18T02:28:30Z","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":"c636dc3a34f8362c04a8193720c7660f2256689df20c63c27d097ebca76a2dee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-28T14:05:46Z","title_canon_sha256":"8c3f799fc218eee00b3678c37851c97d52a99ff9278c3dd9c0c17ab6826f3a80"},"schema_version":"1.0","source":{"id":"1501.07108","kind":"arxiv","version":1}},"canonical_sha256":"79167884531e6855286661113536e1834ffe4e65eab452e1db58e83afe6ace9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79167884531e6855286661113536e1834ffe4e65eab452e1db58e83afe6ace9f","first_computed_at":"2026-05-18T02:28:30.224971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:30.224971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZzJ4ZNUWHEYKFRf6e/4rK3AC2oawkoZzju7a4KP9LyYwQVVt2Gr5ML1e0Rw3ky0tiGKLEaRO1qjMVvyX/nhVDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:30.225612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.07108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:644b7ac22f07620154661f2a53221247ba02bd6f16a1894ee7a24d484ab5deb0","sha256:4bcabc868f67c506250181427134192b9f33e45e35eb7b784615600873692e04"],"state_sha256":"3db93d0b0902b6a2cec0d91b6592216b4f4572653fa10e588aecc58be6a6b830"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qFRqmC1Bfpz8r7bHxRbypnS5c5tsP5iq+KTGUllqeURFrHmxG/NidDjdTzlbD5okK35YTghxT/IIXiNaUXbaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:40:34.472487Z","bundle_sha256":"11e31d18c31c4b8a8d8d03c4df66f333b3203a9504f1102feee8e8e06c9107b8"}}