{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZK2RWSRATSDUGSZXY2S7U3H2AX","short_pith_number":"pith:ZK2RWSRA","canonical_record":{"source":{"id":"1806.04673","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2018-06-12T13:01:51Z","cross_cats_sorted":[],"title_canon_sha256":"82116439b95938b44a5cfabb8114f056f7ccec66771140b223b72c605bac4eb9","abstract_canon_sha256":"77bc9997d73a7cca52b9d2f34244190c96fc7a58ea6a89c56b6e9060e4062a33"},"schema_version":"1.0"},"canonical_sha256":"cab51b4a209c87434b37c6a5fa6cfa05e4b9e177a46c784eabffb5c45b67f952","source":{"kind":"arxiv","id":"1806.04673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04673","created_at":"2026-05-18T00:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04673v1","created_at":"2026-05-18T00:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04673","created_at":"2026-05-18T00:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZK2RWSRATSDU","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZK2RWSRATSDUGSZX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZK2RWSRA","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZK2RWSRATSDUGSZXY2S7U3H2AX","target":"record","payload":{"canonical_record":{"source":{"id":"1806.04673","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2018-06-12T13:01:51Z","cross_cats_sorted":[],"title_canon_sha256":"82116439b95938b44a5cfabb8114f056f7ccec66771140b223b72c605bac4eb9","abstract_canon_sha256":"77bc9997d73a7cca52b9d2f34244190c96fc7a58ea6a89c56b6e9060e4062a33"},"schema_version":"1.0"},"canonical_sha256":"cab51b4a209c87434b37c6a5fa6cfa05e4b9e177a46c784eabffb5c45b67f952","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:21.101428Z","signature_b64":"VYjCS8ycgme1zLSAonZLxRXcWflJg6xs7SeKQEZejRVgPU3QUwrwjM40mI1uVp1IFASxz6Q5+EyvyaBa3m16AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cab51b4a209c87434b37c6a5fa6cfa05e4b9e177a46c784eabffb5c45b67f952","last_reissued_at":"2026-05-18T00:13:21.100856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:21.100856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.04673","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-18T00:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EGMH5eZUboxWrNo24Mc9C19mr+fM2YJB6V8k6/x0AHDQnqu4cxAkXykKjVWtOPHfKXkaegw/shP/IR8idLefAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T08:50:52.312376Z"},"content_sha256":"d42440c959a1789243786632aeb7e415f1b8a94c301ec68fe2beabf09e726d2a","schema_version":"1.0","event_id":"sha256:d42440c959a1789243786632aeb7e415f1b8a94c301ec68fe2beabf09e726d2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZK2RWSRATSDUGSZXY2S7U3H2AX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"2-uniform words: cycle graphs, and an algorithm to verify specific word-representations of graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ameya Daigavane, Benny K. George, Mrityunjay Singh","submitted_at":"2018-06-12T13:01:51Z","abstract_excerpt":"For an arbitrary word $w$ on an alphabet, we can define the alternating symbol graph, $G(w)$, as the graph in which the edge $(a, b)$ is in $E$ iff the letters $a$ and $b$ alternate in the word $w$. A graph $G = (V, E)$ is said to be word-representable if $G = G(w)$ for some word $w$ on $V$.\n  The general problem of checking whether a graph is word-representable has been shown to be NP-complete. However, checking whether a given graph is a 2-uniform word-representable (each letter occurring exactly twice in the word) has an $O(V^2)$-time algorithm, described by Spinrad. Related to this, we pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04673","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-18T00:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"02jLEst0ZXs8UWAg+t89C4a3UTwfb0zC1m5drrSkwHXCSOxZz4P1tlh4enPXJA7C03YKx4viW5fyYTs36bOmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T08:50:52.312754Z"},"content_sha256":"4d04a22fea8fc6afaaca683b905355e6c861a757d4393f576ff0af067a750598","schema_version":"1.0","event_id":"sha256:4d04a22fea8fc6afaaca683b905355e6c861a757d4393f576ff0af067a750598"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX/bundle.json","state_url":"https://pith.science/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX/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-21T08:50:52Z","links":{"resolver":"https://pith.science/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX","bundle":"https://pith.science/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX/bundle.json","state":"https://pith.science/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZK2RWSRATSDUGSZXY2S7U3H2AX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZK2RWSRATSDUGSZXY2S7U3H2AX","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":"77bc9997d73a7cca52b9d2f34244190c96fc7a58ea6a89c56b6e9060e4062a33","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2018-06-12T13:01:51Z","title_canon_sha256":"82116439b95938b44a5cfabb8114f056f7ccec66771140b223b72c605bac4eb9"},"schema_version":"1.0","source":{"id":"1806.04673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.04673","created_at":"2026-05-18T00:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"1806.04673v1","created_at":"2026-05-18T00:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04673","created_at":"2026-05-18T00:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"ZK2RWSRATSDU","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZK2RWSRATSDUGSZX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZK2RWSRA","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:4d04a22fea8fc6afaaca683b905355e6c861a757d4393f576ff0af067a750598","target":"graph","created_at":"2026-05-18T00:13:21Z","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":"For an arbitrary word $w$ on an alphabet, we can define the alternating symbol graph, $G(w)$, as the graph in which the edge $(a, b)$ is in $E$ iff the letters $a$ and $b$ alternate in the word $w$. A graph $G = (V, E)$ is said to be word-representable if $G = G(w)$ for some word $w$ on $V$.\n  The general problem of checking whether a graph is word-representable has been shown to be NP-complete. However, checking whether a given graph is a 2-uniform word-representable (each letter occurring exactly twice in the word) has an $O(V^2)$-time algorithm, described by Spinrad. Related to this, we pro","authors_text":"Ameya Daigavane, Benny K. George, Mrityunjay Singh","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2018-06-12T13:01:51Z","title":"2-uniform words: cycle graphs, and an algorithm to verify specific word-representations of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04673","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:d42440c959a1789243786632aeb7e415f1b8a94c301ec68fe2beabf09e726d2a","target":"record","created_at":"2026-05-18T00:13:21Z","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":"77bc9997d73a7cca52b9d2f34244190c96fc7a58ea6a89c56b6e9060e4062a33","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.CO","submitted_at":"2018-06-12T13:01:51Z","title_canon_sha256":"82116439b95938b44a5cfabb8114f056f7ccec66771140b223b72c605bac4eb9"},"schema_version":"1.0","source":{"id":"1806.04673","kind":"arxiv","version":1}},"canonical_sha256":"cab51b4a209c87434b37c6a5fa6cfa05e4b9e177a46c784eabffb5c45b67f952","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cab51b4a209c87434b37c6a5fa6cfa05e4b9e177a46c784eabffb5c45b67f952","first_computed_at":"2026-05-18T00:13:21.100856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:21.100856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VYjCS8ycgme1zLSAonZLxRXcWflJg6xs7SeKQEZejRVgPU3QUwrwjM40mI1uVp1IFASxz6Q5+EyvyaBa3m16AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:21.101428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.04673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d42440c959a1789243786632aeb7e415f1b8a94c301ec68fe2beabf09e726d2a","sha256:4d04a22fea8fc6afaaca683b905355e6c861a757d4393f576ff0af067a750598"],"state_sha256":"e91636d226d3b9b0dd30a7e68d450951b6a9d72b8f3415160873019d6a2e1d9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TnJ6u10M+AlkL3nP5XHkobZ1/qKCxRIn1ujb8JpxtJHfvRkazq9vkot/9nXkS8S5v3JceSVlzQ3vH/LblkFrCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T08:50:52.315883Z","bundle_sha256":"db333ba91dc523854de911df9328939a6f9aa0bf504b62e525b4fed15131a5d6"}}