{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5JJPWEJQPCLPRN5VAQIAFALUN4","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":"de6756320f7fe8b8c9744755380f6005be5549a6108f23fd9d003c3d04ff7262","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-24T05:45:16Z","title_canon_sha256":"ae284cdd4f7c1220e9914a1d26e467a728354ff7c633f93a16ad8b7dc210e152"},"schema_version":"1.0","source":{"id":"1507.06749","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06749","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06749v2","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06749","created_at":"2026-05-18T01:36:03Z"},{"alias_kind":"pith_short_12","alias_value":"5JJPWEJQPCLP","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5JJPWEJQPCLPRN5V","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5JJPWEJQ","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:9001038987af8adc2e75013cac0f55559eafcfc8bcca64877394505e6f392779","target":"graph","created_at":"2026-05-18T01:36:03Z","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 word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$, $x\\neq y$, alternate in $w$ if and only if $(x,y)\\in E$. Halld\\'{o}rsson et al.\\ have shown that a graph is word-representable if and only if it admits a so-called semi-transitive orientation. A corollary to this result is that any 3-colorable graph is word-representable.\n  Akrobotu et al.\\ have shown that a triangulation of a grid graph is word-representable if and only if it is 3-colorable. This result does not hold for triangulations of grid-covered cylinder graphs, namely","authors_text":"Brian Y. Sun, Sergey Kitaev, Thomas Z.Q. Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-24T05:45:16Z","title":"Word-representability of triangulations of grid-covered cylinder graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06749","kind":"arxiv","version":2},"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:de6cd989457fc83b8fdcc50d46bef6c6c408e1b6bae975cc5aff165eabdd1232","target":"record","created_at":"2026-05-18T01:36:03Z","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":"de6756320f7fe8b8c9744755380f6005be5549a6108f23fd9d003c3d04ff7262","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-24T05:45:16Z","title_canon_sha256":"ae284cdd4f7c1220e9914a1d26e467a728354ff7c633f93a16ad8b7dc210e152"},"schema_version":"1.0","source":{"id":"1507.06749","kind":"arxiv","version":2}},"canonical_sha256":"ea52fb11307896f8b7b504100281746f329c59f908241aeb5afc1d4270323b5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea52fb11307896f8b7b504100281746f329c59f908241aeb5afc1d4270323b5f","first_computed_at":"2026-05-18T01:36:03.300371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:03.300371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lsgm80B91v6by42hI4sAbrkLLCiLpb6rrZpl51CcY6COOzZitIkV5NOY5efr3D7bloHnpILueGE9jLkuMlqXBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:03.301023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06749","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de6cd989457fc83b8fdcc50d46bef6c6c408e1b6bae975cc5aff165eabdd1232","sha256:9001038987af8adc2e75013cac0f55559eafcfc8bcca64877394505e6f392779"],"state_sha256":"d0a6b704a2186d5db75c99ac42b1ec2bf1e0273c0ace5009631ee300d681e345"}