{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5IAPJ5F2P4GFI3UMMCXQCVELO7","short_pith_number":"pith:5IAPJ5F2","schema_version":"1.0","canonical_sha256":"ea00f4f4ba7f0c546e8c60af01548b77eb5503cb76afaf8ab60b04ceaa0e570d","source":{"kind":"arxiv","id":"1803.01055","version":2},"attestation_state":"computed","paper":{"title":"On k-11-representable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Artem Pyatkin, Gi-Sang Cheon, Jinha Kim, Minki Kim, Sergey Kitaev","submitted_at":"2018-03-02T21:50:21Z","abstract_excerpt":"Distinct letters $x$ and $y$ alternate in a word $w$ if after deleting in $w$ all letters but the copies of $x$ and $y$ we either obtain a word of the form $xyxy\\cdots$ (of even or odd length) or a word of the form $yxyx\\cdots$ (of even or odd length). A simple 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$. Thus, edges of $G$ are defined by avoiding the consecutive pattern 11 in a word representing $G$, that is, by avoiding $xx$ and $yy$.\n  In 2017, Jeff Remmel has intr"},"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":"1803.01055","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-02T21:50:21Z","cross_cats_sorted":[],"title_canon_sha256":"1ff48a60c0ea4fb7c7c740064d1f7e6f731e59ad8d64529517ab2dd8d2d12d10","abstract_canon_sha256":"41222a27eaf67870aaa1893fe76e9ca6bdc1433be41684e5f05df78df26ec163"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:30.714576Z","signature_b64":"O7NLRhzIBHzJNRY75RDwRkw2PiZ2u/jFLUiHZBQxbP+i7PvDg/qRodO7DluxGqrSgcqHY7YHEIAyovuzeGn7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea00f4f4ba7f0c546e8c60af01548b77eb5503cb76afaf8ab60b04ceaa0e570d","last_reissued_at":"2026-05-18T00:06:30.713953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:30.713953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On k-11-representable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Artem Pyatkin, Gi-Sang Cheon, Jinha Kim, Minki Kim, Sergey Kitaev","submitted_at":"2018-03-02T21:50:21Z","abstract_excerpt":"Distinct letters $x$ and $y$ alternate in a word $w$ if after deleting in $w$ all letters but the copies of $x$ and $y$ we either obtain a word of the form $xyxy\\cdots$ (of even or odd length) or a word of the form $yxyx\\cdots$ (of even or odd length). A simple 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$. Thus, edges of $G$ are defined by avoiding the consecutive pattern 11 in a word representing $G$, that is, by avoiding $xx$ and $yy$.\n  In 2017, Jeff Remmel has intr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01055","kind":"arxiv","version":2},"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":"1803.01055","created_at":"2026-05-18T00:06:30.714045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.01055v2","created_at":"2026-05-18T00:06:30.714045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01055","created_at":"2026-05-18T00:06:30.714045+00:00"},{"alias_kind":"pith_short_12","alias_value":"5IAPJ5F2P4GF","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5IAPJ5F2P4GFI3UM","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5IAPJ5F2","created_at":"2026-05-18T12:32:08.215937+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/5IAPJ5F2P4GFI3UMMCXQCVELO7","json":"https://pith.science/pith/5IAPJ5F2P4GFI3UMMCXQCVELO7.json","graph_json":"https://pith.science/api/pith-number/5IAPJ5F2P4GFI3UMMCXQCVELO7/graph.json","events_json":"https://pith.science/api/pith-number/5IAPJ5F2P4GFI3UMMCXQCVELO7/events.json","paper":"https://pith.science/paper/5IAPJ5F2"},"agent_actions":{"view_html":"https://pith.science/pith/5IAPJ5F2P4GFI3UMMCXQCVELO7","download_json":"https://pith.science/pith/5IAPJ5F2P4GFI3UMMCXQCVELO7.json","view_paper":"https://pith.science/paper/5IAPJ5F2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.01055&json=true","fetch_graph":"https://pith.science/api/pith-number/5IAPJ5F2P4GFI3UMMCXQCVELO7/graph.json","fetch_events":"https://pith.science/api/pith-number/5IAPJ5F2P4GFI3UMMCXQCVELO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5IAPJ5F2P4GFI3UMMCXQCVELO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5IAPJ5F2P4GFI3UMMCXQCVELO7/action/storage_attestation","attest_author":"https://pith.science/pith/5IAPJ5F2P4GFI3UMMCXQCVELO7/action/author_attestation","sign_citation":"https://pith.science/pith/5IAPJ5F2P4GFI3UMMCXQCVELO7/action/citation_signature","submit_replication":"https://pith.science/pith/5IAPJ5F2P4GFI3UMMCXQCVELO7/action/replication_record"}},"created_at":"2026-05-18T00:06:30.714045+00:00","updated_at":"2026-05-18T00:06:30.714045+00:00"}