{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZGW4MJ6VAE4VCKJ2S6OZFNXOLA","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":"30582a0027353d68f7c6adae305a35211cb8dbbeff613938bbb35cc71f849858","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-02T17:25:47Z","title_canon_sha256":"b2a83669f8ed8bfced568db439af509a3f41dc2c2af4c4d484fa0904463b90d0"},"schema_version":"1.0","source":{"id":"1609.00674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00674","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00674v1","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00674","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZGW4MJ6VAE4V","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZGW4MJ6VAE4VCKJ2","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZGW4MJ6V","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:88fb18a0c4d66c429c5c765e929e197f63907a58b435641a442bc44f23e58d94","target":"graph","created_at":"2026-05-18T01:06:23Z","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$ 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,","authors_text":"Artem Pyatkin, Marc Glen, Sergey Kitaev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-02T17:25:47Z","title":"On the representation number of a crown graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00674","kind":"arxiv","version":1},"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:6a90d71263c29ba1b6761b5377d1a0b4aed2d30305811d0ca2104480e08cb452","target":"record","created_at":"2026-05-18T01:06:23Z","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":"30582a0027353d68f7c6adae305a35211cb8dbbeff613938bbb35cc71f849858","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-02T17:25:47Z","title_canon_sha256":"b2a83669f8ed8bfced568db439af509a3f41dc2c2af4c4d484fa0904463b90d0"},"schema_version":"1.0","source":{"id":"1609.00674","kind":"arxiv","version":1}},"canonical_sha256":"c9adc627d5013951293a979d92b6ee5835cf0a2ef13e9b6b93345ba781ec7d24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9adc627d5013951293a979d92b6ee5835cf0a2ef13e9b6b93345ba781ec7d24","first_computed_at":"2026-05-18T01:06:23.463751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:23.463751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cn4sa+qoDjtnXggR8PdNSRnaPoh+tlMRmp6nFfLm0iMYEoSPn8f0N4NLKwLa0/yyg2P/OgyWhuhBlCLETS8zDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:23.464203Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a90d71263c29ba1b6761b5377d1a0b4aed2d30305811d0ca2104480e08cb452","sha256:88fb18a0c4d66c429c5c765e929e197f63907a58b435641a442bc44f23e58d94"],"state_sha256":"20bb9eab5f5d5fe8cd24c606b2fa679d76486c5704f2d343b8cfc72588fd70a4"}