{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:T3BGJ4TDQWLF5HQVIEGM6QZ7U4","short_pith_number":"pith:T3BGJ4TD","schema_version":"1.0","canonical_sha256":"9ec264f26385965e9e15410ccf433fa72996dd6f2b6c4d6f6596486ddac67158","source":{"kind":"arxiv","id":"1711.02889","version":1},"attestation_state":"computed","paper":{"title":"FO and MSO approach to Some Graph Problems: Approximation and Poly time Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Kona Harshita, N. Sadagopan, Renjith. P, Sounaka Mishra","submitted_at":"2017-11-08T09:48:55Z","abstract_excerpt":"The focus of this paper is two fold. Firstly, we present a logical approach to graph modification problems such as minimum node deletion, edge deletion, edge augmentation problems by expressing them as an expression in first order (FO) logic. As a consequence, it follows that these problems have constant factor polynomial-time approximation algorithms. In particular, node deletion/edge deletion on a graph $G$ whose resultant is cograph, split, threshold, comparable, interval and permutation are $O(1)$ approximable. Secondly, we present a monadic second order (MSO) logic to minimum graph modifi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1711.02889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-08T09:48:55Z","cross_cats_sorted":[],"title_canon_sha256":"f3f5624894e91aca39d73a036f3777c6951fcb36ee87dbd6566ea5e3320cb76b","abstract_canon_sha256":"d0ac6dfca0327bebaa682f40d44a7c489ae5e55a396d85a9a0fd24d12d3aee03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:01.448224Z","signature_b64":"XerrgZ8ab5HWg1rTsuGbak+vb0OgnIn4skLSdrlI6pW9iJuhFsRfrTNkzdIDb6D3JkHvTxL8up8BWyixlqtJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ec264f26385965e9e15410ccf433fa72996dd6f2b6c4d6f6596486ddac67158","last_reissued_at":"2026-05-18T00:31:01.447689Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:01.447689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FO and MSO approach to Some Graph Problems: Approximation and Poly time Results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Kona Harshita, N. Sadagopan, Renjith. P, Sounaka Mishra","submitted_at":"2017-11-08T09:48:55Z","abstract_excerpt":"The focus of this paper is two fold. Firstly, we present a logical approach to graph modification problems such as minimum node deletion, edge deletion, edge augmentation problems by expressing them as an expression in first order (FO) logic. As a consequence, it follows that these problems have constant factor polynomial-time approximation algorithms. In particular, node deletion/edge deletion on a graph $G$ whose resultant is cograph, split, threshold, comparable, interval and permutation are $O(1)$ approximable. Secondly, we present a monadic second order (MSO) logic to minimum graph modifi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02889","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.02889","created_at":"2026-05-18T00:31:01.447789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02889v1","created_at":"2026-05-18T00:31:01.447789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02889","created_at":"2026-05-18T00:31:01.447789+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3BGJ4TDQWLF","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3BGJ4TDQWLF5HQV","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3BGJ4TD","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T3BGJ4TDQWLF5HQVIEGM6QZ7U4","json":"https://pith.science/pith/T3BGJ4TDQWLF5HQVIEGM6QZ7U4.json","graph_json":"https://pith.science/api/pith-number/T3BGJ4TDQWLF5HQVIEGM6QZ7U4/graph.json","events_json":"https://pith.science/api/pith-number/T3BGJ4TDQWLF5HQVIEGM6QZ7U4/events.json","paper":"https://pith.science/paper/T3BGJ4TD"},"agent_actions":{"view_html":"https://pith.science/pith/T3BGJ4TDQWLF5HQVIEGM6QZ7U4","download_json":"https://pith.science/pith/T3BGJ4TDQWLF5HQVIEGM6QZ7U4.json","view_paper":"https://pith.science/paper/T3BGJ4TD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02889&json=true","fetch_graph":"https://pith.science/api/pith-number/T3BGJ4TDQWLF5HQVIEGM6QZ7U4/graph.json","fetch_events":"https://pith.science/api/pith-number/T3BGJ4TDQWLF5HQVIEGM6QZ7U4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3BGJ4TDQWLF5HQVIEGM6QZ7U4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3BGJ4TDQWLF5HQVIEGM6QZ7U4/action/storage_attestation","attest_author":"https://pith.science/pith/T3BGJ4TDQWLF5HQVIEGM6QZ7U4/action/author_attestation","sign_citation":"https://pith.science/pith/T3BGJ4TDQWLF5HQVIEGM6QZ7U4/action/citation_signature","submit_replication":"https://pith.science/pith/T3BGJ4TDQWLF5HQVIEGM6QZ7U4/action/replication_record"}},"created_at":"2026-05-18T00:31:01.447789+00:00","updated_at":"2026-05-18T00:31:01.447789+00:00"}