{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DT2H43YTBBRQXVYOTSQMCX47DP","short_pith_number":"pith:DT2H43YT","schema_version":"1.0","canonical_sha256":"1cf47e6f1308630bd70e9ca0c15f9f1bee0900d7dc7acd91ac2611931f00f017","source":{"kind":"arxiv","id":"1412.4994","version":1},"attestation_state":"computed","paper":{"title":"Representing Graphs via Pattern Avoiding Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Artem Pyatkin, Jeffrey Remmel, Miles Jones, Sergey Kitaev","submitted_at":"2014-12-16T13:25:46Z","abstract_excerpt":"The notion of a word-representable graph has been studied in a series of papers in the literature. 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$ is an edge in $E$. If $V =\\{1, \\ldots, n\\}$, this is equivalent to saying that $G$ is word-representable if for all $x,y \\in \\{1, \\ldots, n\\}$, $xy \\in E$ if and only if the subword $w_{\\{x,y\\}}$ of $w$ consisting of all occurrences of $x$ or $y$ in $w$ has no consecutive occurrence of the pattern 11.\n  In this paper, we introduce the study of"},"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":"1412.4994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-16T13:25:46Z","cross_cats_sorted":[],"title_canon_sha256":"6c0a121b466d9890da28d7a9eb872599cc5b1b0a94db06d70344ac261cc454b4","abstract_canon_sha256":"89dc0953bf67cf3f76e8fcfcb586c49f0fe0e09b3d6fc523ecc5c9c27ec3ef44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:09.902958Z","signature_b64":"9cnnt7dKW5o5S8T1keoWXSO+aMijLB93UOjpPcWoKdKfIjm0uIzkwkZ1eiVbs7MU6gTyCUSRDhju9b0XY/2MAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf47e6f1308630bd70e9ca0c15f9f1bee0900d7dc7acd91ac2611931f00f017","last_reissued_at":"2026-05-18T02:31:09.902423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:09.902423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representing Graphs via Pattern Avoiding Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Artem Pyatkin, Jeffrey Remmel, Miles Jones, Sergey Kitaev","submitted_at":"2014-12-16T13:25:46Z","abstract_excerpt":"The notion of a word-representable graph has been studied in a series of papers in the literature. 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$ is an edge in $E$. If $V =\\{1, \\ldots, n\\}$, this is equivalent to saying that $G$ is word-representable if for all $x,y \\in \\{1, \\ldots, n\\}$, $xy \\in E$ if and only if the subword $w_{\\{x,y\\}}$ of $w$ consisting of all occurrences of $x$ or $y$ in $w$ has no consecutive occurrence of the pattern 11.\n  In this paper, we introduce the study of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4994","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":"1412.4994","created_at":"2026-05-18T02:31:09.902512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4994v1","created_at":"2026-05-18T02:31:09.902512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4994","created_at":"2026-05-18T02:31:09.902512+00:00"},{"alias_kind":"pith_short_12","alias_value":"DT2H43YTBBRQ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DT2H43YTBBRQXVYO","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DT2H43YT","created_at":"2026-05-18T12:28:25.294606+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/DT2H43YTBBRQXVYOTSQMCX47DP","json":"https://pith.science/pith/DT2H43YTBBRQXVYOTSQMCX47DP.json","graph_json":"https://pith.science/api/pith-number/DT2H43YTBBRQXVYOTSQMCX47DP/graph.json","events_json":"https://pith.science/api/pith-number/DT2H43YTBBRQXVYOTSQMCX47DP/events.json","paper":"https://pith.science/paper/DT2H43YT"},"agent_actions":{"view_html":"https://pith.science/pith/DT2H43YTBBRQXVYOTSQMCX47DP","download_json":"https://pith.science/pith/DT2H43YTBBRQXVYOTSQMCX47DP.json","view_paper":"https://pith.science/paper/DT2H43YT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4994&json=true","fetch_graph":"https://pith.science/api/pith-number/DT2H43YTBBRQXVYOTSQMCX47DP/graph.json","fetch_events":"https://pith.science/api/pith-number/DT2H43YTBBRQXVYOTSQMCX47DP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DT2H43YTBBRQXVYOTSQMCX47DP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DT2H43YTBBRQXVYOTSQMCX47DP/action/storage_attestation","attest_author":"https://pith.science/pith/DT2H43YTBBRQXVYOTSQMCX47DP/action/author_attestation","sign_citation":"https://pith.science/pith/DT2H43YTBBRQXVYOTSQMCX47DP/action/citation_signature","submit_replication":"https://pith.science/pith/DT2H43YTBBRQXVYOTSQMCX47DP/action/replication_record"}},"created_at":"2026-05-18T02:31:09.902512+00:00","updated_at":"2026-05-18T02:31:09.902512+00:00"}