{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:PYO555XOZB2YRSUPJEMJVFFAIS","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":"f839e4fcc63dce990d96cf56a5e5d4c2c65686f0d3f617c5b6381545a4c373cf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-20T07:50:43Z","title_canon_sha256":"70fd138756663bfeea33a69fd5ef3ec4375cc1cfca76d2c05a55def2cc2a4b95"},"schema_version":"1.0","source":{"id":"2210.14762","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.14762","created_at":"2026-07-05T06:30:02Z"},{"alias_kind":"arxiv_version","alias_value":"2210.14762v2","created_at":"2026-07-05T06:30:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.14762","created_at":"2026-07-05T06:30:02Z"},{"alias_kind":"pith_short_12","alias_value":"PYO555XOZB2Y","created_at":"2026-07-05T06:30:02Z"},{"alias_kind":"pith_short_16","alias_value":"PYO555XOZB2YRSUP","created_at":"2026-07-05T06:30:02Z"},{"alias_kind":"pith_short_8","alias_value":"PYO555XO","created_at":"2026-07-05T06:30:02Z"}],"graph_snapshots":[{"event_id":"sha256:76c2dfd510a85bbd8f37669f20626ea46c06fc8bbe88d0df2be56cec7e129193","target":"graph","created_at":"2026-07-05T06:30:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.14762/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"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$ alternate in $w$ if and only if $xy\\in E$. Word-representable graphs generalize several important classes of graphs such as $3$-colorable graphs, circle graphs, and comparability graphs. There is a long line of research in the literature dedicated to word-representable graphs. In this paper, we study word-representability of simplified de Bruijn graphs. The simplified de Bruijn graph $S(n,k)$ is a simple graph obtained from the de Bruijn graph $B(n,k)$ by removing orientations","authors_text":"Anthony V. Petyuk","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-20T07:50:43Z","title":"On word-representability of simplified de Bruijn graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.14762","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:c4db3f7a1efe85b197dbc43e51b606568b2d6aa1dfbc96c4b3a80b2ef5ee7dd5","target":"record","created_at":"2026-07-05T06:30:02Z","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":"f839e4fcc63dce990d96cf56a5e5d4c2c65686f0d3f617c5b6381545a4c373cf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-20T07:50:43Z","title_canon_sha256":"70fd138756663bfeea33a69fd5ef3ec4375cc1cfca76d2c05a55def2cc2a4b95"},"schema_version":"1.0","source":{"id":"2210.14762","kind":"arxiv","version":2}},"canonical_sha256":"7e1ddef6eec87588ca8f49189a94a044837f687352525b632894a64f2cc403df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e1ddef6eec87588ca8f49189a94a044837f687352525b632894a64f2cc403df","first_computed_at":"2026-07-05T06:30:02.523971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:30:02.523971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7wJba8rEpMnR2qWSlPwPkJl872KyM2+fVC0WlCRXx9Eys2sMqN5I6hi9kGmQ79KFRB/q8nW9oPc3FOY2y8+1AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:30:02.524476Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.14762","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4db3f7a1efe85b197dbc43e51b606568b2d6aa1dfbc96c4b3a80b2ef5ee7dd5","sha256:76c2dfd510a85bbd8f37669f20626ea46c06fc8bbe88d0df2be56cec7e129193"],"state_sha256":"5043f643f4571e8d1cb8a722db27c72a5611d816afbd01751fcf924a815c3f90"}