{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NWI76OBCOGMYBMIBNKX5T4WUXS","short_pith_number":"pith:NWI76OBC","canonical_record":{"source":{"id":"1503.08002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-27T09:32:34Z","cross_cats_sorted":[],"title_canon_sha256":"d28d4a1bb1bb8f740bfc041f0be2110d67287db97e7d083084b69a7881ff8b6b","abstract_canon_sha256":"c8e6cf597e176a9bce395c55b2e7a1c8e7d47816ca90759ce3fa87b5067d0b6c"},"schema_version":"1.0"},"canonical_sha256":"6d91ff3822719980b1016aafd9f2d4bcafdde01a7647d366a7b00cca80a0d10f","source":{"kind":"arxiv","id":"1503.08002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08002","created_at":"2026-05-18T02:20:11Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08002v1","created_at":"2026-05-18T02:20:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08002","created_at":"2026-05-18T02:20:11Z"},{"alias_kind":"pith_short_12","alias_value":"NWI76OBCOGMY","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NWI76OBCOGMYBMIB","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NWI76OBC","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NWI76OBCOGMYBMIBNKX5T4WUXS","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-27T09:32:34Z","cross_cats_sorted":[],"title_canon_sha256":"d28d4a1bb1bb8f740bfc041f0be2110d67287db97e7d083084b69a7881ff8b6b","abstract_canon_sha256":"c8e6cf597e176a9bce395c55b2e7a1c8e7d47816ca90759ce3fa87b5067d0b6c"},"schema_version":"1.0"},"canonical_sha256":"6d91ff3822719980b1016aafd9f2d4bcafdde01a7647d366a7b00cca80a0d10f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:11.747611Z","signature_b64":"p69BIW8qLOQ7QMJDYVtVMp5eXkhUuhUzRki/YvWmKJvQfFyVo9l+b5KgIZ6HyFmdVECifi/qH3iMNqWvzouFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d91ff3822719980b1016aafd9f2d4bcafdde01a7647d366a7b00cca80a0d10f","last_reissued_at":"2026-05-18T02:20:11.747151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:11.747151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08002","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:20:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A1jS7jEs1qB3dL1sCgz69D+TgAWjLFuSWAZa87Okgvh+gLIlzxDaEUaGX7wc38eQKicvTZMq1n8dy8Jdz3+GBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:35:54.241473Z"},"content_sha256":"93956e2ceb29ddf71921f9fff13e08ca7923727a7a12fb71532e41965c23255c","schema_version":"1.0","event_id":"sha256:93956e2ceb29ddf71921f9fff13e08ca7923727a7a12fb71532e41965c23255c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NWI76OBCOGMYBMIBNKX5T4WUXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Word-representability of subdivisions of triangular grid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brian Y. Sun, Sergey Kitaev, Zongqing Chen","submitted_at":"2015-03-27T09:32:34Z","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$. A triangular grid graph is a subgraph of a tiling of the plane with equilateral triangles defined by a finite number of triangles, called cells. A subdivision of a triangular grid graph is replacing some of its cells by plane copies of the complete graph $K_4$.\n  Inspired by a recent elegant result of Akrobotu et al., who classified word-representable triangulations of grid graphs related to convex polyominoes, we characterize word"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08002","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:20:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/a/TOxQKJIPReWZYGHEOL2DXXmLlFA5xFIDZR8JPMJqIsmsmeap1LCw+R2XcjX71IPFJy+yneobzRKegpf9oAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:35:54.241826Z"},"content_sha256":"001e23503a07be1ad4b0388322f6f409bb86d321a8f8d976dd3a751cc4f98956","schema_version":"1.0","event_id":"sha256:001e23503a07be1ad4b0388322f6f409bb86d321a8f8d976dd3a751cc4f98956"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NWI76OBCOGMYBMIBNKX5T4WUXS/bundle.json","state_url":"https://pith.science/pith/NWI76OBCOGMYBMIBNKX5T4WUXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NWI76OBCOGMYBMIBNKX5T4WUXS/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-20T05:35:54Z","links":{"resolver":"https://pith.science/pith/NWI76OBCOGMYBMIBNKX5T4WUXS","bundle":"https://pith.science/pith/NWI76OBCOGMYBMIBNKX5T4WUXS/bundle.json","state":"https://pith.science/pith/NWI76OBCOGMYBMIBNKX5T4WUXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NWI76OBCOGMYBMIBNKX5T4WUXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NWI76OBCOGMYBMIBNKX5T4WUXS","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":"c8e6cf597e176a9bce395c55b2e7a1c8e7d47816ca90759ce3fa87b5067d0b6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-27T09:32:34Z","title_canon_sha256":"d28d4a1bb1bb8f740bfc041f0be2110d67287db97e7d083084b69a7881ff8b6b"},"schema_version":"1.0","source":{"id":"1503.08002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08002","created_at":"2026-05-18T02:20:11Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08002v1","created_at":"2026-05-18T02:20:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08002","created_at":"2026-05-18T02:20:11Z"},{"alias_kind":"pith_short_12","alias_value":"NWI76OBCOGMY","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NWI76OBCOGMYBMIB","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NWI76OBC","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:001e23503a07be1ad4b0388322f6f409bb86d321a8f8d976dd3a751cc4f98956","target":"graph","created_at":"2026-05-18T02:20:11Z","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$. A triangular grid graph is a subgraph of a tiling of the plane with equilateral triangles defined by a finite number of triangles, called cells. A subdivision of a triangular grid graph is replacing some of its cells by plane copies of the complete graph $K_4$.\n  Inspired by a recent elegant result of Akrobotu et al., who classified word-representable triangulations of grid graphs related to convex polyominoes, we characterize word","authors_text":"Brian Y. Sun, Sergey Kitaev, Zongqing Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-27T09:32:34Z","title":"Word-representability of subdivisions of triangular grid graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08002","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:93956e2ceb29ddf71921f9fff13e08ca7923727a7a12fb71532e41965c23255c","target":"record","created_at":"2026-05-18T02:20:11Z","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":"c8e6cf597e176a9bce395c55b2e7a1c8e7d47816ca90759ce3fa87b5067d0b6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-27T09:32:34Z","title_canon_sha256":"d28d4a1bb1bb8f740bfc041f0be2110d67287db97e7d083084b69a7881ff8b6b"},"schema_version":"1.0","source":{"id":"1503.08002","kind":"arxiv","version":1}},"canonical_sha256":"6d91ff3822719980b1016aafd9f2d4bcafdde01a7647d366a7b00cca80a0d10f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d91ff3822719980b1016aafd9f2d4bcafdde01a7647d366a7b00cca80a0d10f","first_computed_at":"2026-05-18T02:20:11.747151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:11.747151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p69BIW8qLOQ7QMJDYVtVMp5eXkhUuhUzRki/YvWmKJvQfFyVo9l+b5KgIZ6HyFmdVECifi/qH3iMNqWvzouFCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:11.747611Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93956e2ceb29ddf71921f9fff13e08ca7923727a7a12fb71532e41965c23255c","sha256:001e23503a07be1ad4b0388322f6f409bb86d321a8f8d976dd3a751cc4f98956"],"state_sha256":"a038e24ce8baed70f878606120a01e088563f8b29bbd26166e2cb369efb232c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wGNUGasPQ8lnoNfT/MSTyMOjtWWY41RtaMIOkNhoeT8o82IChjvBS7D1rcvUkTmpKcQRgMpnNi0tSqY2GwyBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:35:54.243731Z","bundle_sha256":"802d1a3e14edf03b6cfbaa906a3ba9e27830bf86b7f97450d6ae0758e0dcde0d"}}