{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:E4NVXJTECVV66Q2RGJKZXPZHZ7","short_pith_number":"pith:E4NVXJTE","canonical_record":{"source":{"id":"2607.13517","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-15T07:13:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b207db48810e337a2c235fca1723b48e39ae04a391314cc3fe40914b3b83c659","abstract_canon_sha256":"fe269addc70f7b02eb161120458ee1d481dc745d67eb0aa7d33f76345d369904"},"schema_version":"1.0"},"canonical_sha256":"271b5ba664156bef435132559bbf27cfcf40dcae2a456d1a40b18762d19489d5","source":{"kind":"arxiv","id":"2607.13517","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.13517","created_at":"2026-07-16T01:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"2607.13517v1","created_at":"2026-07-16T01:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13517","created_at":"2026-07-16T01:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"E4NVXJTECVV6","created_at":"2026-07-16T01:22:16Z"},{"alias_kind":"pith_short_16","alias_value":"E4NVXJTECVV66Q2R","created_at":"2026-07-16T01:22:16Z"},{"alias_kind":"pith_short_8","alias_value":"E4NVXJTE","created_at":"2026-07-16T01:22:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:E4NVXJTECVV66Q2RGJKZXPZHZ7","target":"record","payload":{"canonical_record":{"source":{"id":"2607.13517","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-15T07:13:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"b207db48810e337a2c235fca1723b48e39ae04a391314cc3fe40914b3b83c659","abstract_canon_sha256":"fe269addc70f7b02eb161120458ee1d481dc745d67eb0aa7d33f76345d369904"},"schema_version":"1.0"},"canonical_sha256":"271b5ba664156bef435132559bbf27cfcf40dcae2a456d1a40b18762d19489d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T01:22:16.888228Z","signature_b64":"KoASkwBCV0qR0ykIe6B/51Cm3Ie8EVPp5xONxEuyhZRFkH49HkeZupMD6cBmj43IrzQXBPjpGDaYhIORmX9PCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"271b5ba664156bef435132559bbf27cfcf40dcae2a456d1a40b18762d19489d5","last_reissued_at":"2026-07-16T01:22:16.887399Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T01:22:16.887399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.13517","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-07-16T01:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fSd3f4J0wsBr2YYlP/u3kkktbASfD7/tWQb/QigylmEJJjhXLJhnm6WrphV3eXVndEmBVNjyM5JGJFx0PXijDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T04:29:26.772076Z"},"content_sha256":"30d475633530614b1c49f2f78a0203997345ba1bf9fc74952798d8720f6bd6c6","schema_version":"1.0","event_id":"sha256:30d475633530614b1c49f2f78a0203997345ba1bf9fc74952798d8720f6bd6c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:E4NVXJTECVV66Q2RGJKZXPZHZ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness of Vertex Splitting: Cographs, Chordal Graphs, and Beyond","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"R. B. Sandeep, Satyabrata Jana, Shivesh K. Roy","submitted_at":"2026-07-15T07:13:31Z","abstract_excerpt":"Vertex splitting replaces a vertex (v) by two nonadjacent vertices whose neighborhoods together equal (N(v)). A split is \\emph{exclusive} if these neighborhoods are disjoint and \\emph{shallow} if no newly created vertex is split again. For a graph property (\\Pi), \\textsc{(\\Pi)-Vertex Splitting} asks whether at most (k) splits can transform a graph (G) into one satisfying (\\Pi).\n  We continue the systematic study of this operation and settle several open problems. First, we prove that \\textsc{Cograph Vertex Splitting} is \\textsf{NP}-complete, even on graphs of girth at least 5, resolving a ques"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13517","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.13517/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-16T01:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hod4jT+2B/QZI0uX4JeXaycOAXmCN8rRB3HZDOOaDjsnC3uo5ND3Ic8ldGnOoPyYo5luiJPy/RK/dFlC3vrlCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T04:29:26.772710Z"},"content_sha256":"c7307f3f532233c9f04e1a272bb0195869fd787b6eed4cffe854479c4185e1d2","schema_version":"1.0","event_id":"sha256:c7307f3f532233c9f04e1a272bb0195869fd787b6eed4cffe854479c4185e1d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4NVXJTECVV66Q2RGJKZXPZHZ7/bundle.json","state_url":"https://pith.science/pith/E4NVXJTECVV66Q2RGJKZXPZHZ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4NVXJTECVV66Q2RGJKZXPZHZ7/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-22T04:29:26Z","links":{"resolver":"https://pith.science/pith/E4NVXJTECVV66Q2RGJKZXPZHZ7","bundle":"https://pith.science/pith/E4NVXJTECVV66Q2RGJKZXPZHZ7/bundle.json","state":"https://pith.science/pith/E4NVXJTECVV66Q2RGJKZXPZHZ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4NVXJTECVV66Q2RGJKZXPZHZ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:E4NVXJTECVV66Q2RGJKZXPZHZ7","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":"fe269addc70f7b02eb161120458ee1d481dc745d67eb0aa7d33f76345d369904","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-15T07:13:31Z","title_canon_sha256":"b207db48810e337a2c235fca1723b48e39ae04a391314cc3fe40914b3b83c659"},"schema_version":"1.0","source":{"id":"2607.13517","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.13517","created_at":"2026-07-16T01:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"2607.13517v1","created_at":"2026-07-16T01:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13517","created_at":"2026-07-16T01:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"E4NVXJTECVV6","created_at":"2026-07-16T01:22:16Z"},{"alias_kind":"pith_short_16","alias_value":"E4NVXJTECVV66Q2R","created_at":"2026-07-16T01:22:16Z"},{"alias_kind":"pith_short_8","alias_value":"E4NVXJTE","created_at":"2026-07-16T01:22:16Z"}],"graph_snapshots":[{"event_id":"sha256:c7307f3f532233c9f04e1a272bb0195869fd787b6eed4cffe854479c4185e1d2","target":"graph","created_at":"2026-07-16T01:22:16Z","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/2607.13517/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Vertex splitting replaces a vertex (v) by two nonadjacent vertices whose neighborhoods together equal (N(v)). A split is \\emph{exclusive} if these neighborhoods are disjoint and \\emph{shallow} if no newly created vertex is split again. For a graph property (\\Pi), \\textsc{(\\Pi)-Vertex Splitting} asks whether at most (k) splits can transform a graph (G) into one satisfying (\\Pi).\n  We continue the systematic study of this operation and settle several open problems. First, we prove that \\textsc{Cograph Vertex Splitting} is \\textsf{NP}-complete, even on graphs of girth at least 5, resolving a ques","authors_text":"R. B. Sandeep, Satyabrata Jana, Shivesh K. Roy","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-15T07:13:31Z","title":"Hardness of Vertex Splitting: Cographs, Chordal Graphs, and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13517","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:30d475633530614b1c49f2f78a0203997345ba1bf9fc74952798d8720f6bd6c6","target":"record","created_at":"2026-07-16T01:22:16Z","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":"fe269addc70f7b02eb161120458ee1d481dc745d67eb0aa7d33f76345d369904","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-15T07:13:31Z","title_canon_sha256":"b207db48810e337a2c235fca1723b48e39ae04a391314cc3fe40914b3b83c659"},"schema_version":"1.0","source":{"id":"2607.13517","kind":"arxiv","version":1}},"canonical_sha256":"271b5ba664156bef435132559bbf27cfcf40dcae2a456d1a40b18762d19489d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"271b5ba664156bef435132559bbf27cfcf40dcae2a456d1a40b18762d19489d5","first_computed_at":"2026-07-16T01:22:16.887399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-16T01:22:16.887399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KoASkwBCV0qR0ykIe6B/51Cm3Ie8EVPp5xONxEuyhZRFkH49HkeZupMD6cBmj43IrzQXBPjpGDaYhIORmX9PCA==","signature_status":"signed_v1","signed_at":"2026-07-16T01:22:16.888228Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.13517","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30d475633530614b1c49f2f78a0203997345ba1bf9fc74952798d8720f6bd6c6","sha256:c7307f3f532233c9f04e1a272bb0195869fd787b6eed4cffe854479c4185e1d2"],"state_sha256":"d917525ac6e3d1357b0bf474b1e327ed0b5a3d8bc4131e040487881a208c95e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/uJEje5r/fui4qRIRt2RsLEKJyDwB3GYOu8u32uUlxMG+dd0lULYKzOZcIY2g32tXpzsUUiLdgSX28SjPTd0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T04:29:26.777840Z","bundle_sha256":"e7b290c35b558931d55bd5fa62701bdd4b279287f649434db32f7a43b92816bf"}}