{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QPQBFWWY4KCOA4YLEXRNMSXRHB","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":"474c185058f7f7df61d080c2b60d8a3b35e0fc5911297da511eb68a38cf36a7d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-04T06:21:59Z","title_canon_sha256":"050d8603c5b2599d4e0bc2d229ee03958d484cccb7868e98fd4ee5329fed2d44"},"schema_version":"1.0","source":{"id":"2605.02268","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.02268","created_at":"2026-05-25T02:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"2605.02268v2","created_at":"2026-05-25T02:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.02268","created_at":"2026-05-25T02:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"QPQBFWWY4KCO","created_at":"2026-05-25T02:01:21Z"},{"alias_kind":"pith_short_16","alias_value":"QPQBFWWY4KCOA4YL","created_at":"2026-05-25T02:01:21Z"},{"alias_kind":"pith_short_8","alias_value":"QPQBFWWY","created_at":"2026-05-25T02:01:21Z"}],"graph_snapshots":[{"event_id":"sha256:9e8728e811f366ff7d464d5a7a0c3f4b5a72915173e3c5631c8607994e2f5f51","target":"graph","created_at":"2026-05-25T02:01:21Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"we prove that the entire class of shift graphs is word-representable. We also introduce a natural generalization of shift graphs in which adjacency is defined by more than one shift condition, and show that these generalized shift graphs are likewise word-representable."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That a single word over the vertex alphabet can be arranged so the alternation condition holds simultaneously for every pair of adjacent and non-adjacent k-tuples under the given shift rules."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Shift graphs G(n,k) and generalized shift graphs are word-representable."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"All shift graphs and their multi-shift generalizations are word-representable."}],"snapshot_sha256":"b1787627b477539172acf0a135f8c018556d23cb7134ccf84b2204976d33530c"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ab633ea5588f05ef5e899b8edfc39486b7cc9bdfaaa620ea97eab56c2ac318f8"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T16:35:15.496541Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T03:31:22.995004Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T16:31:07.893280Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.02268/integrity.json","findings":[],"snapshot_sha256":"385669cf086d7f78b254890d32dae27d021ace883d10ceb27935d34ea8585161","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"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\\in E$. For integers $n>k>0 $, the shift graph $G(n,k)$ is the graph whose vertex set consists of all increasing $k$-tuples $(x_1,x_2,\\dots,x_k)$ with $1\\le x_1<x_2<\\cdots<x_k\\le n$, where two vertices $(x_1,\\dots,x_k)$ and $(y_1,\\dots,y_k)$ are adjacent whenever $x_{i+1}=y_i$ for all $1\\le i\\le k-1$ or $y_{i+1}=x_i$ for all $1\\le i\\le k-1$. Shift graphs are classical examples of sparse graphs having arbitrarily high chromatic number and odd ","authors_text":"Ramesh Hariharasubramanian, Suchanda Roy","cross_cats":["cs.DM"],"headline":"All shift graphs and their multi-shift generalizations are word-representable.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-04T06:21:59Z","title":"Word-Representability of Shift Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.02268","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T18:35:55.403098Z","id":"13d0a59f-8b64-4b83-b0b1-347030d4264d","model_set":{"reader":"grok-4.3"},"one_line_summary":"Shift graphs G(n,k) and generalized shift graphs are word-representable.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"All shift graphs and their multi-shift generalizations are word-representable.","strongest_claim":"we prove that the entire class of shift graphs is word-representable. We also introduce a natural generalization of shift graphs in which adjacency is defined by more than one shift condition, and show that these generalized shift graphs are likewise word-representable.","weakest_assumption":"That a single word over the vertex alphabet can be arranged so the alternation condition holds simultaneously for every pair of adjacent and non-adjacent k-tuples under the given shift rules."}},"verdict_id":"13d0a59f-8b64-4b83-b0b1-347030d4264d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b44e734b63f78cc3331301d83e538afe735dd83adfa91e63d56bc0225d1a4ede","target":"record","created_at":"2026-05-25T02:01:21Z","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":"474c185058f7f7df61d080c2b60d8a3b35e0fc5911297da511eb68a38cf36a7d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-04T06:21:59Z","title_canon_sha256":"050d8603c5b2599d4e0bc2d229ee03958d484cccb7868e98fd4ee5329fed2d44"},"schema_version":"1.0","source":{"id":"2605.02268","kind":"arxiv","version":2}},"canonical_sha256":"83e012dad8e284e0730b25e2d64af1384931542e3b19626f28724a2fb04c7e8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83e012dad8e284e0730b25e2d64af1384931542e3b19626f28724a2fb04c7e8b","first_computed_at":"2026-05-25T02:01:21.586179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:21.586179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4TFV3AWNB6fzCF568wUjDrfrTFeq1CjGWdPv0RYIxEvwe4lfXISkmaTIg1apoLd8O6d0uqsUpj5rExW/K/ooCw==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:21.586785Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.02268","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b44e734b63f78cc3331301d83e538afe735dd83adfa91e63d56bc0225d1a4ede","sha256:9e8728e811f366ff7d464d5a7a0c3f4b5a72915173e3c5631c8607994e2f5f51"],"state_sha256":"cd487d6eb597c73422531bf19990f31fece5196c85cc33429e3b5e3c7227219f"}