{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OGPVAUKJPPFUOYBY47DX6CUNEJ","short_pith_number":"pith:OGPVAUKJ","schema_version":"1.0","canonical_sha256":"719f5051497bcb476038e7c77f0a8d2255c7db3b0c047feac437438981e92271","source":{"kind":"arxiv","id":"2506.19493","version":1},"attestation_state":"computed","paper":{"title":"Word-Representable Graphs and Locality of Words","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Annika Huch, Jana Krei{\\ss}, Kajus Park, Max Wiedenh\\\"oft, Pamela Fleischmann, Philipp B\\\"oll, Tim L\\\"ock","submitted_at":"2025-06-24T10:27:55Z","abstract_excerpt":"In this work, we investigate the relationship between $k$-repre\\-sentable graphs and graphs representable by $k$-local words. In particular, we show that every graph representable by a $k$-local word is $(k+1)$-representable. A previous result about graphs represented by $1$-local words is revisited with new insights. Moreover, we investigate both classes of graphs w.r.t. hereditary and in particular the speed as a measure. We prove that the latter ones belong to the factorial layer and that the graphs in this classes have bounded clique-width."},"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":"2506.19493","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-24T10:27:55Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"936d2d97f23bdfa58d9977ad4975f623d2eab6640809e96cb427a295f5433757","abstract_canon_sha256":"a20afcb3de2b0faeea8a78d6ce6a83764645673304f41c766860efad410fa14f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:26:15.992075Z","signature_b64":"1ok3MjGHHWGxWmBOqO3ZxNdvklTfvZXyQ3UCoMsoBlgxmowd5ej7IiynnVxdCLL6bpA8MPk5T76gHDH9AMCfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"719f5051497bcb476038e7c77f0a8d2255c7db3b0c047feac437438981e92271","last_reissued_at":"2026-07-05T11:26:15.991575Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:26:15.991575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Word-Representable Graphs and Locality of Words","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Annika Huch, Jana Krei{\\ss}, Kajus Park, Max Wiedenh\\\"oft, Pamela Fleischmann, Philipp B\\\"oll, Tim L\\\"ock","submitted_at":"2025-06-24T10:27:55Z","abstract_excerpt":"In this work, we investigate the relationship between $k$-repre\\-sentable graphs and graphs representable by $k$-local words. In particular, we show that every graph representable by a $k$-local word is $(k+1)$-representable. A previous result about graphs represented by $1$-local words is revisited with new insights. Moreover, we investigate both classes of graphs w.r.t. hereditary and in particular the speed as a measure. We prove that the latter ones belong to the factorial layer and that the graphs in this classes have bounded clique-width."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.19493","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.19493/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":"2506.19493","created_at":"2026-07-05T11:26:15.991651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.19493v1","created_at":"2026-07-05T11:26:15.991651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.19493","created_at":"2026-07-05T11:26:15.991651+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGPVAUKJPPFU","created_at":"2026-07-05T11:26:15.991651+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGPVAUKJPPFUOYBY","created_at":"2026-07-05T11:26:15.991651+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGPVAUKJ","created_at":"2026-07-05T11:26:15.991651+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/OGPVAUKJPPFUOYBY47DX6CUNEJ","json":"https://pith.science/pith/OGPVAUKJPPFUOYBY47DX6CUNEJ.json","graph_json":"https://pith.science/api/pith-number/OGPVAUKJPPFUOYBY47DX6CUNEJ/graph.json","events_json":"https://pith.science/api/pith-number/OGPVAUKJPPFUOYBY47DX6CUNEJ/events.json","paper":"https://pith.science/paper/OGPVAUKJ"},"agent_actions":{"view_html":"https://pith.science/pith/OGPVAUKJPPFUOYBY47DX6CUNEJ","download_json":"https://pith.science/pith/OGPVAUKJPPFUOYBY47DX6CUNEJ.json","view_paper":"https://pith.science/paper/OGPVAUKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.19493&json=true","fetch_graph":"https://pith.science/api/pith-number/OGPVAUKJPPFUOYBY47DX6CUNEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/OGPVAUKJPPFUOYBY47DX6CUNEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGPVAUKJPPFUOYBY47DX6CUNEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGPVAUKJPPFUOYBY47DX6CUNEJ/action/storage_attestation","attest_author":"https://pith.science/pith/OGPVAUKJPPFUOYBY47DX6CUNEJ/action/author_attestation","sign_citation":"https://pith.science/pith/OGPVAUKJPPFUOYBY47DX6CUNEJ/action/citation_signature","submit_replication":"https://pith.science/pith/OGPVAUKJPPFUOYBY47DX6CUNEJ/action/replication_record"}},"created_at":"2026-07-05T11:26:15.991651+00:00","updated_at":"2026-07-05T11:26:15.991651+00:00"}