{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:W3B4E7NENSNUZYR6CYSVDXXKYB","short_pith_number":"pith:W3B4E7NE","canonical_record":{"source":{"id":"1602.03802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T17:56:54Z","cross_cats_sorted":[],"title_canon_sha256":"cd0588be1f08a8db8152d6901833422b6154787469c60ef0e005ccd9bbab42fd","abstract_canon_sha256":"4f59011e3373ef317271179df54b6179038ce2285e3aa1bd7c79f5a96a67bc0d"},"schema_version":"1.0"},"canonical_sha256":"b6c3c27da46c9b4ce23e162551deeac07296e4ed90d7184b0f55a3df02b8e22b","source":{"kind":"arxiv","id":"1602.03802","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03802","created_at":"2026-05-18T01:18:08Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03802v2","created_at":"2026-05-18T01:18:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03802","created_at":"2026-05-18T01:18:08Z"},{"alias_kind":"pith_short_12","alias_value":"W3B4E7NENSNU","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W3B4E7NENSNUZYR6","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W3B4E7NE","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:W3B4E7NENSNUZYR6CYSVDXXKYB","target":"record","payload":{"canonical_record":{"source":{"id":"1602.03802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T17:56:54Z","cross_cats_sorted":[],"title_canon_sha256":"cd0588be1f08a8db8152d6901833422b6154787469c60ef0e005ccd9bbab42fd","abstract_canon_sha256":"4f59011e3373ef317271179df54b6179038ce2285e3aa1bd7c79f5a96a67bc0d"},"schema_version":"1.0"},"canonical_sha256":"b6c3c27da46c9b4ce23e162551deeac07296e4ed90d7184b0f55a3df02b8e22b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:08.135292Z","signature_b64":"vAHJQjloXDW7jghu1toN1ahFiKIeWr91qgfJGueIotLjfM5nazNxrWNDuYTRZC3MPDTIbc0Q8w3L93qnoGVxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6c3c27da46c9b4ce23e162551deeac07296e4ed90d7184b0f55a3df02b8e22b","last_reissued_at":"2026-05-18T01:18:08.134667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:08.134667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.03802","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-05-18T01:18:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6tsxsUdYoGBXEPudf75TLCd1mhybRNxVnQBSDsQKpxTkX3J7kW9IJktpAHuvA75X7pXwwdY41j3kZOFoPTwrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:06:21.623717Z"},"content_sha256":"bd29420245dec0d230203516857a33deaa290676926f3770c1b368ae86538ac5","schema_version":"1.0","event_id":"sha256:bd29420245dec0d230203516857a33deaa290676926f3770c1b368ae86538ac5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:W3B4E7NENSNUZYR6CYSVDXXKYB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On 2K2-free graphs - Structural and Combinatorial View","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"N. Sadagopan, S. Dhanalakshmi, V. Manogna","submitted_at":"2016-02-11T17:56:54Z","abstract_excerpt":"A connected graph is 2K2-free if it does not contain a pair of independent edges as an induced subgraph. In this paper, we present the structural characterization of minimal vertex separator and show that there are polynomial number of minimal vertex separators in 2K2-free graphs. Further, using the enumeration we show that finding minimum connected vertex separator in 2K2-free graphs is polynomial time solvable. We highlight that finding minimum connected vertex separator is NP-complete in Chordality 5 graphs, which is a super graph class of 2K2-free graphs. Other study includes, enumeration "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03802","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":""},"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-18T01:18:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u8ey0X60FADJjQpCOQJX03gdbno+Y5vlPZtdllNqEbf4H04LZZtK12S55HswXHe3Fj5bISDSByjeb6LLwFl4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T22:06:21.624426Z"},"content_sha256":"807d28561b16b6e54024ef57814f9ef6e1897e1b2a907b61e49e56e0d8879a8f","schema_version":"1.0","event_id":"sha256:807d28561b16b6e54024ef57814f9ef6e1897e1b2a907b61e49e56e0d8879a8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3B4E7NENSNUZYR6CYSVDXXKYB/bundle.json","state_url":"https://pith.science/pith/W3B4E7NENSNUZYR6CYSVDXXKYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3B4E7NENSNUZYR6CYSVDXXKYB/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-10T22:06:21Z","links":{"resolver":"https://pith.science/pith/W3B4E7NENSNUZYR6CYSVDXXKYB","bundle":"https://pith.science/pith/W3B4E7NENSNUZYR6CYSVDXXKYB/bundle.json","state":"https://pith.science/pith/W3B4E7NENSNUZYR6CYSVDXXKYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3B4E7NENSNUZYR6CYSVDXXKYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:W3B4E7NENSNUZYR6CYSVDXXKYB","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":"4f59011e3373ef317271179df54b6179038ce2285e3aa1bd7c79f5a96a67bc0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T17:56:54Z","title_canon_sha256":"cd0588be1f08a8db8152d6901833422b6154787469c60ef0e005ccd9bbab42fd"},"schema_version":"1.0","source":{"id":"1602.03802","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03802","created_at":"2026-05-18T01:18:08Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03802v2","created_at":"2026-05-18T01:18:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03802","created_at":"2026-05-18T01:18:08Z"},{"alias_kind":"pith_short_12","alias_value":"W3B4E7NENSNU","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"W3B4E7NENSNUZYR6","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"W3B4E7NE","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:807d28561b16b6e54024ef57814f9ef6e1897e1b2a907b61e49e56e0d8879a8f","target":"graph","created_at":"2026-05-18T01:18:08Z","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 connected graph is 2K2-free if it does not contain a pair of independent edges as an induced subgraph. In this paper, we present the structural characterization of minimal vertex separator and show that there are polynomial number of minimal vertex separators in 2K2-free graphs. Further, using the enumeration we show that finding minimum connected vertex separator in 2K2-free graphs is polynomial time solvable. We highlight that finding minimum connected vertex separator is NP-complete in Chordality 5 graphs, which is a super graph class of 2K2-free graphs. Other study includes, enumeration ","authors_text":"N. Sadagopan, S. Dhanalakshmi, V. Manogna","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T17:56:54Z","title":"On 2K2-free graphs - Structural and Combinatorial View"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03802","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:bd29420245dec0d230203516857a33deaa290676926f3770c1b368ae86538ac5","target":"record","created_at":"2026-05-18T01:18:08Z","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":"4f59011e3373ef317271179df54b6179038ce2285e3aa1bd7c79f5a96a67bc0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T17:56:54Z","title_canon_sha256":"cd0588be1f08a8db8152d6901833422b6154787469c60ef0e005ccd9bbab42fd"},"schema_version":"1.0","source":{"id":"1602.03802","kind":"arxiv","version":2}},"canonical_sha256":"b6c3c27da46c9b4ce23e162551deeac07296e4ed90d7184b0f55a3df02b8e22b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6c3c27da46c9b4ce23e162551deeac07296e4ed90d7184b0f55a3df02b8e22b","first_computed_at":"2026-05-18T01:18:08.134667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:08.134667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vAHJQjloXDW7jghu1toN1ahFiKIeWr91qgfJGueIotLjfM5nazNxrWNDuYTRZC3MPDTIbc0Q8w3L93qnoGVxDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:08.135292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03802","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd29420245dec0d230203516857a33deaa290676926f3770c1b368ae86538ac5","sha256:807d28561b16b6e54024ef57814f9ef6e1897e1b2a907b61e49e56e0d8879a8f"],"state_sha256":"ad4250f9eabfc55a99887ed96efec7dd720ba2cebc05007ca0bb0b625b7ce18d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XKUl39hGNMZhjKdbR3AsEFRAA5//fJiiSro3uALN1oYoU7CLyOcirt6YEbb7Hpd9WMwp4NO+HvGWSsFC0XdjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T22:06:21.629051Z","bundle_sha256":"5bb75ff359cef4ad0fb37832cd6f1e69cd8933434abfc0ff50d9b45027d5371b"}}