{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:O3YZZ3LJY55YDEFI2QLWNZSMJY","short_pith_number":"pith:O3YZZ3LJ","canonical_record":{"source":{"id":"2502.00872","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-02T18:54:52Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9997c535f56fb385332db5006da1040d2832bce9b293c44fdd36cce271232184","abstract_canon_sha256":"c666838a64670474da6c53d03ace5a4346eb3979302e5afb5ab0f978f7f59cfe"},"schema_version":"1.0"},"canonical_sha256":"76f19ced69c77b8190a8d41766e64c4e0a6df6876d2ee47cd7f63be4e9e197b4","source":{"kind":"arxiv","id":"2502.00872","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00872","created_at":"2026-07-05T10:54:42Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00872v2","created_at":"2026-07-05T10:54:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00872","created_at":"2026-07-05T10:54:42Z"},{"alias_kind":"pith_short_12","alias_value":"O3YZZ3LJY55Y","created_at":"2026-07-05T10:54:42Z"},{"alias_kind":"pith_short_16","alias_value":"O3YZZ3LJY55YDEFI","created_at":"2026-07-05T10:54:42Z"},{"alias_kind":"pith_short_8","alias_value":"O3YZZ3LJ","created_at":"2026-07-05T10:54:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:O3YZZ3LJY55YDEFI2QLWNZSMJY","target":"record","payload":{"canonical_record":{"source":{"id":"2502.00872","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-02T18:54:52Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9997c535f56fb385332db5006da1040d2832bce9b293c44fdd36cce271232184","abstract_canon_sha256":"c666838a64670474da6c53d03ace5a4346eb3979302e5afb5ab0f978f7f59cfe"},"schema_version":"1.0"},"canonical_sha256":"76f19ced69c77b8190a8d41766e64c4e0a6df6876d2ee47cd7f63be4e9e197b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:42.570148Z","signature_b64":"uFcgsl13wGUhHzQ984mLN8S4gpmw3HIIMHMV/jL/D4zurZfavGgXN0a6h+fqVFMws7tRKeBRMIr7AFQ4kLikBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76f19ced69c77b8190a8d41766e64c4e0a6df6876d2ee47cd7f63be4e9e197b4","last_reissued_at":"2026-07-05T10:54:42.569665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:42.569665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.00872","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-07-05T10:54:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QABHL8nwXCq9NfE1zGxb7NbxSGF692r/n67PYG7l1CRUeFYXxKJIdyaN8xYtuwglpniBVbhFKigADzXx0hlxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T07:36:13.971518Z"},"content_sha256":"9600e0d85dc9239cc45d9715e6ea46eab894378d510a54e9d6d974fd04cf5020","schema_version":"1.0","event_id":"sha256:9600e0d85dc9239cc45d9715e6ea46eab894378d510a54e9d6d974fd04cf5020"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:O3YZZ3LJY55YDEFI2QLWNZSMJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Representation Number of Word-Representable Split Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Khyodeno Mozhui, K. V. Krishna, Tithi Dwary","submitted_at":"2025-02-02T18:54:52Z","abstract_excerpt":"A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. The word-representability of split graphs was studied in a series of papers in the literature, and the class of word-representable split graphs was characterized through semi-transitive orientation. Nonetheless, the representation number of this class of graphs is still not known. In general, determining the representation number of a word-representable graph is an NP-complete problem. In this work, through an algorithmic procedure, we show that the representation number of the class of word-repr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00872","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.00872/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:54:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yt0PEd+meztf6/F05Nx0BfwFunreJMOCb3775A3mmKe/bcyW5QS3qVSNnuEnOuiGliikD/OGqbRLErs5MTgnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T07:36:13.972054Z"},"content_sha256":"880c5218ac590ce679d7d496c2173bbad2d2b8bd9c27e50be6f550438e1917d7","schema_version":"1.0","event_id":"sha256:880c5218ac590ce679d7d496c2173bbad2d2b8bd9c27e50be6f550438e1917d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3YZZ3LJY55YDEFI2QLWNZSMJY/bundle.json","state_url":"https://pith.science/pith/O3YZZ3LJY55YDEFI2QLWNZSMJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3YZZ3LJY55YDEFI2QLWNZSMJY/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-10T07:36:13Z","links":{"resolver":"https://pith.science/pith/O3YZZ3LJY55YDEFI2QLWNZSMJY","bundle":"https://pith.science/pith/O3YZZ3LJY55YDEFI2QLWNZSMJY/bundle.json","state":"https://pith.science/pith/O3YZZ3LJY55YDEFI2QLWNZSMJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3YZZ3LJY55YDEFI2QLWNZSMJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:O3YZZ3LJY55YDEFI2QLWNZSMJY","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":"c666838a64670474da6c53d03ace5a4346eb3979302e5afb5ab0f978f7f59cfe","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-02T18:54:52Z","title_canon_sha256":"9997c535f56fb385332db5006da1040d2832bce9b293c44fdd36cce271232184"},"schema_version":"1.0","source":{"id":"2502.00872","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00872","created_at":"2026-07-05T10:54:42Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00872v2","created_at":"2026-07-05T10:54:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00872","created_at":"2026-07-05T10:54:42Z"},{"alias_kind":"pith_short_12","alias_value":"O3YZZ3LJY55Y","created_at":"2026-07-05T10:54:42Z"},{"alias_kind":"pith_short_16","alias_value":"O3YZZ3LJY55YDEFI","created_at":"2026-07-05T10:54:42Z"},{"alias_kind":"pith_short_8","alias_value":"O3YZZ3LJ","created_at":"2026-07-05T10:54:42Z"}],"graph_snapshots":[{"event_id":"sha256:880c5218ac590ce679d7d496c2173bbad2d2b8bd9c27e50be6f550438e1917d7","target":"graph","created_at":"2026-07-05T10:54:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.00872/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. The word-representability of split graphs was studied in a series of papers in the literature, and the class of word-representable split graphs was characterized through semi-transitive orientation. Nonetheless, the representation number of this class of graphs is still not known. In general, determining the representation number of a word-representable graph is an NP-complete problem. In this work, through an algorithmic procedure, we show that the representation number of the class of word-repr","authors_text":"Khyodeno Mozhui, K. V. Krishna, Tithi Dwary","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-02T18:54:52Z","title":"Representation Number of Word-Representable Split Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00872","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:9600e0d85dc9239cc45d9715e6ea46eab894378d510a54e9d6d974fd04cf5020","target":"record","created_at":"2026-07-05T10:54:42Z","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":"c666838a64670474da6c53d03ace5a4346eb3979302e5afb5ab0f978f7f59cfe","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-02T18:54:52Z","title_canon_sha256":"9997c535f56fb385332db5006da1040d2832bce9b293c44fdd36cce271232184"},"schema_version":"1.0","source":{"id":"2502.00872","kind":"arxiv","version":2}},"canonical_sha256":"76f19ced69c77b8190a8d41766e64c4e0a6df6876d2ee47cd7f63be4e9e197b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76f19ced69c77b8190a8d41766e64c4e0a6df6876d2ee47cd7f63be4e9e197b4","first_computed_at":"2026-07-05T10:54:42.569665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:54:42.569665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uFcgsl13wGUhHzQ984mLN8S4gpmw3HIIMHMV/jL/D4zurZfavGgXN0a6h+fqVFMws7tRKeBRMIr7AFQ4kLikBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:54:42.570148Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.00872","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9600e0d85dc9239cc45d9715e6ea46eab894378d510a54e9d6d974fd04cf5020","sha256:880c5218ac590ce679d7d496c2173bbad2d2b8bd9c27e50be6f550438e1917d7"],"state_sha256":"301effda8bc30573fff1bf1ff8afcd70af7a9af62d639bfc4409a62c3fbe92d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yso/+/+R0gryi3pW2zbslz8teaTv9Vi+kkKKKFK+mRRBJbjLE4rx/0nX7+CmXYbwSv7og9lGp77i128rOMGzBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T07:36:13.978116Z","bundle_sha256":"19b3b4b8ad9e23cbca1a999af10e0ef664896babcd183454743920028ce950ce"}}