{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QO6NAKHEFGAELLSX634M5LI5UB","short_pith_number":"pith:QO6NAKHE","canonical_record":{"source":{"id":"1602.08965","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-29T14:07:08Z","cross_cats_sorted":[],"title_canon_sha256":"b41c6e6735a74ef3264ed5d2fc9a7faea0df5adb58f37f7640f937ec5b89a88b","abstract_canon_sha256":"c178318b759f77659bd003ed18b6a3e11149e565075b2b92d7c7b04ad85d4179"},"schema_version":"1.0"},"canonical_sha256":"83bcd028e4298045ae57f6f8cead1da0517023a01552e7bd37ed2a4902a25b07","source":{"kind":"arxiv","id":"1602.08965","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08965","created_at":"2026-05-18T01:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08965v2","created_at":"2026-05-18T01:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08965","created_at":"2026-05-18T01:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"QO6NAKHEFGAE","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QO6NAKHEFGAELLSX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QO6NAKHE","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QO6NAKHEFGAELLSX634M5LI5UB","target":"record","payload":{"canonical_record":{"source":{"id":"1602.08965","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-29T14:07:08Z","cross_cats_sorted":[],"title_canon_sha256":"b41c6e6735a74ef3264ed5d2fc9a7faea0df5adb58f37f7640f937ec5b89a88b","abstract_canon_sha256":"c178318b759f77659bd003ed18b6a3e11149e565075b2b92d7c7b04ad85d4179"},"schema_version":"1.0"},"canonical_sha256":"83bcd028e4298045ae57f6f8cead1da0517023a01552e7bd37ed2a4902a25b07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:28.024849Z","signature_b64":"1FHY2IS/XUK56YIHDGJ99rpiZLkgbSCWq8Dv9sWhmFDppy4A1PfRz2a/SxXfTChfvZI+Fc/M4zKP9P1UkCDVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83bcd028e4298045ae57f6f8cead1da0517023a01552e7bd37ed2a4902a25b07","last_reissued_at":"2026-05-18T01:04:28.024247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:28.024247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.08965","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-18T01:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jIIGO90RO+RG0yfB9w5iPhiYrLsODFDLjkMZVGihA45ILaBr+DS9JqUMuanoal1OE5+tKrpG12C17A0arnMRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:35:00.925168Z"},"content_sha256":"ffc6fad4f09d8c1b1005a5df4415a57e202d3f293fa3a20643142ffacc940212","schema_version":"1.0","event_id":"sha256:ffc6fad4f09d8c1b1005a5df4415a57e202d3f293fa3a20643142ffacc940212"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QO6NAKHEFGAELLSX634M5LI5UB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On 132-representable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alice L.L. Gao, Philip B. Zhang, Sergey Kitaev","submitted_at":"2016-02-29T14:07:08Z","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$ is an edge in $E$. Word-representable graphs are the subject of a long research line in the literature initiated in \\cite{KP}, and they are the main focus in the recently published book \\cite{KL}. A word $w=w_1\\cdots w_{n}$ avoids the pattern $132$ if there are no $1\\leq i_1<i_2<i_3\\leq n$ such that $w_{i_1}<w_{i_3}<w_{i_2}$. The theory of patterns in words and permutations is a fast growing area discussed in \\cite{HM,Kit}.\n  A research d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08965","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-18T01:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+ciBS+7yDuS+wmaK7sDKtzBfMPwGMo574gcO+1pWVsJO2gnU4PIW2lfiAiEwcoc6+DugN5yFS15gDPHkzZTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:35:00.925534Z"},"content_sha256":"1807b1694a72674429b7cdcf03cd2402da74affbf03e7e187e4feb24b4b70de5","schema_version":"1.0","event_id":"sha256:1807b1694a72674429b7cdcf03cd2402da74affbf03e7e187e4feb24b4b70de5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QO6NAKHEFGAELLSX634M5LI5UB/bundle.json","state_url":"https://pith.science/pith/QO6NAKHEFGAELLSX634M5LI5UB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QO6NAKHEFGAELLSX634M5LI5UB/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-03T17:35:00Z","links":{"resolver":"https://pith.science/pith/QO6NAKHEFGAELLSX634M5LI5UB","bundle":"https://pith.science/pith/QO6NAKHEFGAELLSX634M5LI5UB/bundle.json","state":"https://pith.science/pith/QO6NAKHEFGAELLSX634M5LI5UB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QO6NAKHEFGAELLSX634M5LI5UB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QO6NAKHEFGAELLSX634M5LI5UB","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":"c178318b759f77659bd003ed18b6a3e11149e565075b2b92d7c7b04ad85d4179","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-29T14:07:08Z","title_canon_sha256":"b41c6e6735a74ef3264ed5d2fc9a7faea0df5adb58f37f7640f937ec5b89a88b"},"schema_version":"1.0","source":{"id":"1602.08965","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08965","created_at":"2026-05-18T01:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08965v2","created_at":"2026-05-18T01:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08965","created_at":"2026-05-18T01:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"QO6NAKHEFGAE","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QO6NAKHEFGAELLSX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QO6NAKHE","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:1807b1694a72674429b7cdcf03cd2402da74affbf03e7e187e4feb24b4b70de5","target":"graph","created_at":"2026-05-18T01:04:28Z","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 $xy$ is an edge in $E$. Word-representable graphs are the subject of a long research line in the literature initiated in \\cite{KP}, and they are the main focus in the recently published book \\cite{KL}. A word $w=w_1\\cdots w_{n}$ avoids the pattern $132$ if there are no $1\\leq i_1<i_2<i_3\\leq n$ such that $w_{i_1}<w_{i_3}<w_{i_2}$. The theory of patterns in words and permutations is a fast growing area discussed in \\cite{HM,Kit}.\n  A research d","authors_text":"Alice L.L. Gao, Philip B. Zhang, Sergey Kitaev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-29T14:07:08Z","title":"On 132-representable Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08965","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:ffc6fad4f09d8c1b1005a5df4415a57e202d3f293fa3a20643142ffacc940212","target":"record","created_at":"2026-05-18T01:04:28Z","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":"c178318b759f77659bd003ed18b6a3e11149e565075b2b92d7c7b04ad85d4179","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-29T14:07:08Z","title_canon_sha256":"b41c6e6735a74ef3264ed5d2fc9a7faea0df5adb58f37f7640f937ec5b89a88b"},"schema_version":"1.0","source":{"id":"1602.08965","kind":"arxiv","version":2}},"canonical_sha256":"83bcd028e4298045ae57f6f8cead1da0517023a01552e7bd37ed2a4902a25b07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83bcd028e4298045ae57f6f8cead1da0517023a01552e7bd37ed2a4902a25b07","first_computed_at":"2026-05-18T01:04:28.024247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:28.024247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1FHY2IS/XUK56YIHDGJ99rpiZLkgbSCWq8Dv9sWhmFDppy4A1PfRz2a/SxXfTChfvZI+Fc/M4zKP9P1UkCDVAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:28.024849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08965","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffc6fad4f09d8c1b1005a5df4415a57e202d3f293fa3a20643142ffacc940212","sha256:1807b1694a72674429b7cdcf03cd2402da74affbf03e7e187e4feb24b4b70de5"],"state_sha256":"d98562e10131f6252559dab9bbc8284680acc2f630094b6fdeb4e734963a70fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oHO44EXbOSY1F/92BvI94pDjK62O3xrNL6HPQ+I/rAA28tUJry3lo8IvKYauVxruk24KFHn0KZG41fRRMPu5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:35:00.927480Z","bundle_sha256":"e190ab0073e51b63fa111d8b3b1d8a9936d9e93fe731ca5b322fa5fbd0df53c0"}}