{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZK2RWSRATSDUGSZXY2S7U3H2AX","short_pith_number":"pith:ZK2RWSRA","schema_version":"1.0","canonical_sha256":"cab51b4a209c87434b37c6a5fa6cfa05e4b9e177a46c784eabffb5c45b67f952","source":{"kind":"arxiv","id":"1806.04673","version":1},"attestation_state":"computed","paper":{"title":"2-uniform words: cycle graphs, and an algorithm to verify specific word-representations of graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ameya Daigavane, Benny K. George, Mrityunjay Singh","submitted_at":"2018-06-12T13:01:51Z","abstract_excerpt":"For an arbitrary word $w$ on an alphabet, we can define the alternating symbol graph, $G(w)$, as the graph in which the edge $(a, b)$ is in $E$ iff the letters $a$ and $b$ alternate in the word $w$. A graph $G = (V, E)$ is said to be word-representable if $G = G(w)$ for some word $w$ on $V$.\n  The general problem of checking whether a graph is word-representable has been shown to be NP-complete. However, checking whether a given graph is a 2-uniform word-representable (each letter occurring exactly twice in the word) has an $O(V^2)$-time algorithm, described by Spinrad. Related to this, we pro"},"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":"1806.04673","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2018-06-12T13:01:51Z","cross_cats_sorted":[],"title_canon_sha256":"82116439b95938b44a5cfabb8114f056f7ccec66771140b223b72c605bac4eb9","abstract_canon_sha256":"77bc9997d73a7cca52b9d2f34244190c96fc7a58ea6a89c56b6e9060e4062a33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:21.101428Z","signature_b64":"VYjCS8ycgme1zLSAonZLxRXcWflJg6xs7SeKQEZejRVgPU3QUwrwjM40mI1uVp1IFASxz6Q5+EyvyaBa3m16AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cab51b4a209c87434b37c6a5fa6cfa05e4b9e177a46c784eabffb5c45b67f952","last_reissued_at":"2026-05-18T00:13:21.100856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:21.100856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"2-uniform words: cycle graphs, and an algorithm to verify specific word-representations of graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ameya Daigavane, Benny K. George, Mrityunjay Singh","submitted_at":"2018-06-12T13:01:51Z","abstract_excerpt":"For an arbitrary word $w$ on an alphabet, we can define the alternating symbol graph, $G(w)$, as the graph in which the edge $(a, b)$ is in $E$ iff the letters $a$ and $b$ alternate in the word $w$. A graph $G = (V, E)$ is said to be word-representable if $G = G(w)$ for some word $w$ on $V$.\n  The general problem of checking whether a graph is word-representable has been shown to be NP-complete. However, checking whether a given graph is a 2-uniform word-representable (each letter occurring exactly twice in the word) has an $O(V^2)$-time algorithm, described by Spinrad. Related to this, we pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04673","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":"1806.04673","created_at":"2026-05-18T00:13:21.100935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04673v1","created_at":"2026-05-18T00:13:21.100935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04673","created_at":"2026-05-18T00:13:21.100935+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZK2RWSRATSDU","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZK2RWSRATSDUGSZX","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZK2RWSRA","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1909.00019","citing_title":"Enumeration and Extensions of Word-representants","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX","json":"https://pith.science/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX.json","graph_json":"https://pith.science/api/pith-number/ZK2RWSRATSDUGSZXY2S7U3H2AX/graph.json","events_json":"https://pith.science/api/pith-number/ZK2RWSRATSDUGSZXY2S7U3H2AX/events.json","paper":"https://pith.science/paper/ZK2RWSRA"},"agent_actions":{"view_html":"https://pith.science/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX","download_json":"https://pith.science/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX.json","view_paper":"https://pith.science/paper/ZK2RWSRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04673&json=true","fetch_graph":"https://pith.science/api/pith-number/ZK2RWSRATSDUGSZXY2S7U3H2AX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZK2RWSRATSDUGSZXY2S7U3H2AX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX/action/storage_attestation","attest_author":"https://pith.science/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX/action/author_attestation","sign_citation":"https://pith.science/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX/action/citation_signature","submit_replication":"https://pith.science/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX/action/replication_record"}},"created_at":"2026-05-18T00:13:21.100935+00:00","updated_at":"2026-05-18T00:13:21.100935+00:00"}