{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:376QEZGULZLSBQWKLGQDBB4GL7","short_pith_number":"pith:376QEZGU","canonical_record":{"source":{"id":"1307.1810","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-06T19:40:46Z","cross_cats_sorted":[],"title_canon_sha256":"b9cd08893eb6f88e48494e7d886d862d606579c1dd791122602ee2ae63d1fd4d","abstract_canon_sha256":"cb06f552c77682c12d78df3642a52ee15d23f5a6592d1c7a00b12726fe04a6ea"},"schema_version":"1.0"},"canonical_sha256":"dffd0264d45e5720c2ca59a03087865fcbd66007b57d744d16bb44d8ef1f3688","source":{"kind":"arxiv","id":"1307.1810","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1810","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1810v2","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1810","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"376QEZGULZLS","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"376QEZGULZLSBQWK","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"376QEZGU","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:376QEZGULZLSBQWKLGQDBB4GL7","target":"record","payload":{"canonical_record":{"source":{"id":"1307.1810","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-06T19:40:46Z","cross_cats_sorted":[],"title_canon_sha256":"b9cd08893eb6f88e48494e7d886d862d606579c1dd791122602ee2ae63d1fd4d","abstract_canon_sha256":"cb06f552c77682c12d78df3642a52ee15d23f5a6592d1c7a00b12726fe04a6ea"},"schema_version":"1.0"},"canonical_sha256":"dffd0264d45e5720c2ca59a03087865fcbd66007b57d744d16bb44d8ef1f3688","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:44.346093Z","signature_b64":"NuQ8nueH3RPG3iw9jAmkGo2yOgMpBmvcLiIBuh1I9Zo7kCTZyaczmioj4hAwChB0GHHkxqVOEcH+r4a2vIQVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dffd0264d45e5720c2ca59a03087865fcbd66007b57d744d16bb44d8ef1f3688","last_reissued_at":"2026-05-18T02:59:44.345181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:44.345181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.1810","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-05-18T02:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FmraevRPq2B/d2by+m9r3+6WvjDYnckCYCsJeyd6sgce75b6PdBr5OHzfhUD8U6pvZAscgEDgkTBDUpxYwf4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T00:16:02.299019Z"},"content_sha256":"e0c32b89ff6a664dba34c0ebc25bc51189cc3923f0f7127cb013d2205ae29aa8","schema_version":"1.0","event_id":"sha256:e0c32b89ff6a664dba34c0ebc25bc51189cc3923f0f7127cb013d2205ae29aa8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:376QEZGULZLSBQWKLGQDBB4GL7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New results on word-representable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Collins, Sergey Kitaev, Vadim Lozin","submitted_at":"2013-07-06T19:40:46Z","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 $(x,y)\\in E$ for each $x\\neq y$. The set of word-representable graphs generalizes several important and well-studied graph families, such as circle graphs, comparability graphs, 3-colorable graphs, graphs of vertex degree at most 3, etc. By answering an open question from [M. Halldorsson, S. Kitaev and A. Pyatkin, Alternation graphs, Lect. Notes Comput. Sci. 6986 (2011) 191--202. Proceedings of the 37th International Workshop on Graph-Theoretic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1810","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":""},"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:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XnZ23i/7vYLaS8k2QLtC+nsWiJsj9XzbwKS15GMkGDEeh+AX30K4rH4CGcCe1P4vT+zIXL9H8ruvJUpmyx8FAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T00:16:02.299606Z"},"content_sha256":"f568e9cce9bb65021247113a2d1ef794b9852062711fb656d028bdea259ad604","schema_version":"1.0","event_id":"sha256:f568e9cce9bb65021247113a2d1ef794b9852062711fb656d028bdea259ad604"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/376QEZGULZLSBQWKLGQDBB4GL7/bundle.json","state_url":"https://pith.science/pith/376QEZGULZLSBQWKLGQDBB4GL7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/376QEZGULZLSBQWKLGQDBB4GL7/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-08T00:16:02Z","links":{"resolver":"https://pith.science/pith/376QEZGULZLSBQWKLGQDBB4GL7","bundle":"https://pith.science/pith/376QEZGULZLSBQWKLGQDBB4GL7/bundle.json","state":"https://pith.science/pith/376QEZGULZLSBQWKLGQDBB4GL7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/376QEZGULZLSBQWKLGQDBB4GL7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:376QEZGULZLSBQWKLGQDBB4GL7","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":"cb06f552c77682c12d78df3642a52ee15d23f5a6592d1c7a00b12726fe04a6ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-06T19:40:46Z","title_canon_sha256":"b9cd08893eb6f88e48494e7d886d862d606579c1dd791122602ee2ae63d1fd4d"},"schema_version":"1.0","source":{"id":"1307.1810","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1810","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1810v2","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1810","created_at":"2026-05-18T02:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"376QEZGULZLS","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"376QEZGULZLSBQWK","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"376QEZGU","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:f568e9cce9bb65021247113a2d1ef794b9852062711fb656d028bdea259ad604","target":"graph","created_at":"2026-05-18T02:59:44Z","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":"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 $(x,y)\\in E$ for each $x\\neq y$. The set of word-representable graphs generalizes several important and well-studied graph families, such as circle graphs, comparability graphs, 3-colorable graphs, graphs of vertex degree at most 3, etc. By answering an open question from [M. Halldorsson, S. Kitaev and A. Pyatkin, Alternation graphs, Lect. Notes Comput. Sci. 6986 (2011) 191--202. Proceedings of the 37th International Workshop on Graph-Theoretic ","authors_text":"Andrew Collins, Sergey Kitaev, Vadim Lozin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-06T19:40:46Z","title":"New results on word-representable graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1810","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:e0c32b89ff6a664dba34c0ebc25bc51189cc3923f0f7127cb013d2205ae29aa8","target":"record","created_at":"2026-05-18T02:59:44Z","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":"cb06f552c77682c12d78df3642a52ee15d23f5a6592d1c7a00b12726fe04a6ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-06T19:40:46Z","title_canon_sha256":"b9cd08893eb6f88e48494e7d886d862d606579c1dd791122602ee2ae63d1fd4d"},"schema_version":"1.0","source":{"id":"1307.1810","kind":"arxiv","version":2}},"canonical_sha256":"dffd0264d45e5720c2ca59a03087865fcbd66007b57d744d16bb44d8ef1f3688","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dffd0264d45e5720c2ca59a03087865fcbd66007b57d744d16bb44d8ef1f3688","first_computed_at":"2026-05-18T02:59:44.345181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:44.345181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NuQ8nueH3RPG3iw9jAmkGo2yOgMpBmvcLiIBuh1I9Zo7kCTZyaczmioj4hAwChB0GHHkxqVOEcH+r4a2vIQVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:44.346093Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.1810","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0c32b89ff6a664dba34c0ebc25bc51189cc3923f0f7127cb013d2205ae29aa8","sha256:f568e9cce9bb65021247113a2d1ef794b9852062711fb656d028bdea259ad604"],"state_sha256":"253855bf62de6aef5eddd4190132bc2023afd7e410bc42620e3f1628435cad09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ssfrUuIzWnkeSxPhEfyxBR7YmYz427yWj0/kIsqI8FbpSA2gCarCJgC2zUN5D/1JTNe+qZHfQG2/1wcaOyiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T00:16:02.302819Z","bundle_sha256":"57868d36b545143a00f065470b2948d70534ee1a6d53d064f6028c5d8578019f"}}