{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4JJ7TOABJSVEUSKRQLSZXPNARX","short_pith_number":"pith:4JJ7TOAB","canonical_record":{"source":{"id":"1610.00853","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-04T06:05:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a2505e57f694a62a7ef2afc0bbef552a0983a3abb825e844309ad3e87a856139","abstract_canon_sha256":"28b7b2215fae2473ebe9e5c3c1af8ec860d8cd5d2f690ce6c4632624065fed81"},"schema_version":"1.0"},"canonical_sha256":"e253f9b8014caa4a495182e59bbda08dc1497ea96366a5b0eccfe202e8c0284f","source":{"kind":"arxiv","id":"1610.00853","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00853","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00853v1","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00853","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"pith_short_12","alias_value":"4JJ7TOABJSVE","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4JJ7TOABJSVEUSKR","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4JJ7TOAB","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4JJ7TOABJSVEUSKRQLSZXPNARX","target":"record","payload":{"canonical_record":{"source":{"id":"1610.00853","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-04T06:05:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a2505e57f694a62a7ef2afc0bbef552a0983a3abb825e844309ad3e87a856139","abstract_canon_sha256":"28b7b2215fae2473ebe9e5c3c1af8ec860d8cd5d2f690ce6c4632624065fed81"},"schema_version":"1.0"},"canonical_sha256":"e253f9b8014caa4a495182e59bbda08dc1497ea96366a5b0eccfe202e8c0284f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:13.070293Z","signature_b64":"v8T6yr/ZkWVh0c0wHYZr2BTxKtthSJEjAOiILlYrdQVMc4QhmM7f2ToPetd+XYJmjJrqu09LCw8ZRviv4B6ZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e253f9b8014caa4a495182e59bbda08dc1497ea96366a5b0eccfe202e8c0284f","last_reissued_at":"2026-05-18T01:03:13.069682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:13.069682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.00853","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-18T01:03:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gro3KfZPbuTewgNfzEzLhxcZLyYt8mNiyIP3QAj6AhpQY/JfrLpWgoLRrOmKuNDVuox26n1PHuMct94Iq/nKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:33:30.012895Z"},"content_sha256":"1a7fd600d1e105f95b029ec5889f3c7605d9c3a3ebffc719fd7c6bd5dc106f4b","schema_version":"1.0","event_id":"sha256:1a7fd600d1e105f95b029ec5889f3c7605d9c3a3ebffc719fd7c6bd5dc106f4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4JJ7TOABJSVEUSKRQLSZXPNARX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Hitting Set and Steiner Tree in $SC_k$ and $2K_2$-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"N. Sadagopan, S. Dhanalakshmi","submitted_at":"2016-10-04T06:05:49Z","abstract_excerpt":"\\emph{Strictly Chordality-$k$ graphs ($SC_k$)} are graphs which are either cycle-free or every induced cycle is of length exactly $k, k \\geq 3$. Strictly chordality-3 and strictly chordality-4 graphs are well known chordal and chordal bipartite graphs, respectively. For $k\\geq 5$, the study has been recently initiated in \\cite{sadagopan} and various structural and algorithmic results are reported. In this paper, we show that maximum independent set (MIS), minimum vertex cover, minimum dominating set, feedback vertex set (FVS), odd cycle transversal (OCT), even cycle transversal (ECT) and Stein"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00853","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-18T01:03:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uBkLrMtInVuroJMo3zlMLlSJGxIVTNPn14ZgyQkqYqlUSEajHdm65P7FvBBpMFPaF+WmP1Yn/Fatve/bLbUhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:33:30.013243Z"},"content_sha256":"ba832e38757ca7481ca2dbc8790828b3761f94b5fe895cc529b7aa4f861b6ff7","schema_version":"1.0","event_id":"sha256:ba832e38757ca7481ca2dbc8790828b3761f94b5fe895cc529b7aa4f861b6ff7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JJ7TOABJSVEUSKRQLSZXPNARX/bundle.json","state_url":"https://pith.science/pith/4JJ7TOABJSVEUSKRQLSZXPNARX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JJ7TOABJSVEUSKRQLSZXPNARX/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-05-30T03:33:30Z","links":{"resolver":"https://pith.science/pith/4JJ7TOABJSVEUSKRQLSZXPNARX","bundle":"https://pith.science/pith/4JJ7TOABJSVEUSKRQLSZXPNARX/bundle.json","state":"https://pith.science/pith/4JJ7TOABJSVEUSKRQLSZXPNARX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JJ7TOABJSVEUSKRQLSZXPNARX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4JJ7TOABJSVEUSKRQLSZXPNARX","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":"28b7b2215fae2473ebe9e5c3c1af8ec860d8cd5d2f690ce6c4632624065fed81","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-04T06:05:49Z","title_canon_sha256":"a2505e57f694a62a7ef2afc0bbef552a0983a3abb825e844309ad3e87a856139"},"schema_version":"1.0","source":{"id":"1610.00853","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.00853","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"arxiv_version","alias_value":"1610.00853v1","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00853","created_at":"2026-05-18T01:03:13Z"},{"alias_kind":"pith_short_12","alias_value":"4JJ7TOABJSVE","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4JJ7TOABJSVEUSKR","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4JJ7TOAB","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:ba832e38757ca7481ca2dbc8790828b3761f94b5fe895cc529b7aa4f861b6ff7","target":"graph","created_at":"2026-05-18T01:03:13Z","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":"\\emph{Strictly Chordality-$k$ graphs ($SC_k$)} are graphs which are either cycle-free or every induced cycle is of length exactly $k, k \\geq 3$. Strictly chordality-3 and strictly chordality-4 graphs are well known chordal and chordal bipartite graphs, respectively. For $k\\geq 5$, the study has been recently initiated in \\cite{sadagopan} and various structural and algorithmic results are reported. In this paper, we show that maximum independent set (MIS), minimum vertex cover, minimum dominating set, feedback vertex set (FVS), odd cycle transversal (OCT), even cycle transversal (ECT) and Stein","authors_text":"N. Sadagopan, S. Dhanalakshmi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-04T06:05:49Z","title":"Constrained Hitting Set and Steiner Tree in $SC_k$ and $2K_2$-free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00853","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:1a7fd600d1e105f95b029ec5889f3c7605d9c3a3ebffc719fd7c6bd5dc106f4b","target":"record","created_at":"2026-05-18T01:03:13Z","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":"28b7b2215fae2473ebe9e5c3c1af8ec860d8cd5d2f690ce6c4632624065fed81","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-04T06:05:49Z","title_canon_sha256":"a2505e57f694a62a7ef2afc0bbef552a0983a3abb825e844309ad3e87a856139"},"schema_version":"1.0","source":{"id":"1610.00853","kind":"arxiv","version":1}},"canonical_sha256":"e253f9b8014caa4a495182e59bbda08dc1497ea96366a5b0eccfe202e8c0284f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e253f9b8014caa4a495182e59bbda08dc1497ea96366a5b0eccfe202e8c0284f","first_computed_at":"2026-05-18T01:03:13.069682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:13.069682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v8T6yr/ZkWVh0c0wHYZr2BTxKtthSJEjAOiILlYrdQVMc4QhmM7f2ToPetd+XYJmjJrqu09LCw8ZRviv4B6ZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:13.070293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.00853","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a7fd600d1e105f95b029ec5889f3c7605d9c3a3ebffc719fd7c6bd5dc106f4b","sha256:ba832e38757ca7481ca2dbc8790828b3761f94b5fe895cc529b7aa4f861b6ff7"],"state_sha256":"53bf6303591c0fa6106da12b4870a929f3c8d4375632e7c36b9d7470314b466e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"94c2IH5bx2c7bFns7KzvnFUCoDVeVCJio3pBG/fSnj1e132K9Ctm4/9FhxGW9gP1ouwzGtvGrXFoTyO/mI8VBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:33:30.015333Z","bundle_sha256":"e2e9f648de9bb795671c0c492138359ba9ba626b4609ab7169f843b5a560d40e"}}