{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EZ7RLXIJRTOJDZRMEGYINK27GA","short_pith_number":"pith:EZ7RLXIJ","schema_version":"1.0","canonical_sha256":"267f15dd098cdc91e62c21b086ab5f301a902008773e8dcf23a2fc68d9da7a4c","source":{"kind":"arxiv","id":"1712.02870","version":3},"attestation_state":"computed","paper":{"title":"The Complexity of Maximum $k$-Order Bounded Component Set Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Shijin Rajakrishnan, Sounaka Mishra","submitted_at":"2017-11-29T09:52:09Z","abstract_excerpt":"Given a graph $G=(V, E)$ and a positive integer $k$, in Maximum $k$-Order Bounded Component Set (Max-$k$-OBCS), it is required to find a vertex set $S \\subseteq V$ of maximum size such that each component in the induced graph $G[S]$ has at most $k$ vertices. We prove that for constant $k$, Max-$k$-OBCS is hard to approximate within a factor of $n^{1 -\\epsilon}$, for any $\\epsilon > 0$, unless $\\mathsf{P} = \\mathsf{NP}$. This is an improvement on the previous lower bound of $\\sqrt{n}$ for Max-2-OBCS due to Orlovich et al. We provide lower bounds on the approximability when $k$ is not a constant"},"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":"1712.02870","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-29T09:52:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e04c05b46652d88852344fb0ea192eaf87917222fe0c138db1624de04bc752b8","abstract_canon_sha256":"03819b853c8208593d0e6d4d752f763c5ff6293a7ffbd4aa69c67b740ef33275"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:56.648988Z","signature_b64":"bsiCWVLm+6+XA9KA4qU5ZsCbRbbDzgkknan7xZeFJp6F6B3RBrp9ANaIFxYuJjE6SIMy9xNIIIUgQUzcgBJdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"267f15dd098cdc91e62c21b086ab5f301a902008773e8dcf23a2fc68d9da7a4c","last_reissued_at":"2026-05-18T00:19:56.648506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:56.648506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Maximum $k$-Order Bounded Component Set Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Shijin Rajakrishnan, Sounaka Mishra","submitted_at":"2017-11-29T09:52:09Z","abstract_excerpt":"Given a graph $G=(V, E)$ and a positive integer $k$, in Maximum $k$-Order Bounded Component Set (Max-$k$-OBCS), it is required to find a vertex set $S \\subseteq V$ of maximum size such that each component in the induced graph $G[S]$ has at most $k$ vertices. We prove that for constant $k$, Max-$k$-OBCS is hard to approximate within a factor of $n^{1 -\\epsilon}$, for any $\\epsilon > 0$, unless $\\mathsf{P} = \\mathsf{NP}$. This is an improvement on the previous lower bound of $\\sqrt{n}$ for Max-2-OBCS due to Orlovich et al. We provide lower bounds on the approximability when $k$ is not a constant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02870","kind":"arxiv","version":3},"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":"1712.02870","created_at":"2026-05-18T00:19:56.648585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.02870v3","created_at":"2026-05-18T00:19:56.648585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02870","created_at":"2026-05-18T00:19:56.648585+00:00"},{"alias_kind":"pith_short_12","alias_value":"EZ7RLXIJRTOJ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EZ7RLXIJRTOJDZRM","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EZ7RLXIJ","created_at":"2026-05-18T12:31:12.930513+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/EZ7RLXIJRTOJDZRMEGYINK27GA","json":"https://pith.science/pith/EZ7RLXIJRTOJDZRMEGYINK27GA.json","graph_json":"https://pith.science/api/pith-number/EZ7RLXIJRTOJDZRMEGYINK27GA/graph.json","events_json":"https://pith.science/api/pith-number/EZ7RLXIJRTOJDZRMEGYINK27GA/events.json","paper":"https://pith.science/paper/EZ7RLXIJ"},"agent_actions":{"view_html":"https://pith.science/pith/EZ7RLXIJRTOJDZRMEGYINK27GA","download_json":"https://pith.science/pith/EZ7RLXIJRTOJDZRMEGYINK27GA.json","view_paper":"https://pith.science/paper/EZ7RLXIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.02870&json=true","fetch_graph":"https://pith.science/api/pith-number/EZ7RLXIJRTOJDZRMEGYINK27GA/graph.json","fetch_events":"https://pith.science/api/pith-number/EZ7RLXIJRTOJDZRMEGYINK27GA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EZ7RLXIJRTOJDZRMEGYINK27GA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EZ7RLXIJRTOJDZRMEGYINK27GA/action/storage_attestation","attest_author":"https://pith.science/pith/EZ7RLXIJRTOJDZRMEGYINK27GA/action/author_attestation","sign_citation":"https://pith.science/pith/EZ7RLXIJRTOJDZRMEGYINK27GA/action/citation_signature","submit_replication":"https://pith.science/pith/EZ7RLXIJRTOJDZRMEGYINK27GA/action/replication_record"}},"created_at":"2026-05-18T00:19:56.648585+00:00","updated_at":"2026-05-18T00:19:56.648585+00:00"}