{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:F55JXP5CPHFIYYGUYPHUQ2JGRK","short_pith_number":"pith:F55JXP5C","schema_version":"1.0","canonical_sha256":"2f7a9bbfa279ca8c60d4c3cf4869268ab07afd9bef86aa7eb5fa7a0dea963904","source":{"kind":"arxiv","id":"1709.09725","version":1},"attestation_state":"computed","paper":{"title":"Word-representability of split graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hehui Wu, Jun Ma, Sergey Kitaev, Yangjing Long","submitted_at":"2017-09-27T20:22:09Z","abstract_excerpt":"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 $xyxy\\cdots$ (of even or odd length) or a word $yxyx\\cdots$ (of even or odd length). A graph $G=(V,E)$ is word-representable if and only 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$. It is known that a graph is word-representable if and only if it admits a certain orientation called semi-transitive orientation.\n  Word-representable graphs generalize several important classes of graphs s"},"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":"1709.09725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-27T20:22:09Z","cross_cats_sorted":[],"title_canon_sha256":"7f39735cf8853b606908a3f4793a2aef3dc5ce004c72098a6d368c60c93204ec","abstract_canon_sha256":"9cd0ce439942dc660c50f7decedde6e582327d5d3e1c0e5cf155c18e83f8ca18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:06.937171Z","signature_b64":"sP01P1PPTtWMplXVqpAzgcjabh77wgrmwP2fEPgm5H/tGojYYNacx6etFN65x/xdT5hJqNId6i7h7GD/z9N+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f7a9bbfa279ca8c60d4c3cf4869268ab07afd9bef86aa7eb5fa7a0dea963904","last_reissued_at":"2026-05-18T00:34:06.936473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:06.936473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Word-representability of split graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hehui Wu, Jun Ma, Sergey Kitaev, Yangjing Long","submitted_at":"2017-09-27T20:22:09Z","abstract_excerpt":"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 $xyxy\\cdots$ (of even or odd length) or a word $yxyx\\cdots$ (of even or odd length). A graph $G=(V,E)$ is word-representable if and only 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$. It is known that a graph is word-representable if and only if it admits a certain orientation called semi-transitive orientation.\n  Word-representable graphs generalize several important classes of graphs s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.09725","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":"1709.09725","created_at":"2026-05-18T00:34:06.936591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.09725v1","created_at":"2026-05-18T00:34:06.936591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.09725","created_at":"2026-05-18T00:34:06.936591+00:00"},{"alias_kind":"pith_short_12","alias_value":"F55JXP5CPHFI","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"F55JXP5CPHFIYYGU","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"F55JXP5C","created_at":"2026-05-18T12:31:15.632608+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/F55JXP5CPHFIYYGUYPHUQ2JGRK","json":"https://pith.science/pith/F55JXP5CPHFIYYGUYPHUQ2JGRK.json","graph_json":"https://pith.science/api/pith-number/F55JXP5CPHFIYYGUYPHUQ2JGRK/graph.json","events_json":"https://pith.science/api/pith-number/F55JXP5CPHFIYYGUYPHUQ2JGRK/events.json","paper":"https://pith.science/paper/F55JXP5C"},"agent_actions":{"view_html":"https://pith.science/pith/F55JXP5CPHFIYYGUYPHUQ2JGRK","download_json":"https://pith.science/pith/F55JXP5CPHFIYYGUYPHUQ2JGRK.json","view_paper":"https://pith.science/paper/F55JXP5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.09725&json=true","fetch_graph":"https://pith.science/api/pith-number/F55JXP5CPHFIYYGUYPHUQ2JGRK/graph.json","fetch_events":"https://pith.science/api/pith-number/F55JXP5CPHFIYYGUYPHUQ2JGRK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F55JXP5CPHFIYYGUYPHUQ2JGRK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F55JXP5CPHFIYYGUYPHUQ2JGRK/action/storage_attestation","attest_author":"https://pith.science/pith/F55JXP5CPHFIYYGUYPHUQ2JGRK/action/author_attestation","sign_citation":"https://pith.science/pith/F55JXP5CPHFIYYGUYPHUQ2JGRK/action/citation_signature","submit_replication":"https://pith.science/pith/F55JXP5CPHFIYYGUYPHUQ2JGRK/action/replication_record"}},"created_at":"2026-05-18T00:34:06.936591+00:00","updated_at":"2026-05-18T00:34:06.936591+00:00"}