{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UKZWHD6ERVCNL2O6FIAANAQRMK","short_pith_number":"pith:UKZWHD6E","schema_version":"1.0","canonical_sha256":"a2b3638fc48d44d5e9de2a00068211629db780bdbe08f78f9c86d08a3a03912b","source":{"kind":"arxiv","id":"1909.00019","version":2},"attestation_state":"computed","paper":{"title":"Enumeration and Extensions of Word-representants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caleb Ji, Marisa Gaetz","submitted_at":"2019-08-30T18:14:52Z","abstract_excerpt":"Given a finite word $w$ over a finite alphabet $V$, consider the graph with vertex set $V$ and with an edge between two elements of $V$ if and only if the two elements alternate in the word $w$. Such a graph is said to be word-representable or 11-representable by the word $w$; this latter terminology arises from the phenomenon that the condition of two elements $x$ and $y$ alternating in a word $w$ is the same as the condition of the subword of $w$ induced by $x$ and $y$ avoiding the pattern 11. In this paper, we first study minimal length words which word-represent graphs, giving an explicit "},"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":"1909.00019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-30T18:14:52Z","cross_cats_sorted":[],"title_canon_sha256":"f693cf3eb896cb9fcdd6f04f9af8131fa55d9ce99c48e09ef2b375001a00899d","abstract_canon_sha256":"73c771a0010380a0a59aaf7976ea9156c53f194d4b51399da89c29ce536d5c1f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:06:47.736863Z","signature_b64":"1EsvDtovqdOa3/5eY6LTefaY0cSW51wTDYIK+Vs8A48yePuxh6jpnVyamC4JEHvv+WmgZuTpaoUNykiybRkmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2b3638fc48d44d5e9de2a00068211629db780bdbe08f78f9c86d08a3a03912b","last_reissued_at":"2026-07-05T02:06:47.736464Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:06:47.736464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration and Extensions of Word-representants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caleb Ji, Marisa Gaetz","submitted_at":"2019-08-30T18:14:52Z","abstract_excerpt":"Given a finite word $w$ over a finite alphabet $V$, consider the graph with vertex set $V$ and with an edge between two elements of $V$ if and only if the two elements alternate in the word $w$. Such a graph is said to be word-representable or 11-representable by the word $w$; this latter terminology arises from the phenomenon that the condition of two elements $x$ and $y$ alternating in a word $w$ is the same as the condition of the subword of $w$ induced by $x$ and $y$ avoiding the pattern 11. In this paper, we first study minimal length words which word-represent graphs, giving an explicit "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00019","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.00019/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.00019","created_at":"2026-07-05T02:06:47.736522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.00019v2","created_at":"2026-07-05T02:06:47.736522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00019","created_at":"2026-07-05T02:06:47.736522+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKZWHD6ERVCN","created_at":"2026-07-05T02:06:47.736522+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKZWHD6ERVCNL2O6","created_at":"2026-07-05T02:06:47.736522+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKZWHD6E","created_at":"2026-07-05T02:06:47.736522+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/UKZWHD6ERVCNL2O6FIAANAQRMK","json":"https://pith.science/pith/UKZWHD6ERVCNL2O6FIAANAQRMK.json","graph_json":"https://pith.science/api/pith-number/UKZWHD6ERVCNL2O6FIAANAQRMK/graph.json","events_json":"https://pith.science/api/pith-number/UKZWHD6ERVCNL2O6FIAANAQRMK/events.json","paper":"https://pith.science/paper/UKZWHD6E"},"agent_actions":{"view_html":"https://pith.science/pith/UKZWHD6ERVCNL2O6FIAANAQRMK","download_json":"https://pith.science/pith/UKZWHD6ERVCNL2O6FIAANAQRMK.json","view_paper":"https://pith.science/paper/UKZWHD6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.00019&json=true","fetch_graph":"https://pith.science/api/pith-number/UKZWHD6ERVCNL2O6FIAANAQRMK/graph.json","fetch_events":"https://pith.science/api/pith-number/UKZWHD6ERVCNL2O6FIAANAQRMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKZWHD6ERVCNL2O6FIAANAQRMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKZWHD6ERVCNL2O6FIAANAQRMK/action/storage_attestation","attest_author":"https://pith.science/pith/UKZWHD6ERVCNL2O6FIAANAQRMK/action/author_attestation","sign_citation":"https://pith.science/pith/UKZWHD6ERVCNL2O6FIAANAQRMK/action/citation_signature","submit_replication":"https://pith.science/pith/UKZWHD6ERVCNL2O6FIAANAQRMK/action/replication_record"}},"created_at":"2026-07-05T02:06:47.736522+00:00","updated_at":"2026-07-05T02:06:47.736522+00:00"}