{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UKZWHD6ERVCNL2O6FIAANAQRMK","short_pith_number":"pith:UKZWHD6E","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"},"canonical_sha256":"a2b3638fc48d44d5e9de2a00068211629db780bdbe08f78f9c86d08a3a03912b","source":{"kind":"arxiv","id":"1909.00019","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00019","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00019v2","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00019","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"pith_short_12","alias_value":"UKZWHD6ERVCN","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"pith_short_16","alias_value":"UKZWHD6ERVCNL2O6","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"pith_short_8","alias_value":"UKZWHD6E","created_at":"2026-07-05T02:06:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UKZWHD6ERVCNL2O6FIAANAQRMK","target":"record","payload":{"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"},"canonical_sha256":"a2b3638fc48d44d5e9de2a00068211629db780bdbe08f78f9c86d08a3a03912b","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"},"source_kind":"arxiv","source_id":"1909.00019","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:06:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNrWMMl1PKynB8PpUxbYWm3INXM69pFDBk2PJh26sySjEtWuktuafMIatsbylZqCY7MyhLKiCGiIx4xNCQYUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T20:42:48.869486Z"},"content_sha256":"06b04f1399a99ac2f5a52c64d9a3c1f1cadd727422bae519a7eeba7c695e53be","schema_version":"1.0","event_id":"sha256:06b04f1399a99ac2f5a52c64d9a3c1f1cadd727422bae519a7eeba7c695e53be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UKZWHD6ERVCNL2O6FIAANAQRMK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:06:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8b7JpuQ/3//haU31s0YE/tOJy3+DC743ZfD2EBC5DQNRjKSvNYcyqZM2W3snyzES6Zdbe5X9QGEZGobxpuLbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T20:42:48.869996Z"},"content_sha256":"21270c19e1e9f0eeeef86d6f3bb7153829c526cc5f1b27b89a864d18ef7c619e","schema_version":"1.0","event_id":"sha256:21270c19e1e9f0eeeef86d6f3bb7153829c526cc5f1b27b89a864d18ef7c619e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKZWHD6ERVCNL2O6FIAANAQRMK/bundle.json","state_url":"https://pith.science/pith/UKZWHD6ERVCNL2O6FIAANAQRMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKZWHD6ERVCNL2O6FIAANAQRMK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-20T20:42:48Z","links":{"resolver":"https://pith.science/pith/UKZWHD6ERVCNL2O6FIAANAQRMK","bundle":"https://pith.science/pith/UKZWHD6ERVCNL2O6FIAANAQRMK/bundle.json","state":"https://pith.science/pith/UKZWHD6ERVCNL2O6FIAANAQRMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKZWHD6ERVCNL2O6FIAANAQRMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UKZWHD6ERVCNL2O6FIAANAQRMK","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":"73c771a0010380a0a59aaf7976ea9156c53f194d4b51399da89c29ce536d5c1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-30T18:14:52Z","title_canon_sha256":"f693cf3eb896cb9fcdd6f04f9af8131fa55d9ce99c48e09ef2b375001a00899d"},"schema_version":"1.0","source":{"id":"1909.00019","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00019","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00019v2","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00019","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"pith_short_12","alias_value":"UKZWHD6ERVCN","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"pith_short_16","alias_value":"UKZWHD6ERVCNL2O6","created_at":"2026-07-05T02:06:47Z"},{"alias_kind":"pith_short_8","alias_value":"UKZWHD6E","created_at":"2026-07-05T02:06:47Z"}],"graph_snapshots":[{"event_id":"sha256:21270c19e1e9f0eeeef86d6f3bb7153829c526cc5f1b27b89a864d18ef7c619e","target":"graph","created_at":"2026-07-05T02:06:47Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.00019/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Caleb Ji, Marisa Gaetz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-30T18:14:52Z","title":"Enumeration and Extensions of Word-representants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00019","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:06b04f1399a99ac2f5a52c64d9a3c1f1cadd727422bae519a7eeba7c695e53be","target":"record","created_at":"2026-07-05T02:06:47Z","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":"73c771a0010380a0a59aaf7976ea9156c53f194d4b51399da89c29ce536d5c1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-30T18:14:52Z","title_canon_sha256":"f693cf3eb896cb9fcdd6f04f9af8131fa55d9ce99c48e09ef2b375001a00899d"},"schema_version":"1.0","source":{"id":"1909.00019","kind":"arxiv","version":2}},"canonical_sha256":"a2b3638fc48d44d5e9de2a00068211629db780bdbe08f78f9c86d08a3a03912b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2b3638fc48d44d5e9de2a00068211629db780bdbe08f78f9c86d08a3a03912b","first_computed_at":"2026-07-05T02:06:47.736464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:06:47.736464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1EsvDtovqdOa3/5eY6LTefaY0cSW51wTDYIK+Vs8A48yePuxh6jpnVyamC4JEHvv+WmgZuTpaoUNykiybRkmDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:06:47.736863Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.00019","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06b04f1399a99ac2f5a52c64d9a3c1f1cadd727422bae519a7eeba7c695e53be","sha256:21270c19e1e9f0eeeef86d6f3bb7153829c526cc5f1b27b89a864d18ef7c619e"],"state_sha256":"9bb315b4e9325fe1ac92eb1f8b57f2f17b9dbcfce1fe0ae402af6f8ab906de6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VuyqYqULLnGQz+wyxGESKeEgus9uKaRg/E1766+pdC+5L8UlFyrN8MyYG+TO6DT7G9G2RgI9wvTGytYOhzlDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T20:42:48.875732Z","bundle_sha256":"7b0b79384c3ff8fc9dc3b06a1c901dd3d089379ea751268e311589e8530b531c"}}