{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DT2H43YTBBRQXVYOTSQMCX47DP","short_pith_number":"pith:DT2H43YT","canonical_record":{"source":{"id":"1412.4994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-16T13:25:46Z","cross_cats_sorted":[],"title_canon_sha256":"6c0a121b466d9890da28d7a9eb872599cc5b1b0a94db06d70344ac261cc454b4","abstract_canon_sha256":"89dc0953bf67cf3f76e8fcfcb586c49f0fe0e09b3d6fc523ecc5c9c27ec3ef44"},"schema_version":"1.0"},"canonical_sha256":"1cf47e6f1308630bd70e9ca0c15f9f1bee0900d7dc7acd91ac2611931f00f017","source":{"kind":"arxiv","id":"1412.4994","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4994","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4994v1","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4994","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"pith_short_12","alias_value":"DT2H43YTBBRQ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DT2H43YTBBRQXVYO","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DT2H43YT","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DT2H43YTBBRQXVYOTSQMCX47DP","target":"record","payload":{"canonical_record":{"source":{"id":"1412.4994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-16T13:25:46Z","cross_cats_sorted":[],"title_canon_sha256":"6c0a121b466d9890da28d7a9eb872599cc5b1b0a94db06d70344ac261cc454b4","abstract_canon_sha256":"89dc0953bf67cf3f76e8fcfcb586c49f0fe0e09b3d6fc523ecc5c9c27ec3ef44"},"schema_version":"1.0"},"canonical_sha256":"1cf47e6f1308630bd70e9ca0c15f9f1bee0900d7dc7acd91ac2611931f00f017","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:09.902958Z","signature_b64":"9cnnt7dKW5o5S8T1keoWXSO+aMijLB93UOjpPcWoKdKfIjm0uIzkwkZ1eiVbs7MU6gTyCUSRDhju9b0XY/2MAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf47e6f1308630bd70e9ca0c15f9f1bee0900d7dc7acd91ac2611931f00f017","last_reissued_at":"2026-05-18T02:31:09.902423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:09.902423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.4994","source_version":1,"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-05-18T02:31:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UfA/r57PJthZ/WmB0lJtPZubVO8CVjEaxOU2crBxofA9ikLyRRQz9MawpXFezfCvh+NBaKHUYy8k8yo/l+B9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T22:02:54.195017Z"},"content_sha256":"b620ccbdb21cfe5c70c68e6ab642c5e329dab25cc1f7ed9dc5b981f20570a7c4","schema_version":"1.0","event_id":"sha256:b620ccbdb21cfe5c70c68e6ab642c5e329dab25cc1f7ed9dc5b981f20570a7c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DT2H43YTBBRQXVYOTSQMCX47DP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Representing Graphs via Pattern Avoiding Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Artem Pyatkin, Jeffrey Remmel, Miles Jones, Sergey Kitaev","submitted_at":"2014-12-16T13:25:46Z","abstract_excerpt":"The notion of a word-representable graph has been studied in a series of papers in the literature. 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$ is an edge in $E$. If $V =\\{1, \\ldots, n\\}$, this is equivalent to saying that $G$ is word-representable if for all $x,y \\in \\{1, \\ldots, n\\}$, $xy \\in E$ if and only if the subword $w_{\\{x,y\\}}$ of $w$ consisting of all occurrences of $x$ or $y$ in $w$ has no consecutive occurrence of the pattern 11.\n  In this paper, we introduce the study of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4994","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"},"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-05-18T02:31:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OitnkktYmB9F+PMrCgfiI2wd2bOufQ3eKBXbDxcQsrVTStCQIMaSWQC18WOSOcNHjSPU6ky0mj2imUgPx6zeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T22:02:54.195378Z"},"content_sha256":"48e02256c190962c23c3fbc93f7370c3ffe69ed64306b50f50bc9fb54b41e7ee","schema_version":"1.0","event_id":"sha256:48e02256c190962c23c3fbc93f7370c3ffe69ed64306b50f50bc9fb54b41e7ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DT2H43YTBBRQXVYOTSQMCX47DP/bundle.json","state_url":"https://pith.science/pith/DT2H43YTBBRQXVYOTSQMCX47DP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DT2H43YTBBRQXVYOTSQMCX47DP/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-06-28T22:02:54Z","links":{"resolver":"https://pith.science/pith/DT2H43YTBBRQXVYOTSQMCX47DP","bundle":"https://pith.science/pith/DT2H43YTBBRQXVYOTSQMCX47DP/bundle.json","state":"https://pith.science/pith/DT2H43YTBBRQXVYOTSQMCX47DP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DT2H43YTBBRQXVYOTSQMCX47DP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DT2H43YTBBRQXVYOTSQMCX47DP","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":"89dc0953bf67cf3f76e8fcfcb586c49f0fe0e09b3d6fc523ecc5c9c27ec3ef44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-16T13:25:46Z","title_canon_sha256":"6c0a121b466d9890da28d7a9eb872599cc5b1b0a94db06d70344ac261cc454b4"},"schema_version":"1.0","source":{"id":"1412.4994","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4994","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4994v1","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4994","created_at":"2026-05-18T02:31:09Z"},{"alias_kind":"pith_short_12","alias_value":"DT2H43YTBBRQ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DT2H43YTBBRQXVYO","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DT2H43YT","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:48e02256c190962c23c3fbc93f7370c3ffe69ed64306b50f50bc9fb54b41e7ee","target":"graph","created_at":"2026-05-18T02:31:09Z","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"},"paper":{"abstract_excerpt":"The notion of a word-representable graph has been studied in a series of papers in the literature. 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$ is an edge in $E$. If $V =\\{1, \\ldots, n\\}$, this is equivalent to saying that $G$ is word-representable if for all $x,y \\in \\{1, \\ldots, n\\}$, $xy \\in E$ if and only if the subword $w_{\\{x,y\\}}$ of $w$ consisting of all occurrences of $x$ or $y$ in $w$ has no consecutive occurrence of the pattern 11.\n  In this paper, we introduce the study of","authors_text":"Artem Pyatkin, Jeffrey Remmel, Miles Jones, Sergey Kitaev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-16T13:25:46Z","title":"Representing Graphs via Pattern Avoiding Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4994","kind":"arxiv","version":1},"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:b620ccbdb21cfe5c70c68e6ab642c5e329dab25cc1f7ed9dc5b981f20570a7c4","target":"record","created_at":"2026-05-18T02:31:09Z","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":"89dc0953bf67cf3f76e8fcfcb586c49f0fe0e09b3d6fc523ecc5c9c27ec3ef44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-16T13:25:46Z","title_canon_sha256":"6c0a121b466d9890da28d7a9eb872599cc5b1b0a94db06d70344ac261cc454b4"},"schema_version":"1.0","source":{"id":"1412.4994","kind":"arxiv","version":1}},"canonical_sha256":"1cf47e6f1308630bd70e9ca0c15f9f1bee0900d7dc7acd91ac2611931f00f017","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cf47e6f1308630bd70e9ca0c15f9f1bee0900d7dc7acd91ac2611931f00f017","first_computed_at":"2026-05-18T02:31:09.902423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:09.902423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9cnnt7dKW5o5S8T1keoWXSO+aMijLB93UOjpPcWoKdKfIjm0uIzkwkZ1eiVbs7MU6gTyCUSRDhju9b0XY/2MAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:09.902958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4994","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b620ccbdb21cfe5c70c68e6ab642c5e329dab25cc1f7ed9dc5b981f20570a7c4","sha256:48e02256c190962c23c3fbc93f7370c3ffe69ed64306b50f50bc9fb54b41e7ee"],"state_sha256":"73a79244199ffbeb2883686e149d2c091d203dfdb5350ca46f4984ea4411a4a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XohTpNaVu2M8OAlNyMw+X+XHjRBdR1PWKDfXgSb4DMldop/8Bs1v8M+9NcK8pDhglx9Ig4d40bUilML6sZp8Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T22:02:54.197195Z","bundle_sha256":"8843ef434a05296829758b7b2f7802c52b2e68403427205eac9ebda23f576980"}}