{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZGW4MJ6VAE4VCKJ2S6OZFNXOLA","short_pith_number":"pith:ZGW4MJ6V","schema_version":"1.0","canonical_sha256":"c9adc627d5013951293a979d92b6ee5835cf0a2ef13e9b6b93345ba781ec7d24","source":{"kind":"arxiv","id":"1609.00674","version":1},"attestation_state":"computed","paper":{"title":"On the representation number of a crown graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Artem Pyatkin, Marc Glen, Sergey Kitaev","submitted_at":"2016-09-02T17:25:47Z","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$ is an edge in $E$. It is known that any word-representable graph $G$ is $k$-word-representable for some $k$, that is, there exists a word $w$ representing $G$ such that each letter occurs exactly $k$ times in $w$. The minimum such $k$ is called $G$'s representation number.\n  A crown graph $H_{n,n}$ is a graph obtained from the complete bipartite graph $K_{n,n}$ by removing a perfect matching. In this paper we show that for $n\\geq 5$, $H_{n,"},"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":"1609.00674","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-02T17:25:47Z","cross_cats_sorted":[],"title_canon_sha256":"b2a83669f8ed8bfced568db439af509a3f41dc2c2af4c4d484fa0904463b90d0","abstract_canon_sha256":"30582a0027353d68f7c6adae305a35211cb8dbbeff613938bbb35cc71f849858"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:23.464203Z","signature_b64":"cn4sa+qoDjtnXggR8PdNSRnaPoh+tlMRmp6nFfLm0iMYEoSPn8f0N4NLKwLa0/yyg2P/OgyWhuhBlCLETS8zDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9adc627d5013951293a979d92b6ee5835cf0a2ef13e9b6b93345ba781ec7d24","last_reissued_at":"2026-05-18T01:06:23.463751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:23.463751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the representation number of a crown graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Artem Pyatkin, Marc Glen, Sergey Kitaev","submitted_at":"2016-09-02T17:25:47Z","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$ is an edge in $E$. It is known that any word-representable graph $G$ is $k$-word-representable for some $k$, that is, there exists a word $w$ representing $G$ such that each letter occurs exactly $k$ times in $w$. The minimum such $k$ is called $G$'s representation number.\n  A crown graph $H_{n,n}$ is a graph obtained from the complete bipartite graph $K_{n,n}$ by removing a perfect matching. In this paper we show that for $n\\geq 5$, $H_{n,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00674","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":"1609.00674","created_at":"2026-05-18T01:06:23.463815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00674v1","created_at":"2026-05-18T01:06:23.463815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00674","created_at":"2026-05-18T01:06:23.463815+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGW4MJ6VAE4V","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGW4MJ6VAE4VCKJ2","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGW4MJ6V","created_at":"2026-05-18T12:30:53.716459+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/ZGW4MJ6VAE4VCKJ2S6OZFNXOLA","json":"https://pith.science/pith/ZGW4MJ6VAE4VCKJ2S6OZFNXOLA.json","graph_json":"https://pith.science/api/pith-number/ZGW4MJ6VAE4VCKJ2S6OZFNXOLA/graph.json","events_json":"https://pith.science/api/pith-number/ZGW4MJ6VAE4VCKJ2S6OZFNXOLA/events.json","paper":"https://pith.science/paper/ZGW4MJ6V"},"agent_actions":{"view_html":"https://pith.science/pith/ZGW4MJ6VAE4VCKJ2S6OZFNXOLA","download_json":"https://pith.science/pith/ZGW4MJ6VAE4VCKJ2S6OZFNXOLA.json","view_paper":"https://pith.science/paper/ZGW4MJ6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00674&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGW4MJ6VAE4VCKJ2S6OZFNXOLA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGW4MJ6VAE4VCKJ2S6OZFNXOLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGW4MJ6VAE4VCKJ2S6OZFNXOLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGW4MJ6VAE4VCKJ2S6OZFNXOLA/action/storage_attestation","attest_author":"https://pith.science/pith/ZGW4MJ6VAE4VCKJ2S6OZFNXOLA/action/author_attestation","sign_citation":"https://pith.science/pith/ZGW4MJ6VAE4VCKJ2S6OZFNXOLA/action/citation_signature","submit_replication":"https://pith.science/pith/ZGW4MJ6VAE4VCKJ2S6OZFNXOLA/action/replication_record"}},"created_at":"2026-05-18T01:06:23.463815+00:00","updated_at":"2026-05-18T01:06:23.463815+00:00"}