{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DXEV33SDE4J7V3LHWEX2PQRFRR","short_pith_number":"pith:DXEV33SD","canonical_record":{"source":{"id":"1102.3980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-19T09:27:16Z","cross_cats_sorted":[],"title_canon_sha256":"9dcb4524d3b93b3363f1c05678d79f98f0c9afe9de242fe819b9997007a27312","abstract_canon_sha256":"15f665a522318089aeea5f255505e34444dd75a44ef2a997ab0a5eb3f9b61d1f"},"schema_version":"1.0"},"canonical_sha256":"1dc95dee432713faed67b12fa7c2258c574fc49815dae376dbaee7db7328f6de","source":{"kind":"arxiv","id":"1102.3980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3980","created_at":"2026-05-18T04:16:01Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3980v1","created_at":"2026-05-18T04:16:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3980","created_at":"2026-05-18T04:16:01Z"},{"alias_kind":"pith_short_12","alias_value":"DXEV33SDE4J7","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DXEV33SDE4J7V3LH","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DXEV33SD","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DXEV33SDE4J7V3LHWEX2PQRFRR","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-19T09:27:16Z","cross_cats_sorted":[],"title_canon_sha256":"9dcb4524d3b93b3363f1c05678d79f98f0c9afe9de242fe819b9997007a27312","abstract_canon_sha256":"15f665a522318089aeea5f255505e34444dd75a44ef2a997ab0a5eb3f9b61d1f"},"schema_version":"1.0"},"canonical_sha256":"1dc95dee432713faed67b12fa7c2258c574fc49815dae376dbaee7db7328f6de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:01.988025Z","signature_b64":"4lP/2CJAyXCKh0/gfsn0MQ+W+zEKPa65YNlg4LVYGMB/txpbfSuabrIza3OviICL4lznuAzZPHvmZnZrbGjDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dc95dee432713faed67b12fa7c2258c574fc49815dae376dbaee7db7328f6de","last_reissued_at":"2026-05-18T04:16:01.987332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:01.987332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3980","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-18T04:16:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WD4q8eLy1sSByiuV9ioIJYXf/iiKW87rRvuI3dc3zINBw5llpbgQolbLrYfl/qnNNh5uBlj6rMzaSdiCP4LPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:13:22.582871Z"},"content_sha256":"aedb0dc49654d8a6490dd650d25b37baf2166c056de558a86bd7c849683a0738","schema_version":"1.0","event_id":"sha256:aedb0dc49654d8a6490dd650d25b37baf2166c056de558a86bd7c849683a0738"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DXEV33SDE4J7V3LHWEX2PQRFRR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Representability of Line Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher Severs, Henning Ulfarsson, Pavel Salimov, Sergey Kitaev","submitted_at":"2011-02-19T09:27:16Z","abstract_excerpt":"A graph G=(V,E) is 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) is in E for each x not equal to y. The motivation to study representable graphs came from algebra, but this subject is interesting from graph theoretical, computer science, and combinatorics on words points of view. In this paper, we prove that for n greater than 3, the line graph of an n-wheel is non-representable. This not only provides a new construction of non-representable graphs, but also answers an open question on representability of the line graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3980","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-18T04:16:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ItIWpGCg70SQR9aN4qezgHV/4dnd1GQn3aTM5Wz8sxLTJ936s00jItcAw8iGQ2WQacF1LrPb6HxRvOJs/llpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:13:22.583246Z"},"content_sha256":"205e76f715cdb50814b384ca99ba64abde3014b94a8703cf1e924e61e0a3d615","schema_version":"1.0","event_id":"sha256:205e76f715cdb50814b384ca99ba64abde3014b94a8703cf1e924e61e0a3d615"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXEV33SDE4J7V3LHWEX2PQRFRR/bundle.json","state_url":"https://pith.science/pith/DXEV33SDE4J7V3LHWEX2PQRFRR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXEV33SDE4J7V3LHWEX2PQRFRR/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-24T04:13:22Z","links":{"resolver":"https://pith.science/pith/DXEV33SDE4J7V3LHWEX2PQRFRR","bundle":"https://pith.science/pith/DXEV33SDE4J7V3LHWEX2PQRFRR/bundle.json","state":"https://pith.science/pith/DXEV33SDE4J7V3LHWEX2PQRFRR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXEV33SDE4J7V3LHWEX2PQRFRR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DXEV33SDE4J7V3LHWEX2PQRFRR","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":"15f665a522318089aeea5f255505e34444dd75a44ef2a997ab0a5eb3f9b61d1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-19T09:27:16Z","title_canon_sha256":"9dcb4524d3b93b3363f1c05678d79f98f0c9afe9de242fe819b9997007a27312"},"schema_version":"1.0","source":{"id":"1102.3980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3980","created_at":"2026-05-18T04:16:01Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3980v1","created_at":"2026-05-18T04:16:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3980","created_at":"2026-05-18T04:16:01Z"},{"alias_kind":"pith_short_12","alias_value":"DXEV33SDE4J7","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DXEV33SDE4J7V3LH","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DXEV33SD","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:205e76f715cdb50814b384ca99ba64abde3014b94a8703cf1e924e61e0a3d615","target":"graph","created_at":"2026-05-18T04:16:01Z","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 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) is in E for each x not equal to y. The motivation to study representable graphs came from algebra, but this subject is interesting from graph theoretical, computer science, and combinatorics on words points of view. In this paper, we prove that for n greater than 3, the line graph of an n-wheel is non-representable. This not only provides a new construction of non-representable graphs, but also answers an open question on representability of the line graph","authors_text":"Christopher Severs, Henning Ulfarsson, Pavel Salimov, Sergey Kitaev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-19T09:27:16Z","title":"On the Representability of Line Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3980","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:aedb0dc49654d8a6490dd650d25b37baf2166c056de558a86bd7c849683a0738","target":"record","created_at":"2026-05-18T04:16:01Z","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":"15f665a522318089aeea5f255505e34444dd75a44ef2a997ab0a5eb3f9b61d1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-19T09:27:16Z","title_canon_sha256":"9dcb4524d3b93b3363f1c05678d79f98f0c9afe9de242fe819b9997007a27312"},"schema_version":"1.0","source":{"id":"1102.3980","kind":"arxiv","version":1}},"canonical_sha256":"1dc95dee432713faed67b12fa7c2258c574fc49815dae376dbaee7db7328f6de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1dc95dee432713faed67b12fa7c2258c574fc49815dae376dbaee7db7328f6de","first_computed_at":"2026-05-18T04:16:01.987332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:01.987332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4lP/2CJAyXCKh0/gfsn0MQ+W+zEKPa65YNlg4LVYGMB/txpbfSuabrIza3OviICL4lznuAzZPHvmZnZrbGjDDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:01.988025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aedb0dc49654d8a6490dd650d25b37baf2166c056de558a86bd7c849683a0738","sha256:205e76f715cdb50814b384ca99ba64abde3014b94a8703cf1e924e61e0a3d615"],"state_sha256":"4061c6fa30cbc2149f2755c0089674828cc5a87bb4cdf5fa18e9fe74fa18ecf6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lb2HXZnElpNW3RwrAJkWgr5k2Yg4F2hZNJiBXfDDyyTJtIW6S3sij4wUIlHSjPwpjDFbXBIUOyVTaa84mHOzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:13:22.585478Z","bundle_sha256":"2eb4d585da146bbda6869b4773e7027583ccf4857422357f720c6b5f2501726d"}}